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.
Recommendations
Cited in
(9)- Enhancing qubit information with quantum thermal noise
- Stationary quantum source coding
- Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources
- Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation
- Asymptotic redundancies for universal quantum coding
- Compressing quantum mixed-state sources by sending classical information
- Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on maximum overlap using directional iterates
- Quantum binary channels with mixed states
- Channel simulation: theory and applications to lossy compression and differential privacy
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)