The algorithms course. Hidden subgroup problems, quantum walks, Hamiltonian simulation and query complexity, all treated properly. Dense, and worth every hour.
Hamiltonian simulation
Simulating the time evolution of a quantum system — Feynman's original motivation — via Trotter-Suzuki product formulas, linear combination of unitaries, or qubitization.
Why it matters
It is the application with the clearest theoretical case for exponential advantage, and it drives quantum chemistry and materials science, the most credible commercial targets.
After this you will be able to
- Derive and bound Trotter error
- Compare LCU and qubitization approaches
- Estimate resources for a chemistry Hamiltonian
2 best places to start
Hand-picked and ordered. If you only have time for one, take the first.
A thorough review of the most commercially plausible application: mapping electronic structure onto qubits, and the algorithms that then extract energies.
5 more resources
The library for compiling fermionic and electronic-structure problems into qubit Hamiltonians. Where quantum chemistry meets quantum circuits in practice.
Several hundred runnable, paper-linked notebooks on variational algorithms, quantum chemistry and QML. The closest thing the field has to a "reproduce this result" library.
HHL, the source of most "exponential speedup for machine learning" claims. The caveats — state preparation, condition number, readout — matter more than the theorem, and are all in the paper.
A comprehensive catalogue of every known quantum algorithm with its speedup and primary references. The definitive answer to "has anyone found a quantum algorithm for X?"
A thorough, notebook-based curriculum built on the fast Qulacs simulator, strongest on quantum chemistry and variational methods. Under-known outside Japan and better than most English equivalents.
This unlocks
Topics that list Hamiltonian simulation as a prerequisite.