Quantum Capacity Theorems and Their Proofs
The main quantum capacity theorems and how they are proved: coding theorems, entanglement-assisted capacity, additivity and superadditivity.
Every explainer on QuantumExplainer.com, newest first. Use the pillars above to jump straight to a topic.
739 articlesThe main quantum capacity theorems and how they are proved: coding theorems, entanglement-assisted capacity, additivity and superadditivity.
Schumacher’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 bit error rate measures errors in the sifted key of a QKD system. How it is calculated, what causes it and why it signals eavesdropping.
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.
Quantum error correction from an information theory perspective: codes, detection and correction, limits and the road to fault tolerance.
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.