Quantum Coding Theorem for Mixed States

Abstract

We prove a theorem for coding mixed-state quantum signals. For a class of coding schemes, the von Neumann entropy $S$ of the density operator describing an ensemble of mixed quantum signal states is shown to be equal to the number of spin-$1/2$ systems necessary to represent the signal faithfully. This generalizes previous works on coding pure quantum signal states and is analogous to the Shannon's noiseless coding theorem of classical information theory. We also discuss an example of a more general class of coding schemes which {\em beat} the limit set by our theorem.

Overlap with some unpublished work noted. Limitation clarified. 11 pages, REVTEX, amsfonts

Cited by in corpus (13)

• A Survey on Quantum Channel Capacities
• Optimal Remote State Preparation
• Limits for compression of quantum information carried by ensembles of mixed states
• On quantum coding for ensembles of mixed states
• Compressibility of Mixed-State Signals
• Measuring Quantum Entropy
• Efficient Quantum Compression for Ensembles of Identically Prepared Mixed States
• Optimal compression for mixed signal states
• Asymptotic Redundancies for Universal Quantum Coding
• Compression for quantum population coding
• Quantum Compression of Tensor Network States
• Rate Reduction of Blind Quantum Data Compression with Local Approximations Based on Unstable Structure of Quantum States
• Time-Efficient Quantum Entropy Estimator via Samplizer