Overcoming a limitation of deterministic dense coding with a non-maximally entangled initial state
P. S. Bourdon, E. Gerjuoy

TL;DR
This paper investigates the limitations of deterministic dense coding with non-maximally entangled states and proposes a protocol that can surpass these limits with high probability by combining unitary and non-trace-preserving operations.
Contribution
It demonstrates that the communication limit persists even with general quantum operations and introduces a protocol to overcome this limit when the entanglement is nearly maximal.
Findings
Limit of d^2-2 messages remains with general quantum operations.
Proposed protocol encodes d^2-2 messages unitarily and the (d^2-1)-th via a non-trace-preserving operation.
High probability success when the largest Schmidt coefficient is close to sqrt(1/d).
Abstract
Under two-party deterministic dense-coding, Alice communicates (perfectly distinguishable) messages to Bob via a qudit from a pair of entangled qudits in pure state |Psi>. If |Psi> represents a maximally entangled state (i.e., each of its Schmidt coefficients is sqrt(1/d)), then Alice can convey to Bob one of d^2 distinct messages. If |Psi> is not maximally entangled, then Ji et al. [Phys. Rev. A 73, 034307 (2006)] have shown that under the original deterministic dense-coding protocol, in which messages are encoded by unitary operations performed on Alice's qudit, it is impossible to encode d^2-1 messages. Encoding d^2-2 is possible; see, e.g., the numerical studies by Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. Answering a question raised by Wu et al. [Phys. Rev. A 73, 042311 (2006)], we show that when |Psi> is not maximally entangled, the communications limit of d^2-2 messages…
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.
