On quantum coding for ensembles of mixed states
Preprint
- 4 August 2000
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 0 references indexed in Scilit: