On quantum coding for ensembles of mixed states
Howard Barnum, Carlton M. Caves, Christopher A. Fuchs, Richard Jozsa, Benjamin W. Schumacher
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.
Create a lesson
Related papers
Approximate Synthetic Spectra of Quantum Systems Associated with Compact Lie Groups
Junyang Liu, Hang Wang, Houjin Wang et al.
An example of universal braiding in Links--Gould topological quantum computation
Matthew Harper, Ben-Michael Kohli
Reasoning about Shared-Qubit Concurrency in Quantum Computing
Mingsheng Ying
Information-Geometric Representation of Upper Bounds on Fluctuation Growth in Open Quantum Systems
Newshaw Bahreyni, Paul M. Alsing
Initialization-controlled fault sensitivity and force-balance plateaus in noisy variational quantum optimization
Longhui Shen, Fangzhou Jin, Bin Guo
Quantum identity authentication protocol via perturbed probability amplitudes
Xiangqun Fu, Zheng Han, Hongwei Li et al.