References: What Is Quantum Computing?

1. Qubit - Wikipedia - Covers the mathematical formalism of qubits, Dirac notation, the Bloch sphere representation, and physical realizations, directly supporting this chapter's primer on quantum bits and their properties.

2. Quantum superposition - Wikipedia - Explains the principle of superposition, probability amplitudes, and quantum interference, which this chapter identifies as the mechanism underlying all quantum algorithmic speedups.

3. Quantum entanglement - Wikipedia - Describes entanglement, Bell states, and Bell's theorem, providing the theoretical foundation for understanding why entanglement is essential for quantum computation as discussed in this chapter.

4. Quantum Computation and Quantum Information (10th Anniversary Edition, 2010) - Michael A. Nielsen and Isaac L. Chuang - Cambridge University Press - The standard graduate textbook covering qubits, quantum gates, complexity classes like BQP, and the no-cloning theorem, all foundational concepts introduced in this chapter.

5. Quantum Computing: An Applied Approach (2nd Edition, 2021) - Jack D. Hidary - Springer - Provides accessible explanations of superposition, entanglement, measurement, and the circuit model of quantum computing with practical examples relevant to this chapter's primer approach.

6. Quantum Computing: Progress and Prospects (2019) - National Academies of Sciences - Authoritative consensus report assessing quantum computing's theoretical foundations and practical barriers, including the qubit error rate gap and limited algorithmic speedups discussed in this chapter.

7. Quantum Algorithm Zoo - Stephen Jordan, Microsoft Research - Comprehensive catalog of known quantum algorithms and their speedups over classical counterparts, relevant to this chapter's discussion of the remarkably short list of proven quantum advantages.

8. The Limits of Quantum Computers - Scott Aaronson, Scientific American (2008) - Accessible explanation of what quantum computers cannot do, including why they likely cannot solve NP-complete problems, directly supporting this chapter's section on quantum computing limitations.

9. No-cloning theorem - V. Buzek and M. Hillery, arXiv - Reviews the no-cloning theorem and its implications for quantum information processing, a key constraint this chapter identifies as creating the "double bind" for quantum error correction.

10. Complexity Zoo: BQP - Complexity Zoo - Defines the BQP complexity class and its relationships to P, NP, and PSPACE, providing formal context for this chapter's discussion of where quantum computing fits in the computational complexity hierarchy.