Locally accessible information from multipartite ensembles
classification
🪐 quant-ph
keywords
multipartiteboundaccessibleensemblesinformationlocallyupperallows
read the original abstract
We present a universal Holevo-like upper bound on the locally accessible information for arbitrary multipartite ensembles. This bound allows us to analyze the indistinguishability of a set of orthogonal states under LOCC. We also derive the upper bound for the capacity of distributed dense coding with multipartite senders and multipartite receivers.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.