Further Reading: The Quantum Programming Landscape

Sources are tagged Tier 1 (works we are confident exist and recommend without reservation) and Tier 2 (real and worth seeking, but confirm the current version, edition, or URL yourself — documentation and web resources drift fast in this field).

This chapter was a survey, so most of what follows is orientation material. Do not try to read it all. Pick the one or two entries that match what you want next.

The foundational papers

• Richard Feynman, "Simulating Physics with Computers" (1982), International Journal of Theoretical Physics 21. The origin document. Feynman's argument is not that quantum computers would be fast — it is that simulating quantum systems on classical computers is fundamentally hard, and that the natural fix is to compute with a quantum system. Short, readable without physics training, and it frames the strongest near-term application (Chapter 36) forty years early. Tier 1.
• John Preskill, "Quantum Computing in the NISQ Era and Beyond" (2018), Quantum 2, 79. The paper that named the current era and, more usefully, set the terms for honest discussion of what near-term devices can do. Read it for the framing in §1.5; it is the intellectual ancestor of every 🔬 Honest Assessment callout in this book. Tier 1.
• W. K. Wootters and W. H. Zurek, "A Single Quantum Cannot Be Cloned" (1982), Nature 299. The no-cloning theorem, in under a page. Worth reading precisely because it is so short — the result that blocks checkpointing and majority-vote error correction, and enables quantum key distribution, follows from linearity alone. Tier 1.

The standard reference

• Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press). "Mike and Ike," the field's standard graduate text. It is a theory book and it is excellent; this book is its complement, not its competitor. Chapters 1 and 2 are the best available treatment of the conceptual foundations sketched in §1.4. Tier 1.

Framework documentation (the primary sources)

Each framework's own documentation is the authority, and each is genuinely good. Bookmark all five now; you will use them constantly.

• The Qiskit documentation and IBM Quantum Learning. The API reference is authoritative and IBM's free course material is the best structured introduction to Qiskit specifically. Check the version selector — this matters more here than for almost any other library. Tier 1.
• The Cirq documentation. Notably clear on the concepts that distinguish Cirq: qubit types, moments, and device abstractions. Tier 1.
• The PennyLane documentation and demos. The demo gallery is unusually good pedagogy, not just API examples; several are effectively short papers with runnable code. Tier 1.
• The Azure Quantum Development Kit documentation for Q#. Covers the language, the Python interop, and the resource estimator. Tier 1.
• The Amazon Braket developer guide. Includes the pricing model, which you should read before submitting anything to real hardware. Tier 2 — pricing and device availability change.

The specification

• The OpenQASM 3 specification (openqasm.com). The language reference. Skim the grammar overview now; return to it in Chapter 6. It is a real specification, written like one, and reading specifications is a skill worth practicing on a short one. Tier 1.

Books on quantum programming specifically

• Sarah Kaiser and Christopher Granade, Learn Quantum Computing with Python and Q# (Manning). The closest existing book to this one in spirit — practical, code-first, and honest. Its multi-language approach (Python plus Q#) is the direct ancestor of this book's multi-framework approach. Strongest on Q# and on the conceptual bridge from classical programming. Tier 1.
• Eric Johnston, Nic Harrigan, and Mercedes Gimeno-Segovia, Programming Quantum Computers (O'Reilly). Deliberately visual and intuition-first, with an emphasis on building a working mental model of what circuits do. A good companion when a Chapter 3 or 4 concept refuses to click. Framework-agnostic in a way that has aged well. Tier 1.
• Robert Sutor, Dancing with Qubits (Packt). More mathematical grounding than the two above, aimed at a technical reader without a physics background. Useful if Appendix D leaves you wanting more. Tier 2 — check for the current edition.

On the honest assessment of quantum claims

• Scott Aaronson's blog, Shtetl-Optimized. The most reliable public source for whether a given quantum claim holds up, written by a complexity theorist with no commercial stake and a low tolerance for hype. His posts analyzing specific advantage claims are a working demonstration of the method in Case Study 2. Tier 1.
• Scott Aaronson, "The Limits of Quantum Computers" (2008), Scientific American. A short, accessible corrective to the "quantum computers try all answers at once" misconception. Useful to hand to a colleague. Tier 2 — check availability.
• The classical-simulation counterattack literature. Rather than a single citation: when an advantage claim is made, search for classical simulation papers responding to it over the following eighteen months. This pattern — claim, classical counterattack, partial retreat — has recurred often enough to be the default expectation, and watching one unfold teaches the field's epistemics better than any summary. Tier 2.

On the state of the hardware

• Vendor hardware roadmaps (IBM, Google, IonQ, Quantinuum, and others). Read them as roadmaps: they state intent and have broadly been met on qubit-count milestones, and they are not evidence about applications. Comparing a roadmap published three years ago against what shipped is a genuinely useful calibration exercise. Tier 2 — these are updated continuously.
• Google Quantum AI, the December 2024 Willow announcement and accompanying paper on below-threshold surface code operation. The most significant error-correction result to date: logical error rate decreasing as the code distance grows. Worth understanding precisely what it does and does not establish, which is the skill Case Study 2 builds. Tier 1.

If you want the history

• Appendix J in this book gives the timeline of quantum computing and quantum software with dates, from Feynman's 1981 lecture forward. Start there before seeking a full-length history; it will tell you which decade you actually want. Tier 1.

Where to go next. If you want one thing: read Preskill's NISQ paper. It is twenty pages, it is free, and it will make every 🔬 Honest Assessment in this book read as a footnote to it.

If you would rather run something than read something — which is a defensible preference and arguably the correct one — go straight to Chapter 2.