|
related topics |
{information, entropy, channel} |
{key, protocol, security} |
{let, theorem, proof} |
{qubit, qubits, gate} |
{alice, bob, state} |
|
Universal Quantum Information Compression
Richard Jozsa, Michal Horodecki, Pawel Horodecki, Ryszard Horodecki
abstract: Suppose that a quantum source is known to have von Neumann entropy less than
or equal to S but is otherwise completely unspecified. We describe a method of
universal quantum data compression which will faithfully compress the quantum
information of any such source to S qubits per signal (in the limit of large
block lengths).
- oai_identifier:
- oai:arXiv.org:quant-ph/9805017
- categories:
- quant-ph
- comments:
- RevTex 4 pages
- doi:
- 10.1103/PhysRevLett.81.1714
- arxiv_id:
- quant-ph/9805017
- journal_ref:
- Phys.Rev.Lett. 81 (1998) 1714-1717
- created:
- 1998-05-07
Full article ▸
|
|
related documents |
9611032v1 |
9806027v2 |
0203045v1 |
0403092v1 |
0702059v3 |
9512022v3 |
0412157v1 |
0207010v1 |
0209030v1 |
0202119v2 |
0112034v1 |
0511217v1 |
9806065v1 |
0408004v2 |
0506197v3 |
0308044v2 |
9808063v2 |
0209159v1 |
0009048v2 |
0511171v1 |
0303117v1 |
0009075v1 |
0210091v1 |
0104057v1 |
9912122v1 |
|