Learning quantum algorithms

A quantum algorithm is a carefully designed way to turn a question into a measurable result. This volume builds the mechanism with small examples before discussing general formulas and costs. Start with the question, follow the amplitudes, then check what the answer actually tells you.

Begin with the ideas

Use qubits, measurement, phase and interference and circuits as your starting toolkit. The complex-number and matrix bridges explain the notation when you need it. Work on paper alongside the diagrams; a surprising minus sign is often the important part of the algorithm.

Read each chapter twice if helpful. On the first pass, follow the plain-language question, diagram and numerical example. On the second, work through the correctness argument, assumptions and exercises. Try an exercise before opening its answer. The advanced chapters introduce additional mathematical tools and should be studied after the earlier mechanisms feel familiar.

A first sequence

1. What makes a quantum algorithm different? establishes a clear input and output contract.
2. Deutsch, Deutsch–Jozsa and Bernstein–Vazirani turn simple phase patterns into useful labels.
3. Simon combines quantum samples with classical equations.
4. Grover and amplitude amplification show how reflections increase a useful probability.
5. QFT, phase estimation, order finding and Shor connect phase patterns to number theory.

Choose an application direction

For optimisation, begin with problem modelling and QUBO/Ising encodings, then compare QAOA, VQE and annealing. Always verify candidate solutions against the original problem.

For physics and linear algebra, study Hamiltonian simulation before product formulas, LCU, qubitization and QSVT. The linear-systems chapter explains why preparing a solution state differs from printing a solution vector.

For data-driven methods, compare quantum machine learning, kernels, variational classifiers and sampling. State preparation, training data, measurement and the classical comparison all belong in the analysis.

Check the full claim

The final chapters examine advantage and complexity, resources, error handling, fault tolerance and benchmarking. A query theorem, a small simulation and a useful hardware result are different achievements. Every chapter states what its model establishes and what additional work an application requires.

Explore the algorithm atlas for further families, modern variants and connections. The chapter catalogue lists every chapter in this volume, and the experiment studio supplies small ideal models for selected mechanisms.