Engineering Papers⌕ Search

Engineering topics

Gerjuoy, E

Publications and source records attributed to Gerjuoy, E.

Overcoming a limitation of deterministic dense coding with a nonmaximally entangled initial state

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 {radical}(1/d)), then Alice can convey to Bob one of d{sup 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{sup 2}-1 messages. Encoding d{sup 2}-2 messages is possible; see, for example, 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{sup 2}-2 messages persists even when the requirement that Alice encode by unitary operations on her qudit is weakened to allow encoding by more general quantum operators. We then describe a dense-coding protocol that can overcome this limitation with high probability, assuming the largest Schmidt coefficient of |{Psi}> is sufficiently close to {radical}(1/d). In this protocol, d{sup 2}-2 of the messages are encoded via unitary operations on Alice's qudit, and the final (d{sup 2}-1)-th message is encoded via a non-trace-preserving quantum operation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Deterministic dense coding and entanglement entropy

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 |{psi}>. Our results include the following: (i) We prove that it is possible for a state |{psi}> 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 d=3 and d=4, a conjecture of Mozes et al. about the minimum entanglement entropy that supports the sending of d+j messages, 2{<=}j{<=}d-1; moreover, we show that the j=2 and j=d-1 cases of the conjecture are valid in all dimensions. (iii) Given that |{psi}> allows the sending of K messages and has {radical}({lambda}{sub 0}) as its largest Schmidt coefficient, we show that the inequality {lambda}{sub 0}{<=}d/K, established by Wu et al. [Phys. Rev. A 73, 042311 (2006)], must actually take the form {lambda}{sub 0}<d/K if K=d+1, while our constructions of local unitaries show that equality can be realized if K=d+2 or K=2d-1.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗