Top 100 Quantum Theorems
M. David, J. Palsberg
This list collects 100 important theorems in quantum physics, quantum information and quantum computing. Inspired by the list of the top 100 mathematical theorems of which Freek Wiedijk tracks the formalization progress, this is a similarly arbitrary and necessarily incomplete list with no particular order.
We welcome submissions from your interactive theorem proving community, and will link formal statements and proofs below.
Acknowledgements. Thank you to Rodolfo R. Soldati, Alex Meiburg, Serge Massar, Tein van der Lugt for their contributions. We are grateful for support by the NSF Challenge Institute for Quantum Computation.
The List (early draft of the first half)
- The Spectral Theorem
- Heisenberg Uncertainty Relation
- Baker–Campbell–Hausdorff Formula
- Superdense Coding
- Quantum Teleportation with Shared Entanglement
- No-Cloning Theorem / No-Broadcast Theorem / No-Teleportation Theorem
- No-Communication Theorem
- No-Deleting Theorem
- Purification Theorem for Mixed States
- Schmidt Decomposition for Hilbert Spaces
- Bell’s Theorem (QM violates CHSH Inequality)
- Monogamy of Entanglement
- Tsirelson Bound
- Correctness of the Deutsch–Jozsa Algorithm
- Correctness of Shor’s Algorithm
- Correctness of Grover’s Algorithm
- Quantum Key Distribution by BB84
- Solovay–Kitaev Theorem
- Universality of Sets of Two-Qubit Quantum Gates
- Universality of the Toffoli and the Hadamard
- Petz Recovery Map
- Choi’s Theorem on Completely Positive Maps
- Choi–Jamiołkowski Isomorphism (channel-state Duality)
- Gelfand–Naimark Theorem
- Stinespring’s Factorization Theorem / Naimark’s Dilation Theorem
- Continuous Functional Calculus
- Gleason’s Theorem
- Holevo’s Theorem
- Pusey–Barrett–Rudolph Theorem
- Kochen–Specker Theorem
- The Spectral Theorem for PVMs
- Strong Subadditivity of Quantum Entropy
- Entanglement-assisted Classical Capacity of Quantum Channels
- Quantum State Discrimination for Two States (Ivanović–Dieks–Peres Limit)
- The Lloyd–Shor–Devetak Theorem for Quantum Channel Capacity
- Eastin–Knill Theorem
- Gottesman–Knill Theorem
- Magic State Distillation
- Spin-statistics Theorem
- Reeh–Schlieder Theorem
- MIP* = RE
- BQP \(\subseteq\) PP
- QIP = PSPACE
- Quantum Stein Lemma
- Quantum 3-SAT is QMA1-complete
- Computing the Jones Polynomial at Roots of Unity is BQP-hard
- Onsager’s solution to the 2D Ising Model
- Wick’s Theorem
- Osterwalder–Schrader Reconstruction Theorem
- Wood–Spekkens–Bell Theorem
