Affiliate disclosure

Book titles on this page link to Amazon. As an Amazon Associate, DataField.Dev earns from qualifying purchases — at no additional cost to you.

Bibliography

Every source cited anywhere in this book — 407 distinct entries, assembled by scripts/assemble_appendices.py from the further-reading.md files rather than from memory.

Chapter numbers after each entry say where it is discussed, and the chapter's own reading list says why it is worth reading and at what tier of confidence. This list is an index, not a recommendation — the recommendations live in the chapters.

Entries are reproduced as the chapters cite them. Where a chapter flagged a source as Tier 2 — real and worth seeking, but verify the current version — that caveat still applies here.

A

  • Aaronson and Ambainis, "The need for structure in quantum speedups" (2014). — Ch. 20
  • Aaronson's writing on Grover and QRAM. — Ch. 21
  • Aaronson, "Quantum Computing Since Democritus" — Ch. 19
  • Aaronson, "Read the fine print" (2015), Nature Physics 11, 291. — Ch. 22, 32, 40
  • Aaronson, "Read the fine print" (2015). — Ch. 35
  • Aer's save instructions — Ch. 26
  • Aharonov and Ben-Or, "Fault-tolerant quantum computation with constant error" (1997). — Ch. 25
  • Amy, Maslov, and Mosca on $T$-count optimization — Ch. 28
  • Analyses of when dequantization does NOT apply. — Ch. 32
  • Analyses of XEB's fidelity estimator and its assumptions. — Ch. 30
  • Any analysis of QRAM's error-correction requirements. — Ch. 32
  • Any careful analysis of quantum machine learning speedup claims that depend on QRAM. — Ch. 21
  • Any careful discussion of quantum volume and its successors (CLOPS, layer fidelity, EPLG). — Ch. 12
  • Any careful discussion of the "database search" framing of Grover. — Ch. 19
  • Any careful popular account that emphasizes the classical channel. — Ch. 9
  • Any careful treatment of "harvest now, decrypt later." — Ch. 23
  • Any careful treatment of Landauer's principle. — Ch. 19
  • Any careful treatment of non-Markovian noise. — Ch. 11
  • Any careful treatment of quantum circuit scheduling and ASAP/ALAP. — Ch. 14
  • Any careful treatment of quantum state tomography's scaling. — Ch. 22
  • Any careful treatment of the sampling overhead $\gamma^{2d}$. — Ch. 13
  • Any current review of quantum repeaters and quantum networks. — Ch. 9
  • Any current work on fault-tolerant Grover resource estimates for AES. — Ch. 21
  • Any current work on ion-chain scaling and photonic interconnects. — Ch. 17
  • Any current work on phase estimation variants with reduced circuit depth — Ch. 22
  • Any current work on QAOA performance guarantees and limitations at low depth. — Ch. 24
  • Any current work on quantum intermediate representations. — Ch. 18
  • Any current work on reversible modular multiplication and constant-factor optimizations. — Ch. 23
  • Any current work on T-count optimization and Clifford+T synthesis. — Ch. 15
  • Any discussion of "natural sort" versus lexicographic sort. — Ch. 8
  • Any discussion of byte-order bugs in classical systems programming. — Ch. 14
  • Any discussion of reproducibility in computational research. — Ch. 31
  • Any experimental paper measuring DD on superconducting hardware — Ch. 31
  • Any factoring demonstration you encounter, read for its modular arithmetic. — Ch. 23
  • Any good introduction to Monte Carlo estimation. — Ch. 7
  • Any good quantum-chemistry textbook's treatment of CASSCF and active-space selection — Ch. 36
  • Any interactive Bloch sphere visualizer. — Ch. 3
  • Any linear algebra text's chapter on unitary and Hermitian matrices. — Ch. 3
  • Any of the ongoing discussions of reproducibility in computational science. — Ch. 10
  • Any recent critical review of QML's practical status. — Ch. 32
  • Any recent survey of classical quantum-chemistry methods — Ch. 24
  • Any recent survey of qubit mapping and routing. — Ch. 10
  • Any recent work on neutral-atom gate fidelities and mid-circuit measurement. — Ch. 17
  • Any recent work on real-time classical control for quantum error correction. — Ch. 9
  • Any standard treatment of SVMs and the kernel trick — Ch. 34
  • Any survey of the hidden subgroup problem, on the non-abelian case. — Ch. 23
  • Any survey of the hidden subgroup problem. — Ch. 20
  • Any treatment of "magic state distillation" or "T-count." — Ch. 7
  • Any treatment of "make illegal states unrepresentable." — Ch. 7
  • Any treatment of circuit-level noise versus code-capacity noise. — Ch. 25
  • Any treatment of KAK / Cartan decomposition of two-qubit unitaries. — Ch. 28
  • Any treatment of linear algebra over $\mathbb{F}_2$. — Ch. 20
  • Any treatment of non-Markovian noise and $1/f$ dephasing in superconducting qubits. — Ch. 13
  • Any treatment of quantum state tomography. — Ch. 11
  • Any treatment of qubit routing and SWAP-network synthesis. — Ch. 17
  • Any treatment of Simpson's paradox or of the perils of averaging. — Ch. 12
  • Any treatment of statistical power in hypothesis testing. — Ch. 27
  • Any treatment of statistical significance for A/B comparisons. — Ch. 28
  • Any treatment of the cross-resonance interaction — Ch. 31
  • Any treatment of the Gottesman–Knill theorem in a testing context. — Ch. 26
  • Any treatment of the numerics of finite differencing. — Ch. 16
  • Any treatment of the unitary coupled-cluster (UCCSD) ansatz. — Ch. 24
  • Any treatment of total cost of ownership for deployed ML systems. — Ch. 33
  • Any treatment of universal approximation for neural networks — Ch. 33
  • Any two quantum computing textbooks, compared on how they write a multi-qubit basis state. — Ch. 18
  • Any vendor's public explainer on dilution refrigeration. — Ch. 2
  • Any well-argued treatment of static versus dynamic typing. — Ch. 15
  • Anything on "confirmation-bias-resistant testing." — Ch. 7
  • Anything on "primitive obsession" and on encoding invariants in types. — Ch. 8
  • Anything on magic state distillation and T-count optimization. — Ch. 11
  • Anything on measurement error mitigation and the assignment matrix. — Ch. 12
  • Anything on property-based testing — Ch. 26, 27
  • Anything on summary statistics and skewed distributions. — Ch. 30
  • Anything on the "lossy round trip" problem in data engineering — Ch. 6
  • Anything on the pitfalls of proxy metrics in performance engineering. — Ch. 28
  • Anything on the replication crisis and small-sample inference. — Ch. 33
  • Anything on the Toffoli's 7-T decomposition and its variants. — Ch. 15
  • Anything published on QPU utilization and scheduling. — Ch. 39
  • arXiv quant-ph — Ch. 40
  • AWS Braket developer guide — Ch. 39
  • Azure Quantum documentation — Ch. 39

B

  • Barak et al. and related work on classical algorithms that match QAOA at fixed $p$. — Ch. 37
  • Barenco et al., "Elementary Gates for Quantum Computation" (1995), Physical Review A 52, 3457. — Ch. 10
  • Barenco et al., "Elementary gates for quantum computation" (1995), Physical Review A 52, 3457. — Ch. 19
  • Beauregard, "Circuit for Shor's algorithm using 2n+3 qubits" (2003). — Ch. 23
  • Bernstein and Lange, "Post-quantum cryptography" (2017), Nature 549, 188. — Ch. 38
  • Bouthillier et al. on accounting for variance in machine learning benchmarks (2021). — Ch. 33
  • Bowles, Ahmed, and Schuld on benchmarking QML models (2024). — Ch. 35
  • Bowles, Ahmed, and Schuld on benchmarking quantum machine learning models (2024). — Ch. 34
  • Brassard, Høyer, Mosca, and Tapp on amplitude estimation — Ch. 22
  • Brassard, Høyer, Mosca, and Tapp, "Quantum Amplitude Amplification and Estimation" (2002). — Ch. 5

C

  • cvxpy with SCS or Clarabel — Ch. 37
  • Cai et al., "Quantum Error Mitigation" (2023), Reviews of Modern Physics. — Ch. 13
  • Calderbank and Shor (1996) and Steane (1996) on CSS codes. — Ch. 25
  • Cerezo et al. on cost-function-dependent barren plateaus (2021). — Ch. 32
  • Cerezo et al., "Variational Quantum Algorithms" (2021), Nature Reviews Physics 3, 625. — Ch. 8, 16, 24, 32
  • Chapters 7–13 — Ch. 18
  • Classical shadows — Ch. 40
  • Clauser, Horne, Shimony, and Holt (1969), Physical Review Letters 23, 880. — Ch. 4
  • Cleve, Ekert, Macchiavello, and Mosca, "Quantum algorithms revisited" (1998). — Ch. 23
  • CLOPS (Circuit Layer Operations Per Second) — Ch. 39
  • Cotler, Huang, and McClean on revisiting dequantization and quantum advantage in learning. — Ch. 35
  • Cowtan et al., "On the Qubit Routing Problem" (2019), TQC. — Ch. 10
  • Cross, Bishop, Smolin, and Gambetta, "Open Quantum Assembly Language" (2017), arXiv:1707.03429. — Ch. 6
  • Cross-entropy benchmarking (XEB) — Ch. 27
  • Current application-benchmark suites — Ch. 30
  • Current work on magic state cultivation and lower-overhead distillation. — Ch. 25
  • Cycle benchmarking and Pauli-channel estimation. — Ch. 30

D

  • David Spiegelhalter, The Art of Statistics. — Ch. 5
  • Device-independent QKD — Ch. 38
  • Documentation for Gurobi, CPLEX, or HiGHS on optimality gaps. — Ch. 37
  • Documentation on measurement-basis grouping in the Estimator. — Ch. 39

E

  • Each framework's own migration and interoperability documentation. — Ch. 18
  • Ekert, "Quantum cryptography based on Bell's theorem" (1991), PRL 67, 661. — Ch. 38
  • Estimates of the classically-intractable frontier for correlated systems. — Ch. 24
  • ETSI's QKD standardization work. — Ch. 38
  • Ezzell et al., "Dynamical decoupling for superconducting qubits: a performance survey" (2023). — Ch. 13

F

  • Farhi, Goldstone, and Gutmann on QAOA applied to bounded-degree MaxCut. — Ch. 37
  • Feynman's "Cargo Cult Science" (1974 Caltech commencement address). — Ch. 40
  • Feynman, The Feynman Lectures on Physics, Volume III, Chapters 5 and 6. — Ch. 3
  • Follow-up work on derandomized and locally-biased shadows. — Ch. 35

G

  • generate_preset_pass_manager and the PassManager composition API. — Ch. 28
  • git bisect's documentation — Ch. 26
  • Gidney, "Halving the cost of quantum addition" (2018), Quantum 2, 74. — Ch. 19
  • Giovannetti, Lloyd, and Maccone on QRAM (2008). — Ch. 32
  • Gisin, Ribordy, Tittel, and Zbinden, "Quantum cryptography" (2002), RMP 74, 145. — Ch. 38
  • Giurgica-Tiron et al., "Digital Zero Noise Extrapolation for Quantum Error Mitigation" (2020). — Ch. 13
  • Google Quantum AI's below-threshold surface code results (2023–2024). — Ch. 40
  • Google Quantum AI, "Quantum error correction below the surface code threshold" (2024), Nature. — Ch. 25
  • Gottesman, "Stabilizer Codes and Quantum Error Correction" (1997), PhD thesis, arXiv:quant-ph/9705052. — Ch. 25
  • Graph embedding and minor-containment theory. — Ch. 17
  • Greenberger, Horne, and Zeilinger, "Going Beyond Bell's Theorem" (1989). — Ch. 4

H

  • Hardy and Wright, An Introduction to the Theory of Numbers, on continued fractions. — Ch. 23
  • Henriet et al., "Quantum computing with neutral atoms" (2020), Quantum 4, 327. — Ch. 17
  • Huang and Martonosi, "QDB: From Quantum Algorithms Towards Correct Quantum Programs" (2018). — Ch. 26, 27
  • Huang et al. on the power of data in quantum machine learning (2021), Nature Communications. — Ch. 32
  • Huang et al., "Quantum advantage in learning from experiments" (2022), Science 376, 1182. — Ch. 40
  • Hyrum's Law — Ch. 6, 31

I

  • IBM Quantum Learning (the free course platform). — Ch. 2
  • IBM Quantum Platform documentation — Ch. 39
  • IBM Quantum's backend calibration pages — Ch. 29
  • IBM Quantum's calibration pages for a live device. — Ch. 30
  • IBM Quantum's documentation on dynamic circuit support. — Ch. 9
  • IBM Quantum's processor documentation and system pages. — Ch. 2
  • IBM's papers and technical notes on the heavy-hex lattice. — Ch. 29
  • IBM's published rationale for the heavy-hexagonal lattice. — Ch. 10
  • Ioannidis, "Why most published research findings are false" (2005), PLoS Medicine 2, e124. — Ch. 40

J

  • J. S. Bell, "On the Einstein Podolsky Rosen Paradox" (1964), Physics 1, 195. — Ch. 4
  • Jacob Cohen, Statistical Power Analysis for the Behavioral Sciences. — Ch. 5
  • John Preskill, "Quantum Computing in the NISQ Era and Beyond" (2018), Quantum 2, 79. — Ch. 1
  • John Preskill, lecture notes on quantum information, Chapter 3. — Ch. 5
  • John Preskill, lecture notes on quantum information, Chapter 4 ("Quantum Entanglement"). — Ch. 4
  • John Watrous, lecture notes on quantum information (available free online). — Ch. 3
  • Jordan and Wigner (1928) — Ch. 36

K

  • Kaye, Laflamme, and Mosca, An Introduction to Quantum Computing, Chapter 7. — Ch. 20
  • Kissinger and van de Wetering on $T$-count reduction with ZX-calculus. — Ch. 28
  • Kitaev's original toric code paper (1997/2003). — Ch. 25
  • Knill, Laflamme, and Zurek on the accuracy threshold (1998), and Kitaev's contemporaneous work. — Ch. 25
  • Kübler, Buchholz, and Schölkopf, "The inductive bias of quantum kernels" (2021), NeurIPS. — Ch. 34

L

  • Liao et al. on satellite-to-ground QKD with Micius (2017), Nature 549, 43. — Ch. 38
  • Literature comparing QAOA against classical heuristics on realistic instances. — Ch. 24
  • Literature on amplitude estimation and its applications — Ch. 21
  • Literature on architecture-aware algorithm design. — Ch. 17
  • Literature on automated active-space selection — Ch. 36
  • Literature on benchmark gaming and Goodhart's law. — Ch. 30
  • Literature on circuit knitting and distributed quantum computing. — Ch. 35
  • Literature on classifying phases of matter with machine learning — Ch. 35
  • Literature on distribution testing / identity testing in theoretical computer science. — Ch. 27
  • Literature on metamorphic testing for quantum programs. — Ch. 26
  • Literature on minimum-weight perfect matching and neural-network decoders. — Ch. 25
  • Literature on mutation testing. — Ch. 27
  • Literature on nested cross-validation and the dangers of tuning on the test set. — Ch. 33
  • Literature on noise-adaptive compilation. — Ch. 12
  • Literature on Nyström approximation and random-features methods. — Ch. 34
  • Literature on Pauli grouping and commuting-set measurement. — Ch. 24
  • Literature on Pauli twirling and probabilistic error cancellation — Ch. 39
  • Literature on QAOA graph embedding — Ch. 29
  • Literature on quantum annealing benchmarks — Ch. 37
  • Literature on quantum circuit benchmark suites — Ch. 28
  • Literature on qubit mapping and routing algorithms — Ch. 29
  • Literature on real-time decoding — Ch. 40
  • Literature on reproducibility in computational science. — Ch. 18
  • Literature on reversible circuit synthesis from classical specifications. — Ch. 19
  • Literature on statistical practice in machine learning benchmarking — Ch. 37
  • Literature on template matching and peephole optimization for quantum circuits. — Ch. 28
  • Literature on the filter-function formalism for decoupling sequences. — Ch. 31
  • Literature on the limits of RB — Ch. 30
  • Litinski, "A Game of Surface Codes" (2019). — Ch. 15

M

  • Magesan et al. on interleaved RB (2012). — Ch. 30
  • Makarov and collaborators' broader body of QKD hacking work. — Ch. 38
  • Maximilian Schlosshauer, Decoherence and the Quantum-to-Classical Transition. — Ch. 5
  • McKay et al., "Efficient Z-Gates for Quantum Computing" (2017), Physical Review A 96, 022330. — Ch. 3, 8
  • Mosca's theorem / the "Mosca inequality." — Ch. 23
  • Mosca's theorem on migration timelines — Ch. 38
  • Muskit, QuCAT, and similar quantum mutation- and combinatorial-testing tools. — Ch. 27

N

  • networkx — Ch. 37
  • N. David Mermin, "Is the Moon There When Nobody Looks?" (1985), Physics Today 38(4), 38. — Ch. 4
  • Nam, Su, and Maslov, or similar work on QFT and arithmetic circuit optimization. — Ch. 22
  • Nielsen and Chuang §1.3.7 and §2.3. — Ch. 9
  • Nielsen and Chuang §10.5. — Ch. 7
  • Nielsen and Chuang §4.2 — Ch. 8
  • Nielsen and Chuang §8.5 — Ch. 12
  • Nielsen and Chuang's notational conventions — Ch. 14
  • Nielsen and Chuang, Quantum Computation and Quantum Information, §1.3 and §4.2. — Ch. 3
  • Nielsen and Chuang, Chapter 5. — Ch. 22
  • Nielsen and Chuang, Chapter 8. — Ch. 11
  • Nielsen and Chuang, §1.4.2–1.4.4 and Chapter 6. — Ch. 19
  • Nielsen and Chuang, §2.2.3 through §2.2.6. — Ch. 5
  • Nielsen and Chuang, §4.5. — Ch. 3
  • Nielsen and Chuang, §5.3. — Ch. 23
  • Nielsen and Chuang, §5.4.3. — Ch. 20
  • NIST FIPS 203 (ML-KEM), 204 (ML-DSA), and 205 (SLH-DSA), 2024. — Ch. 38
  • NIST's post-quantum cryptography documentation on security categories. — Ch. 21
  • NIST's post-quantum cryptography standards and migration guidance. — Ch. 23

O

  • Operator.from_circuit — Ch. 26
  • OpenFermion — Ch. 14, 36
  • Otfried Gühne and Géza Tóth, "Entanglement Detection" (2009), Physics Reports 474, 1. — Ch. 4

P

  • pytest parametrization, fixtures, and pytest.approx. — Ch. 27
  • Papers on hardware demonstrations of qubit reuse. — Ch. 9
  • Papers reporting resource estimates for near-term algorithms — Ch. 39
  • PennyLane's qml.qaoa module — Ch. 37
  • PennyLane's qml.qchem module — Ch. 36
  • PennyLane's documentation and demos. — Ch. 32
  • Photon-number-splitting attacks and the decoy-state method — Ch. 38
  • Preskill, "Quantum Computing in the NISQ era and beyond" (2018), Quantum 2, 79. — Ch. 40
  • Preskill, "Reliable Quantum Computers" (1998), arXiv:quant-ph/9705031. — Ch. 25
  • PyMatching — Ch. 25
  • PySCF — Ch. 36

Q

  • qiskit.quantum_info.random_statevector and random_unitary — Ch. 27
  • QIR (Quantum Intermediate Representation), an LLVM-based specification from the QIR Alliance. — Ch. 6
  • Qiskit Dynamics. — Ch. 31
  • Qiskit Machine Learning — Ch. 32
  • Qiskit Nature — Ch. 36
  • Qiskit Optimization — Ch. 37
  • Qiskit Runtime's Estimator documentation on resilience_level. — Ch. 39
  • Qiskit Runtime's documentation — Ch. 35
  • Qiskit's CouplingMap documentation — Ch. 29
  • Qiskit's backend properties() and target APIs. — Ch. 39
  • Qiskit's dynamic circuits documentation — Ch. 29
  • Qiskit's noise-model documentation — Ch. 25
  • Qiskit's own test suite. — Ch. 27
  • Qiskit's scheduling documentation — Ch. 31
  • Qiskit's transpiler documentation — Ch. 28
  • Qiskit's transpiler documentation on TranspileLayout — Ch. 26
  • Qsim — Ch. 14
  • Quantinuum's H-Series documentation on HQC (Hardware Quantum Credits) — Ch. 39
  • Quantum equivalence checking with decision diagrams — Ch. 27
  • Quantum program verification and equivalence checking — Ch. 26
  • Quek et al. and related work on exponentially-scaling mitigation overheads. — Ch. 13

R

  • Randomized benchmarking and cycle benchmarking. — Ch. 26
  • Recent work on classical simulability of circuits that avoid barren plateaus. — Ch. 16
  • Recent work on quantum low-density parity-check codes — Ch. 25
  • Regina Nuzzo, "Scientific Method: Statistical Errors" (2014), Nature 506, 150. — Ch. 5
  • Renner, "Security of Quantum Key Distribution" (2005), PhD thesis. — Ch. 38
  • Robert Sutor, Dancing with Qubits (Packt). — Ch. 1
  • Román Orús, "A Practical Introduction to Tensor Networks" (2014), Annals of Physics 349, 117. — Ch. 11
  • Ronald de Wolf, "Quantum Computing: Lecture Notes" (arXiv, regularly updated). — Ch. 19, 20
  • Ross and Selinger, "Optimal ancilla-free Clifford+T approximation of z-rotations" (2016). — Ch. 15

S

  • scikit-learn's documentation on SVC(kernel='precomputed'). — Ch. 34
  • scikit-learn's documentation on cross-validation and cross_val_score. — Ch. 33
  • scikit-learn's documentation on model selection. — Ch. 32
  • Sarah Kaiser and Christopher Granade, Learn Quantum Computing with Python and Q# (Manning). — Ch. 1
  • Scarani and Renner on finite-key bounds for practical implementations. — Ch. 38
  • Schuld and Petruccione, Machine Learning with Quantum Computers (2nd ed., 2021). — Ch. 32
  • Schuld, "Supervised quantum machine learning models are kernel methods" (2021), arXiv:2101.11020. — Ch. 34
  • Scott Aaronson's blog, Shtetl-Optimized. — Ch. 1
  • Scott Aaronson, "The Limits of Quantum Computers" (2008), Scientific American. — Ch. 1
  • Sean Carroll, Something Deeply Hidden. — Ch. 5
  • Simons Collaboration benchmark papers on strongly-correlated systems — Ch. 36
  • Simultaneous RB and crosstalk characterization. — Ch. 30
  • Smolin, Smith, and Vargo, "Oversimplifying quantum factoring" (2013), Nature 499, 163. — Ch. 23
  • Standard treatments of quantum state and process tomography — Ch. 26
  • Standard treatments of total variation distance, and of goodness-of-fit tests — Ch. 27
  • Steane, "Error correcting codes in quantum theory" (1996), Physical Review Letters 77, 793. — Ch. 25
  • Stim (Gidney), a fast stabilizer circuit simulator. — Ch. 25

T

  • Tang's "quantum-inspired" classical algorithms (2018 onward). — Ch. 22
  • Tang, "A quantum-inspired classical algorithm for recommendation systems" (2019), STOC. — Ch. 32
  • The "Dirac belt trick" / plate trick. — Ch. 3
  • The "parse, don't validate" essay and its descendants. — Ch. 7
  • The "rule of three" for zero-event confidence bounds. — Ch. 27
  • The 2022 Nobel Prize in Physics scientific background document (Aspect, Clauser, Zeilinger). — Ch. 4
  • The approximation_degree documentation and the UnitarySynthesis pass. — Ch. 28
  • The cirq-google documentation on devices and GridDevice. — Ch. 14
  • The mapomatic package — Ch. 12
  • The mitiq documentation — Ch. 13
  • The pennylane-qiskit and pennylane-cirq plugin documentation. — Ch. 16
  • The qiskit-aer documentation on simulation methods. — Ch. 7, 11
  • The qiskit-aer documentation. — Ch. 2
  • The qiskit-braket-provider, pennylane-qiskit, and similar bridge packages. — Ch. 18
  • The qiskit-ibm-runtime documentation on resilience_level and the resilience options. — Ch. 13
  • The qiskit-ibm-runtime documentation on execution modes. — Ch. 7
  • The qiskit-ibm-runtime documentation on jobs, sessions, and batch mode. — Ch. 12
  • The qiskit-ibm-runtime documentation. — Ch. 2
  • The qiskit.circuit.library documentation. — Ch. 8
  • The qiskit.dagcircuit API reference. — Ch. 10
  • The qiskit.primitives documentation, and the primitives interface specification. — Ch. 7
  • The qiskit.qasm3 and qiskit.qasm2 module documentation. — Ch. 6
  • The qiskit.qpy documentation. — Ch. 6
  • The qiskit.quantum_info API documentation — Ch. 26
  • The qiskit.transpiler.passes API listing. — Ch. 28
  • The qiskit_aer.noise documentation. — Ch. 11
  • The qiskit_ibm_runtime.fake_provider documentation. — Ch. 12
  • The sympy documentation on symbols and expressions. — Ch. 14
  • The Target and BackendV2 API documentation. — Ch. 30
  • The Target API documentation — Ch. 31
  • The venv module documentation in the Python standard library. — Ch. 2
  • The VF2PostLayout pass documentation specifically. — Ch. 4
  • The Amazon Braket developer guide. — Ch. 1, 17
  • The American Statistical Association's 2016 "Statement on p-Values." — Ch. 5
  • The Azure Quantum Development Kit documentation for Q#. — Ch. 1
  • The Azure Quantum Resource Estimator documentation. — Ch. 15
  • The backend Target API. — Ch. 29
  • The Bloch sphere article on Wikipedia. — Ch. 3
  • The Braket Analog Hamiltonian Simulation guide. — Ch. 17
  • The Braket documentation on verbatim compilation. — Ch. 17
  • The Braket examples repository. — Ch. 17
  • The Braket SDK API reference for Circuit, Gate, and Noise. — Ch. 17
  • The broader computational-reproducibility literature — Ch. 39
  • The Burer–Monteiro approach to large-scale SDP — Ch. 37
  • The Cirq "Comparison to other frameworks" material, if current. — Ch. 14
  • The Cirq API reference for cirq.Circuit, cirq.Moment, and cirq.InsertStrategy. — Ch. 14
  • The Cirq documentation, starting with the "Circuits" and "Simulation" guides. — Ch. 14
  • The Cirq documentation. — Ch. 1
  • The classical literature on byte order. — Ch. 18
  • The classical-simulation counterattack literature. — Ch. 1
  • The classical-simulation rebuttals — Ch. 30
  • The CRYSTALS-Kyber specification — Ch. 38
  • The dequantization follow-ups — Ch. 32
  • The IBM Quantum Platform documentation on backends and calibration data. — Ch. 12
  • The literature on classical shadows and randomized measurements. — Ch. 16
  • The literature on classical simulation of quantum supremacy experiments. — Ch. 11
  • The literature on efficient quantum state preparation. — Ch. 22
  • The literature on hybrid key exchange. — Ch. 23
  • The literature on Pauli grouping and commuting-set partitioning — Ch. 5
  • The literature on qubit-wise commuting grouping — Ch. 7
  • The M3 package documentation — Ch. 13
  • The Microsoft Quantum Development Kit documentation. — Ch. 15
  • The MLIR project documentation, on dialects. — Ch. 6
  • The no-communication theorem. — Ch. 9
  • The OpenQASM 3 specification (openqasm.com). — Ch. 1
  • The OpenQASM 3 specification's treatment of timing and delay — Ch. 14
  • The OpenQASM 3 specification, at openqasm.com. — Ch. 6
  • The OpenQASM 3 specification. — Ch. 18
  • The PennyLane API reference for qml.grad, diff_method, and the device classes. — Ch. 16
  • The PennyLane demos on VQE and QAOA. — Ch. 24
  • The PennyLane documentation and demos. — Ch. 1, 16
  • The PennyLane templates catalogue. — Ch. 16
  • The probability that random $\mathbb{F}_2$ vectors are independent. — Ch. 20
  • The Python Packaging User Guide, "Installing packages using pip and virtual environments." — Ch. 2
  • The Q# code samples repository. — Ch. 15
  • The Q# language specification. — Ch. 15
  • The Qiskit 1.x deprecation notices and the 2.0 migration guide. — Ch. 31
  • The Qiskit 2.1 release notes, on the circuit-library deprecations. — Ch. 8
  • The Qiskit API reference, with the version selector set to your installed version. — Ch. 7
  • The Qiskit circuit library API reference. — Ch. 3
  • The Qiskit documentation and IBM Quantum Learning. — Ch. 1
  • The Qiskit documentation for QFTGate and qiskit.circuit.library. — Ch. 22
  • The Qiskit documentation on MCXGate and qiskit.synthesis. — Ch. 19
  • The Qiskit documentation on classical feedforward and if_test. — Ch. 9
  • The Qiskit documentation on writing a custom pass and on PassManager callbacks. — Ch. 6
  • The Qiskit documentation on writing a custom pass. — Ch. 10
  • The Qiskit documentation, "Install Qiskit" and the API reference. — Ch. 2
  • The Qiskit Experiments documentation on $T_1$, $T_2$, and randomized benchmarking measurements. — Ch. 11
  • The Qiskit Experiments documentation on $T_1$, $T_2$, and randomized benchmarking. — Ch. 12
  • The Qiskit GitHub issue tracker. — Ch. 2
  • The Qiskit QPY documentation. — Ch. 18
  • The Qiskit release notes for 1.0. — Ch. 6
  • The Qiskit Slack workspace and community forums. — Ch. 2
  • The Qiskit transpiler documentation on VF2Layout and VF2PostLayout. — Ch. 12
  • The Qiskit transpiler documentation on preset pass managers and layout stages. — Ch. 4
  • The Qiskit transpiler documentation on preset pass managers. — Ch. 6
  • The Qiskit transpiler documentation. — Ch. 10
  • The Qiskit YouTube channel's Coding with Qiskit series. — Ch. 2
  • The Qiskit, PennyLane, and Cirq documentation. — Ch. 40
  • The Quantum Computing Stack Exchange. — Ch. 2
  • The reproducibility literature in machine learning — Ch. 40
  • The SciPy stats documentation, particularly chisquare, binomtest, and bootstrap. — Ch. 5
  • The SECOQC and Tokyo QKD network papers — Ch. 38
  • The Solovay–Kitaev theorem — Ch. 10
  • The UK NCSC and NSA position papers on QKD. — Ch. 38
  • The VF2 subgraph isomorphism algorithm — Ch. 10
  • Tim Maudlin, Quantum Non-Locality and Relativity. — Ch. 4
  • Trojan-horse attacks — Ch. 38

U

  • uv or conda as alternatives to venv + pip. — Ch. 2

V

  • VF2Layout and VF2PostLayout documentation and source. — Ch. 29
  • van Dam et al. / the Azure QRE team's papers on the resource estimator's models. — Ch. 15
  • Vendor calibration-data papers and device announcements. — Ch. 12
  • Vendor hardware roadmaps (IBM, Google, IonQ, Quantinuum, and others). — Ch. 1
  • Vendor roadmaps. — Ch. 39

W

  • W. K. Wootters and W. H. Zurek, "A Single Quantum Cannot Be Cloned" (1982), Nature 299. — Ch. 1
  • Wack et al. on CLOPS — Ch. 30
  • Work on $1/f$ flux noise in superconducting qubits. — Ch. 31
  • Work on Grover-based approaches to constraint satisfaction and optimization. — Ch. 21
  • Work on learning from quantum data — Ch. 32
  • Work on machine-learning reproducibility — Ch. 39
  • Work on metamorphic testing specifically for quantum programs. — Ch. 27
  • Work on projection-based and non-destructive assertions. — Ch. 26
  • Work on quantum sensing and metrology as a learning problem. — Ch. 35
  • Work on quantum simulation of dynamics — Ch. 40
  • Work on qubit tapering and $\mathbb{Z}_2$ symmetry reduction. — Ch. 36
  • Work on qubit-reuse compilation — Ch. 29
  • Work on T-count optimization for multi-controlled gates. — Ch. 19

Y

  • Your own IBM Quantum dashboard. — Ch. 2
  • Your provider's device status page. — Ch. 12
  • Your target journal's reproducibility guidance for quantum submissions. — Ch. 10

Z

  • Zeller, "Why Programs Fail: A Guide to Systematic Debugging." — Ch. 26
  • ZX-calculus and PyZX (Kissinger and van de Wetering). — Ch. 28