The algorithms course. Hidden subgroup problems, quantum walks, Hamiltonian simulation and query complexity, all treated properly. Dense, and worth every hour.
Quantum Fourier transform
The discrete Fourier transform applied to amplitudes, implementable in O(n^2) gates on n qubits — exponentially fewer operations than the classical FFT needs on 2^n numbers.
Why it matters
The QFT is the engine of the exponential-speedup family: phase estimation, order finding and Shor all reduce to it. Note that you cannot read the transformed amplitudes out — you have to be clever about what you measure.
After this you will be able to
- Write down the QFT circuit for n qubits
- Explain why the exponential gate saving does not immediately give an exponential speedup
- Connect the QFT to period finding
3 best places to start
Hand-picked and ordered. If you only have time for one, take the first.
Free, self-contained and rigorous, with exercises. Widely used as the standard course text in Europe and the best single free replacement for a paid textbook.
Universally called "Mike & Ike" and still the field's reference text after two decades. Comprehensive rather than gentle — use it as the book you look things up in, not the one you read cover to cover first.
2 more resources
The paper that created the field as a funded discipline. Read it after you understand phase estimation — it is more approachable than its reputation suggests.
The legendary original Qiskit Textbook, now archived in favour of IBM Quantum Learning. The notebooks still run and its algorithm chapters remain some of the clearest explanations written.
This unlocks
Topics that list Quantum Fourier transform as a prerequisite.