arXiv Analytics

Sign in

arXiv:quant-ph/0008024AbstractReferencesReviewsResources

On quantum coding for ensembles of mixed states

Howard Barnum, Carlton M. Caves, Christopher A. Fuchs, Richard Jozsa, Benjamin W. Schumacher

Published 2000-08-04Version 1

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.

Related articles: Most relevant | Search more
arXiv:2405.11861 [quant-ph] (Published 2024-05-20)
Separability and lower bounds of quantum entanglement based on realignment
arXiv:2405.08324 [quant-ph] (Published 2024-05-14)
Sufficient conditions, lower bounds and trade-off relations for quantumness in Kirkwood-Dirac quasiprobability
arXiv:2312.17620 [quant-ph] (Published 2023-12-29)
Lower Bounds of Entanglement Quantifiers Based On Entanglement Witnesses