Study guide

A route through the book

1. Logic and Computability: Define what a mechanical procedure can do before asking what changes in quantum computing.
2. Boolean and Reversible Computation: Build computations from Boolean operations and learn how to preserve the information they would otherwise discard.
3. Probability Amplitudes and Interference: Understand why probabilities alone do not describe interference, and learn to calculate with amplitudes.
4. Quantum States and Measurement: Use state vectors and inner products to describe transition amplitudes and geometry, then express operations as matrices and calculate measurement outcomes.
5. Quantum Model of Computation: Understand the global model of quantum computation and calculate a complete single-qubit example.
6. Multi-Qubit Computation: Extend the single-qubit model to computations on joint registers, including measurement and classical control.
7. Quantum Queries and Phase Kickback: Use a reversible query to encode a property in relative phase and read it through interference.
8. Quantum Circuits and Universality: Translate abstract operations into circuits and account for the work hidden inside a gate box.
9. Quantum Search and Amplitude Amplification: Turn a phase mark into increased success probability and determine when to stop iterating.
10. Computational Complexity and Quantum Advantage: Evaluate a quantum advantage claim by fixing the task, model, error allowance, and counted resources.

Follow one calculation across chapters

Begin with Boolean function evaluation in Chapter 2. Preserve its inputs and clear its workspace. Chapter 7 uses that reversible evaluation to place a function value in a phase. Chapter 8 constructs the operations from elementary gates. Chapter 9 uses phase marking and reflections to find successful candidates, and Chapter 10 compares their costs and limits. At each step, ask what information changed and what a measurement can reveal.

Working through a section

Read the explanation and reconstruct its diagram without looking. Calculate one small example. Before using an experiment, write down your prediction and the reason for it. If the result differs, identify the first step where your calculation and the experiment disagree.

Each subsection has an illustration and three questions, and a subsection that introduces new terms lists them under Keywords. Read the figure with its caption, then use the questions to check the idea and work through a concrete use of it. The questions move from checking the central idea to using it in an example and exploring its implications. Work through them in order, and return to a harder question after further reading if needed. Each problem has a hidden solution: select “Show solution” after attempting it. The responses to open-ended questions give a model argument; other sound examples and explanations may also work. Each chapter ends with a quick check, a worked problem, and an extension. Open hints one at a time. After checking a solution, try the problem again with different inputs. Explaining why a tempting answer fails is useful practice too.

Assumptions to keep visible

The core circuit model uses ideal gates and states. Query counts treat access to an oracle as a resource in its own right; they do not automatically include building that oracle. A claim about probabilities must identify the measurement. A claim about efficiency must identify input size, allowed error, and the resources counted.

Offline reading and printing

Download the complete offline book (ZIP). Extract the archive and open its index.html in a browser. Equations, figures, search, and experiments are included. External references and links to the main website need an internet connection.

Use “Print chapter” on any page, or your browser’s print command, to print or save a PDF. Hints, solutions, and optional explanations expand for printing. Interactive figures print their current state; the accompanying prediction and explanation also describe the result.

Reader controls and accessibility

Use Contents to move between topics, Search (or the / key) to find an idea, and A− or A+ to adjust the text. Tab moves through controls; Enter activates links and buttons. The glossary and expandable explanations also work without JavaScript. Equations have MathJax accessibility support and figures have text descriptions.

Your text size and last reading location are stored in this browser when local storage is available. They are not sent to a server. Private browsing and some browsers’ local-file settings may prevent persistence.

Sources and further reading

Original sources complement the explanations; they are not prerequisites.

• Turing, On Computable Numbers (1936) — the machine model and limits of decision procedures.
• The Feynman Lectures, Quantum Behavior — amplitudes and interference.
• Grover, A fast quantum mechanical algorithm for database search — quantum search.
• Barenco et al., Elementary gates for quantum computation — gate constructions.
• Beals et al., Quantum lower bounds by polynomials — an optional continuation of Chapter 10.