Deterministic dense coding and entanglement entropy

摘要: We present an analytical study of the standard two-party deterministic dense-coding protocol, under which communication perfectly distinguishable messages takes place via a qudit from pair nonmaximally entangled qudits in pure state |{psi}>. Our results include following: (i) prove that it is possible for |{psi}> with lower entanglement entropy to support sending greater number than one higher entropy, confirming result suggested numerical analysis Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. (ii) By explicit construction families local unitary operators, we verify, dimensions d=3 and d=4, conjecture about minimum supports d+j messages, 2{ allows K has {radical}({lambda}{sub 0}) as its largest Schmidt coefficient, show inequality {lambda}{sub 0}{<=}d/K, established by Wu 73, 042311 (2006)], must actually take form 0}