On quantum coding for ensembles of mixed states
classification
🪐 quant-ph
keywords
mixedstatescompressionensemblesoptimalproblemquantumalthough
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.