This section focuses on algorithmic constructions that exploit superposition, interference, and entanglement.
Use the sequence below as the local map for this section. The material is grouped so that algorithmic speedups stay tied to the structures that make them possible.
Sequence
- 01. Algorithmic Primitives
- 02. Reversible Computation on a QC
- 03. Early Quantum Algorithms
- 04. The Quantum Fourier Transform
- 05. Phase Estimation
- 06. Shor’s Algorithm
- 07. Grover Search and Amplitude Amplification
- 08. Quantum Simulation
- 09. Quantum Walks
- 10. Variational and NISQ Algorithms
- 11. The Hidden Subgroup Problem
- 12. Why Lattice Problems Resist Quantum Attack