On quantum coding for ensembles of mixed states
- 24 August 2001
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 34 (35) , 6767-6785
- https://doi.org/10.1088/0305-4470/34/35/304
Abstract
We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- The “transition probability” in the state space of a ∗-algebraPublished by Elsevier ,2002
- On quantum fidelities and channel capacitiesIEEE Transactions on Information Theory, 2000
- Information transmission through a noisy quantum channelPhysical Review A, 1998
- Limits for compression of quantum information carried by ensembles of mixed statesPhysical Review A, 1998
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- General fidelity limit for quantum channelsPhysical Review A, 1996
- Noncommuting Mixed States Cannot Be BroadcastPhysical Review Letters, 1996
- Quantum codingPhysical Review A, 1995
- A New Proof of the Quantum Noiseless Coding TheoremJournal of Modern Optics, 1994
- Quantum cryptography using any two nonorthogonal statesPhysical Review Letters, 1992