Abstract
We consider dense coding with partially entangled states on bipartite systems of dimension , studying the conditions under which a given number of messages, , can be deterministically transmitted. It is known that the largest Schmidt coefficient, , must obey the bound , and considerable empirical evidence points to the conclusion that there exist states satisfying for every and except the special cases and . We provide additional conditions under which this bound cannot be reached—that is, when it must be that —yielding insight into the shapes of boundaries separating entangled states that allow messages from those that allow only . We also show that these conclusions hold no matter what operations are used for the encoding, and in so doing, identify circumstances under which unitary encoding is strictly better than nonunitary.
- Received 20 October 2008
DOI:https://doi.org/10.1103/PhysRevA.79.032307
©2009 American Physical Society