On quantum coding for ensembles of mixed states

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.

23 pages, LaTeX

References in corpus (1)

• Distinguishability of States and von Neumann Entropy

Cited by in corpus (19)

• A Survey on Quantum Channel Capacities
• Coordination Capacity
• Remote preparation of quantum states
• Generalized remote state preparation: Trading cbits, qubits and ebits in quantum communication
• Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
• Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on the maximum overlap problem using directional iterates
• General Mixed State Quantum Data Compression with and without Entanglement Assistance
• Stationary quantum source coding
• On the reversible extraction of classical information from a quantum source
• Entangling quantum measurement and its properties
• Quantum Compression of Tensor Network States
• Shannon theory beyond quantum: information content of a source
• Physical implementation of entangling quantum measurements
• Rate Reduction of Blind Quantum Data Compression with Local Approximations Based on Unstable Structure of Quantum States
• Second order asymptotics of visible mixed quantum source coding via universal codes
• Two-Server Oblivious Transfer for Quantum Messages
• Generalized quantum measurements. Part I: Information properties of soft quantum measurements
• Exact and local compression of quantum bipartite states
• On the Entanglement Cost of One-Shot Compression