|
| related topics |
| {information, entropy, channel} |
| {alice, bob, state} |
| {entanglement, phys, rev} |
| {states, state, optimal} |
| {let, theorem, proof} |
| {group, space, representation} |
|
Optimal dense coding with mixed state entanglement
Tohya Hiroshima
abstract: 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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0009048
- categories:
- quant-ph
- comments:
- Revised. To appear in J. Phys. A: Math. Gen. (Special Issue: Quantum
Information and Computation). LaTeX2e (iopart.cls), 8 pages, no figures
- doi:
- 10.1088/0305-4470/34/35/316
- arxiv_id:
- quant-ph/0009048
- journal_ref:
- J. Phys. A: Math. Gen. 34 (2001) 6907-6912
- created:
- 2000-09-11
- updated:
- 2001-05-08
Full article ▸
|
|
| related documents |
| 0511171v1 |
| 9808063v2 |
| 0303117v1 |
| 0409026v1 |
| 0101117v1 |
| 9804036v1 |
| 0409187v1 |
| 0201061v1 |
| 0506197v3 |
| 0209159v1 |
| 9806065v1 |
| 0209030v1 |
| 0104057v1 |
| 0408004v2 |
| 0212025v1 |
| 0308044v2 |
| 0009075v1 |
| 0112034v1 |
| 0111115v1 |
| 0502093v1 |
| 0412083v1 |
| 0001023v6 |
| 0403188v1 |
| 0611070v1 |
| 0507049v2 |
|