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.
|Translated title of the contribution||On quantum coding for ensembles of mixed states|
|Publisher||Department of Computer Science, University of Bristol|
|Publication status||Published - 2000|
Bibliographical noteOther page information: -23
Other identifier: 1000500