On quantum coding for ensembles of mixed states

From MaRDI portal



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 page was built for publication: On quantum coding for ensembles of mixed states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766191)