Optimal dense coding with mixed state entanglement

Details Optimal dense coding with mixed state entanglement Optimal dense coding with mixed state entanglement

2000-09-12

arxiv.org/abs/quant-ph/0009048v2

J. Phys. A: Math. Gen. 34 (2001) 6907-6912

Physics

Quantum Physics

Revised. To appear in J. Phys. A: Math. Gen. (Special Issue: Quantum Information and Computation). LaTeX2e (iopart.cls), 8 pag

Scientific paper

10.1088/0305-4470/34/35/316

I investigate dense coding with a general mixed state on the Hilbert space $C^{d}\otimes C^{d}$ shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by mutually orthogonal unitary transformations with equal {\it a priori} probabilities, the capacity of dense coding is maximized. It is also proved that the optimal capacity of dense coding $\chi ^{*}$ satisfies $E_{R}(\rho)\leq \chi ^{*}\leq E_{R}(\rho )+\log_{2}d$, where $E_{R}(\rho)$ is the relative entropy of entanglement of the shared entangled state.

Affiliated with

Also associated with

No associations

Rating

Optimal dense coding with mixed state entanglement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal dense coding with mixed state entanglement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal dense coding with mixed state entanglement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549631