The Quantum Source Coding Theorem and Compression
Schumacher’s quantum source coding theorem shows quantum data can be compressed down to its von Neumann entropy. History, concepts and uses.
Entropy, channel capacity, teleportation, complexity classes and the theorems that define what quantum information can and cannot do.
155 articlesSchumacher’s quantum source coding theorem shows quantum data can be compressed down to its von Neumann entropy. History, concepts and uses.
The quantum channel coding theorem sets how much information noisy quantum channels can carry reliably. Foundations, codes and implications.
The quantum Chernoff bound gives the best error exponent for telling two quantum states apart with many copies. Definition and applications.
Quantum Fisher information sets the best possible precision for estimating a parameter. Its definition, the Cramér-Rao bound and metrology uses.
The quantum Hamming bound limits the parameters of non-degenerate quantum codes. Its derivation, examples and implications for code design.
Superdense coding, proposed by Bennett and Wiesner in 1992, sends two classical bits with one qubit using a shared entangled pair. How it works.
The entanglement of formation is the minimum entanglement needed to create a given state. Its definition, formulas for two qubits and uses.
Entanglement entropy measures how entangled one part of a system is with the rest. Definition, calculation and meaning in physics.
Quantum discord captures non-classical correlations that can exist even without entanglement. Its definition, measurement and possible uses.
Quantum coherence is the ability of a state to show interference. Where it comes from, how it is lost and why computing and sensing depend on it.
Fidelity measures how close two quantum states are. How it is computed and why it is used to judge gates, error correction and protocols.
Measures of distance between quantum states and channels, such as trace distance, fidelity and diamond norm, and where each is used.