Reading Lists

A useful reading route ends in a capability: deriving a protocol, identifying a theorem’s assumptions, or interpreting an experiment. The routes below use a small set of established texts and reviews, then send the reader to primary papers for the precise result being studied. Publication year is part of the guide: an older platform review remains useful for physical principles while providing no current performance ranking.

Foundations and quantum computation

Begin with complex vector spaces, tensor products, probabilities, and spectral decomposition. If those tools are unfamiliar, pair Bits, Qubits, Qudits, and Modes with the Mathematical Toolkit before treating circuits as formal symbol manipulation.

Nielsen and Chuang supply a broad introduction to qubits, circuits, algorithms, noise, and error correction. Preskill’s freely accessible course notes offer a complementary physics-oriented route; individual chapters have different revision dates, so cite the chapter version used. Watrous is a suitable next step for precise finite-dimensional statements about maps, norms, entropy, and entanglement.

Try it. Derive teleportation with an arbitrary input entangled with a reference system. Explain why this verifies preservation of quantum information more strongly than checking computational-basis inputs alone. Then translate between two fidelity conventions using the Glossary.

Algorithms and complexity

After learning reversible circuits and oracle access, use Montanaro’s overview to identify the mathematical primitive behind a proposed speedup. Study the corresponding Algorithm Index entry and its explanatory page before importing a runtime claim. Nielsen and Chuang develop Fourier and search constructions; Kitaev, Shen, and Vyalyi provide a more formal computational treatment.

Try it. For one algorithm, write separate counts for oracle calls, elementary gates, prepared states, and measurements. Specify input precision, failure probability, and whether the output is a classical number or a quantum state. For a complexity theorem, identify the promise and the input-size variable using the Complexity Class Glossary.

Error correction and fault tolerance

Use Roffe’s introductory guide to learn syndromes and local check extraction, then Gottesman’s thesis for the stabilizer formalism and code constructions. Read Why Quantum Error Correction Is Possible, Stabilizer Formalism, and the code comparison table together. Consult the primary reference attached to a particular code for conventions and hypotheses.

Try it. Verify a small code’s commuting checks and logical operators, then propagate a fault through its syndrome-extraction circuit. Explain why the code distance alone does not establish the circuit’s fault tolerance. Use Resource Estimation to account for ancillas and time as well as data qubits.

Communication, entropy, and cryptography

Wilde’s Quantum Information Theory organizes communication tasks and coding theorems around resources, typicality, and entropy. Watrous offers a complementary mathematical treatment of distinguishability and channel capacities. Start from Communication with Quantum Systems and Quantum Entropy, then choose a task in the Protocol Index.

Try it. State whether a coding rate is asymptotic or one-shot, which assistance is permitted, and what error criterion is imposed. For QKD, identify authentication, device assumptions, adversarial side information, and finite-size penalties before quoting a key rate. The original security proof cited by the chosen protocol is required reading for those assumptions.

Sensing and hardware

Degen, Reinhard, and Cappellaro provide an experimentalist’s introduction to quantum sensing, including signal accumulation, control, noise, and sensitivity. Work through Ramsey Interferometry and Classical and Quantum Fisher Information alongside it. Ladd and collaborators’ 2010 review is a historical introduction to hardware principles; use the Hardware Platforms chapter for platform-specific explanations and its cited literature for later developments.

Try it. Derive a sensor’s signal slope and measurement variance, including dead time and readout contrast. For a hardware comparison, state what experiment produced each number in the Hardware Metrics Table. Do not substitute a favorable isolated-device metric for a task-level performance estimate.

Research reviews and primary papers

Eisert and collaborators’ certification review supplies a framework for interpreting a measurement: specify the property, experimental access, assumptions, and statistical guarantee. Pair it with the Benchmark Index before reading a performance claim.

Use primary papers in two stages. First reconstruct the theorem or experiment in the authors’ actual setting, including the success event and comparator. Then identify which conditions survive in the new application. Historical papers establish what was proposed or demonstrated at that time; later reviews can clarify terminology but should not overwrite that distinction. Dated assessments and changing milestones belong to Research, while this reading list supplies the stable preparation for understanding them.

References

• Degen, Christian L., Friedemann Reinhard, and Paola Cappellaro, “Quantum sensing,” Reviews of Modern Physics 89, 035002 (2017), arXiv:1611.02427 — sensing principles and experimental constraints.
• Eisert, Jens, et al., “Quantum certification and benchmarking,” Nature Reviews Physics 2, 382–390 (2020), doi:10.1038/s42254-020-0186-4 — measurement guarantees and their assumptions.
• Gottesman, Daniel, Stabilizer Codes and Quantum Error Correction, Ph.D. thesis, California Institute of Technology, 1997, arXiv:quant-ph/9705052 — coding and stabilizer theory.
• Kitaev, Alexei Yu., Alexander H. Shen, and Mikhail N. Vyalyi, Classical and Quantum Computation, Graduate Studies in Mathematics 47, American Mathematical Society, 2002, doi:10.1090/gsm/047 — formal computation and complexity.
• Ladd, Thaddeus D., Fedor Jelezko, Raymond Laflamme, Yasunobu Nakamura, Christopher Monroe, and Jeremy L. O’Brien, “Quantum computers,” Nature 464, 45–53 (2010), doi:10.1038/nature08812 — historical hardware survey and physical principles.
• Montanaro, Ashley, “Quantum algorithms: an overview,” npj Quantum Information 2, 15023 (2016), doi:10.1038/npjqi.2015.23 — algorithm families and access models.
• Nielsen, Michael A., and Isaac L. Chuang, Quantum Computation and Quantum Information, 10th anniversary edition, Cambridge University Press, 2010, doi:10.1017/CBO9780511976667 — broad introductory text.
• Preskill, John, Quantum Computation, Physics 219/Computer Science 219 lecture notes, California Institute of Technology, chapter revisions 1997–2026, course archive — complementary lecture-based route; use the date on the selected chapter.
• Roffe, Joschka, “Quantum error correction: an introductory guide,” Contemporary Physics 60, 226–245 (2019), arXiv:1907.11157 — accessible code and syndrome-circuit introduction.
• Watrous, John, The Theory of Quantum Information, Cambridge University Press, 2018, author manuscript and errata — mathematical quantum-information methods.
• Wilde, Mark M., Quantum Information Theory, second edition, Cambridge University Press, 2017, doi:10.1017/9781316809976 — communication and coding theorems.