Non-optimality of unitary operations for dense coding
Michael R. Beran, Scott M. Cohen

TL;DR
This paper challenges the assumption that unitary operations are always optimal for dense coding, providing numerical and analytical evidence that non-unitary operations can sometimes achieve higher classical information transmission.
Contribution
It demonstrates, through numerical and analytical methods, that non-unitary encoding can outperform unitary encoding in dense coding under certain conditions.
Findings
Non-unitary operations can encode more information than unitary ones in some dense coding scenarios.
Numerical evidence supports the existence of cases where non-unitary encoding is superior.
Analytical arguments explain the circumstances favoring non-unitary encoding.
Abstract
One of the primary goals of information theory is to provide limits on the amount of information it is possible to send through various types of communication channels, and to understand the encoding methods that will allow one to achieve such limits. An early surprise in the study of \textit{quantum} information theory was the discovery of dense coding, which demonstrated that it is possible to achieve higher rates for communicating classical information by transmitting quantum systems, rather than classical ones. To achieve the highest possible rate, the transmitted quantum system must initially be maximally entangled with another that is held by the receiver, and the sender can achieve this rate by encoding her messages with unitary operations. The situation where these two systems are not maximally entangled has been intensively studied in recent years, and to date it has appeared…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
