|
related topics |
{information, entropy, channel} |
{key, protocol, security} |
{let, theorem, proof} |
{state, phys, rev} |
{group, space, representation} |
{qubit, qubits, gate} |
{cos, sin, state} |
{error, code, errors} |
|
On the reversible extraction of classical information from a quantum
source
Howard Barnum, Patrick Hayden, Richard Jozsa, Andreas Winter
abstract: Consider a source E of pure quantum states with von Neumann entropy S. By the
quantum source coding theorem, arbitrarily long strings of signals may be
encoded asymptotically into S qubits/signal (the Schumacher limit) in such a
way that entire strings may be recovered with arbitrarily high fidelity.
Suppose that classical storage is free while quantum storage is expensive and
suppose that the states of E do not fall into two or more orthogonal subspaces.
We show that if E can be compressed with arbitrarily high fidelity into A
qubits/signal plus any amount of auxiliary classical storage then A must still
be at least as large as the Schumacher limit S of E. Thus no part of the
quantum information content of E can be faithfully replaced by classical
information. If the states do fall into orthogonal subspaces then A may be less
than S, but only by an amount not exceeding the amount of classical information
specifying the subspace for a signal from the source.
- oai_identifier:
- oai:arXiv.org:quant-ph/0011072
- categories:
- quant-ph
- comments:
- 22 pages, Latex2e, journal version
- doi:
- 10.1098/rspa.2001.0816
- arxiv_id:
- quant-ph/0011072
- journal_ref:
- Proc. Roy. Soc. (Lond.) A (2001), vol 457, p2019-2039
- created:
- 2000-11-16
- updated:
- 2003-07-29
Full article ▸
|
|
related documents |
9911009v1 |
0410091v2 |
0402178v3 |
0505151v1 |
0511219v3 |
0608074v3 |
0306196v2 |
0401187v3 |
0012128v1 |
0509016v2 |
0412006v2 |
0405149v1 |
0203093v3 |
0409207v3 |
0307104v3 |
0306083v1 |
0409106v3 |
0202119v2 |
0210190v1 |
0105017v2 |
0205064v2 |
9809010v1 |
0412157v1 |
0207010v1 |
0403092v1 |
|