Skip to content

THE INTERACTIVE TEXTBOOK

# References

Sources were checked against the research boundary of 5 September 2026. Publication status and access limitations remain attached to each entry.

[1] Thomas G. Wong (2022). Introduction to Classical and Quantum Computing. Rooted Grove; ISBN 979-8-9855931-0-5. Status: Curriculum reference; supplied PDF.

[2] Claude E. Shannon (1948). A Mathematical Theory of Communication. Bell System Technical Journal 27. Status: Foundational paper.

[3] Charles H. Bennett (1973). Logical Reversibility of Computation. IBM Journal of Research and Development 17. Status: Foundational paper.

[4] John Watrous (2018). The Theory of Quantum Information. Cambridge University Press. Status: Graduate reference; author-hosted materials.

[5] William K. Wootters and Wojciech H. Zurek (1982). A single quantum cannot be cloned. Nature 299. Status: Foundational paper.

[6] John F. Clauser, Michael A. Horne, Abner Shimony, and Richard A. Holt (1969). Proposed Experiment to Test Local Hidden-Variable Theories. Physical Review Letters 23. Status: Foundational paper.

[7] Bas Hensen et al. (2015). Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres. Nature 526. Status: Peer-reviewed experiment.

[8] Charles H. Bennett et al. (1993). Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters 70. Status: Foundational protocol.

[9] Charles H. Bennett and Stephen J. Wiesner (1992). Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physical Review Letters 69. Status: Foundational protocol.

[10] Zhenyu Cai et al. (2023). Quantum error mitigation. Reviews of Modern Physics 95, 045005. Status: Peer-reviewed review.

[11] David Deutsch (1985). Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society A 400. Status: Foundational algorithm.

[12] David Deutsch and Richard Jozsa (1992). Rapid solution of problems by quantum computation. Proceedings of the Royal Society A 439. Status: Foundational algorithm.

[13] Ethan Bernstein and Umesh Vazirani (1997). Quantum Complexity Theory. SIAM Journal on Computing 26. Status: Peer-reviewed theory.

[14] Daniel R. Simon (1997). On the Power of Quantum Computation. SIAM Journal on Computing 26. Status: Peer-reviewed theory.

[15] Lov K. Grover (1996). A fast quantum mechanical algorithm for database search. Proceedings of STOC 1996. Status: Foundational algorithm.

[16] Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp (2002). Quantum Amplitude Amplification and Estimation. Contemporary Mathematics 305. Status: Peer-reviewed theory.

[17] Christof Zalka (1999). Grover’s quantum searching algorithm is optimal. Physical Review A 60. Status: Query lower bound.

[18] Alexei Yu. Kitaev (1995). Quantum measurements and the Abelian Stabilizer Problem. arXiv:quant-ph/9511026. Status: Foundational preprint.

[19] Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca (1998). Quantum algorithms revisited. Proceedings of the Royal Society A 454. Status: Peer-reviewed theory.

[20] Peter W. Shor (1997). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing 26. Status: Peer-reviewed algorithm; preprint version linked.

[21] Seth Lloyd (1996). Universal Quantum Simulators. Science 273. Status: Foundational simulation algorithm.

[22] Andrew M. Childs, Yuan Su, Minh C. Tran, Nathan Wiebe, and Shuchen Zhu (2021). Theory of Trotter Error with Commutator Scaling. Physical Review X 11, 011020. Status: Peer-reviewed theory.

[23] Andras Gilyen, Yuan Su, Guang Hao Low, and Nathan Wiebe (2019). Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. Proceedings of STOC 2019. Status: Peer-reviewed theory; author preprint linked.

[24] Guang Hao Low and Isaac L. Chuang (2019). Hamiltonian Simulation by Qubitization. Quantum 3, 163. Status: Peer-reviewed theory.

[25] Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd (2009). Quantum Algorithm for Linear Systems of Equations. Physical Review Letters 103, 150502. Status: Peer-reviewed theory.

[26] Hsin-Yuan Huang et al. (2021). Power of data in quantum machine learning. Nature Communications 12, 2631. Status: Peer-reviewed theory and numerical study.

[27] Alberto Peruzzo et al. (2014). A variational eigenvalue solver on a photonic quantum processor. Nature Communications 5, 4213. Status: Foundational variational experiment.

[28] Edward Farhi, Jeffrey Goldstone, and Sam Gutmann (2014). A Quantum Approximate Optimization Algorithm. arXiv:1411.4028. Status: Foundational preprint.

[29] Jarrod R. McClean et al. (2018). Barren plateaus in quantum neural network training landscapes. Nature Communications 9, 4812. Status: Peer-reviewed theory.

[30] Scott Aaronson and Daniel Gottesman (2004). Improved simulation of stabilizer circuits. Physical Review A 70, 052328. Status: Peer-reviewed simulation method.

[31] Guifre Vidal (2003). Efficient Classical Simulation of Slightly Entangled Quantum Computations. Physical Review Letters 91, 147902. Status: Peer-reviewed simulation method.

[32] Craig Gidney (2021). Stim: a fast stabilizer circuit simulator. Quantum 5, 497. Status: Peer-reviewed software paper.

[33] Daniel Gottesman (1997). Stabilizer Codes and Quantum Error Correction. PhD thesis, California Institute of Technology. Status: Foundational thesis.

[34] Peter W. Shor (1995). Scheme for reducing decoherence in quantum computer memory. Physical Review A 52, R2493. Status: Foundational code.

[35] Andrew M. Steane (1996). Error Correcting Codes in Quantum Theory. Physical Review Letters 77, 793. Status: Foundational code.

[36] Emanuel Knill and Raymond Laflamme (1997). Theory of quantum error-correcting codes. Physical Review A 55, 900. Status: Recovery conditions.

[37] Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland (2012). Surface codes: Towards practical large-scale quantum computation. Physical Review A 86, 032324. Status: Peer-reviewed architectural review.

[38] Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill (2002). Topological quantum memory. Journal of Mathematical Physics 43, 4452. Status: Foundational theory.

[39] Oscar Higgott and Craig Gidney (2025). Sparse Blossom: correcting a million errors per core second with minimum-weight matching. Quantum 9, 1600. Status: Decoder method; primary author manuscript.

[40] Dorit Aharonov and Michael Ben-Or (2008). Fault-Tolerant Quantum Computation with Constant Error Rate. SIAM Journal on Computing 38. Status: Threshold theory; author manuscript.

[41] Bryan Eastin and Emanuel Knill (2009). Restrictions on Transversal Encoded Quantum Gate Sets. Physical Review Letters 102, 110502. Status: Peer-reviewed no-go theorem.

[42] Sergey Bravyi and Alexei Kitaev (2005). Universal quantum computation with ideal Clifford gates and noisy ancillas. Physical Review A 71, 022316. Status: Magic-state theory.

[43] Pavel Panteleev and Gleb Kalachev (2022). Asymptotically Good Quantum and Locally Testable Classical LDPC Codes. Proceedings of STOC 2022. Status: Peer-reviewed coding theory.

[44] Sergey Bravyi et al. (2024). High-threshold and low-overhead fault-tolerant quantum memory. Nature 627, 778–782. Status: Theory and circuit-noise simulation.

[45] Daniel Gottesman, Alexei Kitaev, and John Preskill (2001). Encoding a qubit in an oscillator. Physical Review A 64, 012310. Status: Bosonic code theory.

[46] Volodymyr V. Sivak et al. (2023). Real-time quantum error correction beyond break-even. Nature 616, 50–55. Status: Peer-reviewed bosonic experiment.

[47] Google Quantum AI and Collaborators (2025). Quantum error correction below the surface code threshold. Nature 638, 920–926; online 9 December 2024. Status: Peer-reviewed memory experiment; updated publisher page consulted.

[48] Google Quantum AI and Collaborators (2026). Author Correction: Quantum error correction below the surface code threshold. Nature 653, E5; published 28 April 2026. Status: Publisher correction record.

[49] Dolev Bluvstein et al. (2026). A fault-tolerant neutral-atom architecture for universal quantum computation. Nature 649, 39–46; online 10 November 2025. Status: Peer-reviewed experiment; primary institutional record and abstract.

[50] A. Paetznick et al. (2026). Improved quantum processor logical error rates via correction and detection. Nature 654, 349–355; published 10 June 2026. Status: Peer-reviewed experiment; accessible abstract, correction and postselection.

[51] Craig Gidney and Martin Ekera (2021). How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, 433. Status: Peer-reviewed resource estimate.

[52] Craig Gidney (2025). How to factor 2048 bit RSA integers with less than a million noisy qubits. arXiv:2505.15917v1; submitted 21 May 2025. Status: Preprint resource estimate; not a hardware factorization.

[53] Madelyn Cain et al. (2026). Shor’s algorithm is possible with as few as 10,000 reconfigurable atomic qubits. arXiv:2603.28627v1; submitted 30 March 2026. Status: Preprint architecture and resource estimate.

[54] Jens Koch et al. (2007). Charge-insensitive qubit design derived from the Cooper pair box. Physical Review A 76, 042319. Status: Foundational device theory.

[55] Morten Kjaergaard et al. (2020). Superconducting Qubits: Current State of Play. Annual Review of Condensed Matter Physics 11, 369–395. Status: Platform principles review; not a 2026 performance snapshot.

[56] Colin D. Bruzewicz, John Chiaverini, Robert McConnell, and Jeremy M. Sage (2019). Trapped-ion quantum computing: Progress and challenges. Applied Physics Reviews 6, 021314. Status: Platform principles review; author manuscript.

[57] Mark Saffman (2016). Quantum computing with atomic qubits and Rydberg interactions: progress and challenges. Journal of Physics B 49, 202001. Status: Platform principles review.

[58] Guido Burkard, Thaddeus D. Ladd, Andrew Pan, John M. Nichol, and Jason R. Petta (2023). Semiconductor spin qubits. Reviews of Modern Physics 95, 025003. Status: Peer-reviewed platform review.

[59] Anthony Ransford et al. (2026). A 98-qubit trapped-ion quantum computer with all-to-all connectivity. Nature; published online 17 June 2026. Status: Peer-reviewed experiment; primary record and arXiv:2511.05465.

[60] H. Aghaee Rad et al. (2025). Scaling and networking a modular photonic quantum computer. Nature 638, 912–919. Status: Peer-reviewed architecture experiment; accessible primary record.

[61] Microsoft Azure Quantum (2025). Interferometric single-shot parity measurement in InAs–Al hybrid devices. Nature 638, 651–655. Status: Peer-reviewed measurement study; interpretation distinguished from a topological-computer claim.

[62] Henry F. Legg (2025). Comment on Interferometric single-shot parity measurement in InAs–Al hybrid devices. arXiv:2503.08944. Status: Technical challenge in a preprint; not treated as final adjudication.

[63] Google Quantum AI and Collaborators (2025). Observation of constructive interference at the edge of quantum ergodicity. Nature 646, 825–830; published 22 October 2025. Status: Peer-reviewed experiment and classical-simulation comparison.

[64] Hans-Jurgen Briegel, Wolfgang Dur, J. Ignacio Cirac, and Peter Zoller (1998). Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication. Physical Review Letters 81, 5932. Status: Foundational network theory.

[65] Stephanie Wehner, David Elkouss, and Ronald Hanson (2018). Quantum internet: A vision for the road ahead. Science 362, eaam9288. Status: Peer-reviewed network perspective.

[66] D. Main et al. (2025). Distributed quantum computing across an optical network link. Nature 638, 383–388; published 5 February 2025. Status: Peer-reviewed experiment; primary author manuscript.

[67] Charles H. Bennett and Gilles Brassard (1984 / 2014). Quantum cryptography: Public key distribution and coin tossing. 1984 conference paper; reprinted in Theoretical Computer Science 560. Status: Foundational protocol.

[68] Valerio Scarani et al. (2009). The security of practical quantum key distribution. Reviews of Modern Physics 81, 1301. Status: Peer-reviewed security review.

[69] Peter W. Shor and John Preskill (2000). Simple Proof of Security of the BB84 Quantum Key Distribution Protocol. Physical Review Letters 85, 441. Status: Security proof under explicit idealized assumptions.

[70] National Institute of Standards and Technology (2024). Announcing Approval of Three Federal Information Processing Standards for Post-Quantum Cryptography. FIPS 203, 204, 205; announcement 13 August 2024. Status: Official standards announcement; checked 5 September 2026.

[71] IBM Quantum (2026 access). Quickstart. Official documentation; examples specify qiskit~=2.5.2. Status: Official technical documentation; checked 5 September 2026.

[72] IBM Quantum (2026 access). StatevectorSampler. Qiskit API documentation, V2 local sampler. Status: Official API; no mid-circuit measurement support.

[73] IBM Quantum (2026 access). Primitives. Qiskit API documentation. Status: Official V2 interface documentation.

[74] Google Quantum AI (2026 access). Cirq. Official framework and simulator documentation. Status: Official technical documentation.

[75] PennyLane developers (2026 access). Quantum circuits. PennyLane stable documentation. Status: Official technical documentation.

[76] OpenQASM contributors (2026 access). OpenQASM 3 language specification. Live specification and version 3.0 documentation. Status: Official language specification.