Deterministic dense coding and entanglement entropy
- 5 February 2008
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 77 (2) , 022305
Abstract
We present an analytical study of the standard two-party deterministic dense-coding protocol, under which communication of perfectly distinguishable messages takes place via a qudit from a pair of nonmaximally entangled qudits in a pure state . Our results include the following: (i) We prove that it is possible for a state with lower entanglement entropy to support the sending of a greater number of perfectly distinguishable messages than one with higher entanglement entropy, confirming a result suggested via numerical analysis in Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. (ii) By explicit construction of families of local unitary operators, we verify, for dimensions and , a conjecture of Mozes et al. about the minimum entanglement entropy that supports the sending of messages, ; moreover, we show that the and cases of the conjecture are valid in all dimensions. (iii) Given that allows the sending of messages and has as its largest Schmidt coefficient, we show that the inequality , established by Wu et al. [Phys. Rev. A 73, 042311 (2006)], must actually take the form if , while our constructions of local unitaries show that equality can be realized if or .
Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Deterministic and unambiguous dense codingPhysical Review A, 2006
- Boundary effect of deterministic dense codingPhysical Review A, 2006
- Deterministic dense coding with partially entangled statesPhysical Review A, 2005
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen statesPhysical Review Letters, 1992