|
| related topics |
| {alice, bob, state} |
| {information, entropy, channel} |
| {state, states, entangled} |
| {state, phys, rev} |
| {equation, function, exp} |
| {let, theorem, proof} |
| {state, algorithm, problem} |
| {entanglement, phys, rev} |
| {states, state, optimal} |
|
A sufficient and necessary condition for superdense coding of quantum
states
Daowen Qiu
abstract: Recently, Harrow et al. [Phys. Rev. Lett. 92, 187901 (2004)] gave a method
for preparing an arbitrary quantum state with high success probability by
physically transmitting some qubits, and by consuming a maximally entangled
state, together with exhausting some shared random bits. In this paper, we
discover that some states are impossible to be perfectly prepared by Alice and
Bob initially sharing those entangled states that are superposed by the ground
states, as the states to be prepared. In particular, we present a sufficient
and necessary condition for the states being enabled to be exactly prepared
with probability one, in terms of the initial entangled states (maybe
nonmaximally) superposed by the ground states. In contrast, if the initially
shared entanglement is maximal, then the probabilities for preparing these
quantum states are smaller than one. Furthermore, the lower bound on the
probability for preparing some states are derived.
- oai_identifier:
- oai:arXiv.org:quant-ph/0612149
- categories:
- quant-ph
- comments:
- 14 pages
- arxiv_id:
- quant-ph/0612149
- journal_ref:
- International Journal of Quantum Information, 2008, 6: 1115-1125.
- created:
- 2006-12-18
Full article ▸
|
|
| related documents |
| 0212164v1 |
| 0010103v5 |
| 0601126v1 |
| 0008078v1 |
| 0301048v1 |
| 0002021v2 |
| 0012139v2 |
| 0511050v3 |
| 0510029v1 |
| 0502131v2 |
| 0508002v2 |
| 0304141v3 |
| 0303112v1 |
| 0312223v1 |
| 0504213v1 |
| 9912039v1 |
| 0501075v1 |
| 0201073v1 |
| 0305168v3 |
| 0511130v1 |
| 0304035v1 |
| 0702155v3 |
| 9605025v1 |
| 0610125v1 |
| 0703099v5 |
|