Reference ~5 min read

Appendix D — References & Bibliography

Lessons cite sources by the bracketed keys below (e.g. [NC, §4.2], [Shor94]). This page is the authoritative list. Textbooks first, then foundational papers grouped by topic, then applied Braket/tooling docs.

1. Primary Textbooks (the spine)

Key Reference
[NC] M. A. Nielsen & I. L. Chuang, Quantum Computation and Quantum Information, 10th Anniversary ed., Cambridge University Press, 2010. The primary spine of this program.
[Pre] J. Preskill, Quantum Computation lecture notes (Caltech Ph219/CS219). Freely available: http://theory.caltech.edu/~preskill/ph229/
[KLM] P. Kaye, R. Laflamme & M. Mosca, An Introduction to Quantum Computing, Oxford University Press, 2007.
[Mer] N. D. Mermin, Quantum Computer Science: An Introduction, Cambridge University Press, 2007.
[Wat] J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018. Free draft: https://cs.uwaterloo.ca/~watrous/TQI/
[Aar] S. Aaronson, Quantum Computing Since Democritus, Cambridge University Press, 2013.
[Wil] M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press, 2017. arXiv:1106.1445

2. Quantum Mechanics & Linear Algebra

Key Reference
[Sak] J. J. Sakurai & J. Napolitano, Modern Quantum Mechanics, 3rd ed., Cambridge University Press, 2020.
[Gri] D. J. Griffiths & D. F. Schroeter, Introduction to Quantum Mechanics, 3rd ed., Cambridge University Press, 2018. Primary text of the Pre-Term.
[ER] R. Eisberg & R. Resnick, Quantum Physics of Atoms, Molecules, Solids, Nuclei, and Particles, 2nd ed., Wiley, 1985 — the historical/experimental route (Pre-Term Courses P.2–P.3).
[Fre] J. K. Freericks, Quantum Mechanics Done Right, Springer, 2026 — the experiment-first route through spin and measurement (Resources Courses R.1–R.2). Open access under CC BY-NC-ND.
[Gold] H. Goldstein, C. Poole & J. Safko, Classical Mechanics, 3rd ed., Addison-Wesley, 2002 — Lagrangian/Hamiltonian mechanics (Pre-Term Course P.1).
[Hec] E. Hecht, Optics, 5th ed., Pearson, 2017 — interference, Huygens–Fresnel, diffraction and gratings (Pre-Term P.1.2).
[Sha] R. Shankar, Principles of Quantum Mechanics, 2nd ed., Springer, 1994.
[Axl] S. Axler, Linear Algebra Done Right, 4th ed., Springer, 2024.
[HJ] R. A. Horn & C. R. Johnson, Matrix Analysis, 2nd ed., Cambridge University Press, 2013.

3. Information & Complexity Theory

Key Reference
[CT] T. M. Cover & J. A. Thomas, Elements of Information Theory, 2nd ed., Wiley, 2006.
[Sha48] C. E. Shannon, "A Mathematical Theory of Communication", Bell System Technical Journal 27, 379–423 & 623–656 (1948) — the founding paper of information theory.
[Bil] P. Billingsley, Probability and Measure, Anniversary ed., Wiley, 2012 — measure-theoretic probability.
[AB] S. Arora & B. Barak, Computational Complexity: A Modern Approach, Cambridge University Press, 2009.
[Sip] M. Sipser, Introduction to the Theory of Computation, 3rd ed., Cengage, 2012.

4. Foundational Papers by Topic

Foundations & no-go theorems

  • [EPR35] A. Einstein, B. Podolsky & N. Rosen, "Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?", Phys. Rev. 47, 777 (1935).
  • [Bell64] J. S. Bell, "On the Einstein Podolsky Rosen Paradox", Physics 1, 195 (1964).
  • [CHSH69] Clauser, Horne, Shimony & Holt, "Proposed Experiment to Test Local Hidden-Variable Theories", Phys. Rev. Lett. 23, 880 (1969).
  • [WZ82] W. K. Wootters & W. H. Zurek, "A single quantum cannot be cloned", Nature 299, 802 (1982) — the no-cloning theorem.

Protocols

  • [BW92] C. H. Bennett & S. J. Wiesner, "Communication via one- and two-particle operators on EPR states", Phys. Rev. Lett. 69, 2881 (1992) — superdense coding.
  • [BBCJPW93] Bennett, Brassard, Crépeau, Jozsa, Peres & Wootters, "Teleporting an unknown quantum state…", Phys. Rev. Lett. 70, 1895 (1993) — quantum teleportation.

Algorithms

  • [Deu85] D. Deutsch, "Quantum theory, the Church–Turing principle and the universal quantum computer", Proc. R. Soc. Lond. A 400, 97 (1985).
  • [DJ92] D. Deutsch & R. Jozsa, "Rapid solution of problems by quantum computation", Proc. R. Soc. Lond. A 439, 553 (1992).
  • [BV93] E. Bernstein & U. Vazirani, "Quantum complexity theory", STOC 1993 (SIAM J. Comput.
    1. — defines BQP, Bernstein–Vazirani.
  • [Sim94] D. Simon, "On the power of quantum computation", FOCS 1994 — Simon's problem.
  • [Shor94] P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring", FOCS 1994 (SIAM J. Comput. 1997) — Shor's algorithm.
  • [Gro96] L. K. Grover, "A fast quantum mechanical algorithm for database search", STOC 1996 — Grover's algorithm.
  • [Kit95] A. Y. Kitaev, "Quantum measurements and the Abelian Stabilizer Problem", arXiv:quant-ph/9511026 — phase estimation.
  • [BHMT02] Brassard, Høyer, Mosca & Tapp, "Quantum Amplitude Amplification and Estimation", Contemp. Math. 305 (2002).
  • [HHL09] A. Harrow, A. Hassidim & S. Lloyd, "Quantum Algorithm for Linear Systems of Equations", Phys. Rev. Lett. 103, 150502 (2009) — HHL.
  • [Per14] A. Peruzzo et al., "A variational eigenvalue solver on a photonic quantum processor", Nat. Commun. 5, 4213 (2014) — VQE.
  • [FGG14] E. Farhi, J. Goldstone & S. Gutmann, "A Quantum Approximate Optimization Algorithm", arXiv:1411.4028 — QAOA.
  • [Llo96] S. Lloyd, "Universal Quantum Simulators", Science 273, 1073 (1996) — Hamiltonian simulation / Trotterization.

Universality

  • [Bar95] A. Barenco et al., "Elementary gates for quantum computation", Phys. Rev. A 52, 3457 (1995).
  • [SK] A. Kitaev, "Quantum computations: algorithms and error correction", Russian Math. Surveys 52 (1997) — Solovay–Kitaev theorem context; see also Dawson & Nielsen, quant-ph/0505030.

Noise & error correction

  • [Sho95] P. W. Shor, "Scheme for reducing decoherence in quantum computer memory", Phys. Rev. A 52, R2493 (1995) — 9-qubit code.
  • [Ste96] A. Steane, "Error Correcting Codes in Quantum Theory", Phys. Rev. Lett. 77, 793 (1996) — Steane code.
  • [Got97] D. Gottesman, "Stabilizer Codes and Quantum Error Correction", PhD thesis, arXiv:quant-ph/9705052 — stabilizer formalism.
  • [Kit03] A. Kitaev, "Fault-tolerant quantum computation by anyons", Ann. Phys. 303, 2 (2003) — toric/surface code.
  • [FMMC12] Fowler, Mariantoni, Martinis & Cleland, "Surface codes: Towards practical large-scale quantum computation", Phys. Rev. A 86, 032324 (2012).
  • [Tem17] K. Temme, S. Bravyi & J. M. Gambetta, "Error Mitigation for Short-Depth Quantum Circuits", Phys. Rev. Lett. 119, 180509 (2017) — ZNE / PEC.

Hardware & landscape

  • [Pre18] J. Preskill, "Quantum Computing in the NISQ era and beyond", Quantum 2, 79 (2018).
  • [DiV00] D. P. DiVincenzo, "The Physical Implementation of Quantum Computation", Fortschr. Phys. 48, 771 (2000) — the DiVincenzo criteria.
  • [Aru19] F. Arute et al. (Google), "Quantum supremacy using a programmable superconducting processor", Nature 574, 505 (2019).

5. Applied: AWS Braket & Tooling

Key Reference
[AWS] Amazon Braket Developer Guide: https://docs.aws.amazon.com/braket/
[SDK] amazon-braket-sdk-python: https://github.com/amazon-braket/amazon-braket-sdk-python
[BraketEx] Amazon Braket examples repo: https://github.com/amazon-braket/amazon-braket-examples
[BraketPrice] Amazon Braket pricing: https://aws.amazon.com/braket/pricing/
[PL] PennyLane documentation: https://docs.pennylane.ai/
[PLBraket] PennyLane–Braket plugin: https://amazon-braket-pennylane-plugin-python.readthedocs.io/
[QASM3] OpenQASM 3.0 specification: https://openqasm.com/
[QuTiP] QuTiP documentation: https://qutip.org/

6. Free Online Courses & Notes (supplementary)

How to Cite in Lessons

Use the key plus a locator: [NC, §2.2], [Pre, Ch. 7], [Shor94], [AWS: Hybrid Jobs]. For arXiv-only papers, the key resolves here to the arXiv ID. Keep external URLs in this file (not inline in lessons) so links are maintained in one place.

← Prev: Appendix C — Notation & Glossary · Next: Appendix E — Math Identities →