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.
Advanced
You are comfortable with the math and want to work in the field. This level covers quantum error correction, fault tolerance, complexity theory, Hamiltonian simulation and the variational algorithms that dominate current research — and points you at the primary literature.
By the end of this level
Read quant-ph papers without drowning, and contribute to research or a quantum software stack.
14 topics, roughly in order
Work down the list. Each topic page lists its own prerequisites, so if something assumes knowledge you do not have, the link back is right there.
Quantum error correction
Encoding one logical qubit across many physical qubits so that errors can be detected and corrected by measuring stabilisers — without ever measuring, and thus destroying, the logical state.
11 resources · AdvancedSurface codes
A two-dimensional topological code needing only nearest-neighbour connectivity, with a relatively forgiving error threshold near 1% — the leading candidate for real fault-tolerant hardware.
5 resources · AdvancedFault tolerance & the threshold theorem
The result that if physical error rates are below a threshold, arbitrarily long quantum computations become possible with only polylogarithmic overhead — plus the machinery (transversal gates, magic-state distillation) that gets you there.
5 resources · AdvancedError mitigation
Post-processing techniques — zero-noise extrapolation, probabilistic error cancellation, readout correction — that recover accurate expectation values from noisy hardware without full error correction, at the cost of extra shots.
3 resources · AdvancedQuantum complexity theory
The study of what quantum computers can and cannot do efficiently: the class BQP, its relationship to P, NP and PSPACE, the quantum analogue QMA, and the oracle separations that justify the field.
5 resources · AdvancedHamiltonian simulation
Simulating the time evolution of a quantum system — Feynman's original motivation — via Trotter-Suzuki product formulas, linear combination of unitaries, or qubitization.
7 resources · AdvancedVariational algorithms (VQE & QAOA)
Hybrid loops where a shallow parameterised quantum circuit produces expectation values and a classical optimiser tunes the parameters — the dominant paradigm for near-term hardware.
9 resources · AdvancedQuantum machine learning
Using quantum circuits as trainable models or kernels — plus the sober literature on data loading bottlenecks and classical "dequantization" results that erase many claimed speedups.
5 resources · AdvancedHardware modalities
The competing physical platforms — superconducting transmons, trapped ions, neutral atoms, photonics, spin qubits — each with different gate speeds, fidelities, connectivity and scaling problems.
15 resources · AdvancedQuantum advantage & benchmarking
Experiments claiming a quantum computer did something no classical computer feasibly can — random circuit sampling, boson sampling — and the classical simulation efforts that keep pushing back.
8 resources · AdvancedPost-quantum cryptography
Classical cryptography designed to resist quantum attack — the NIST-standardised lattice and hash-based schemes now being deployed, entirely separate from QKD.
4 resources · AdvancedQuantum information theory
The rigorous framework beyond pure states and unitaries: density matrices, quantum channels, POVMs, entropy, distance measures and channel capacities.
7 resources · AdvancedCompilation & transpilation
Turning an abstract circuit into one a specific device can execute: decomposing into native gates, mapping logical to physical qubits, and inserting SWAPs to satisfy connectivity — while minimising depth.
4 resources · AdvancedResearch & careers
How to move from learning to contributing: where papers appear, which open-source projects take contributions, and which mentorship and internship programmes exist.
13 resources · Advanced37 resources
The full set written for advanced learners, across every topic. Mark things done as you go — it is stored in this browser only.
A retargetable quantum compiler with genuinely strong optimisation and routing passes, usable from Python via pytket. The best place to study production-grade circuit compilation.
The algorithms course. Hidden subgroup problems, quantum walks, Hamiltonian simulation and query complexity, all treated properly. Dense, and worth every hour.
Preskill's notes have taught much of the field. Chapter 10 on quantum error correction is, for many researchers, the definitive introduction to the subject.
The mathematically complete treatment of channels, entropies, distance measures and semidefinite programming duality. Free PDF, and the reference when you need a theorem stated exactly right.
The standard graduate text on quantum information theory, building from classical Shannon theory to quantum channel capacities. Free on arXiv, and unusually readable for the depth it reaches.
The clearest short introduction to the stabiliser formalism, written by the person who invented it. Read this before attempting the surface code literature.
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 cross-referenced encyclopedia of classical and quantum error-correcting codes, each with properties, decoders and references. Indispensable once you are past the textbook codes.
Definitions and known relationships for hundreds of complexity classes, BQP and QMA among them. The place to check what is actually proven versus merely believed.
The standard reference on surface codes, written as a tutorial rather than a terse paper. Where every industrial fault-tolerance roadmap ultimately points.
The resource-estimate paper everyone cites when asked "when will RSA break?". A masterclass in turning an asymptotic algorithm into concrete hardware requirements.
The Sycamore experiment. Read it alongside the classical simulation rebuttals that followed — the argument about what it proved is more instructive than the result itself.
The first convincing demonstration that adding more physical qubits made the logical qubit better rather than worse. Arguably the most important experimental result of the decade so far.
The original QAOA paper, and short. It launched an enormous literature on near-term optimisation, most of which is still arguing about whether the speedup exists.
The definitive review of the NISQ-era workhorse: ansatz design, optimisers, barren plateaus and applications, with the open problems stated clearly.
The review that defined the QML research programme. Read it critically and pair it with the dequantization literature, which has since removed several of its headline speedups.
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 thorough review of the most commercially plausible application: mapping electronic structure onto qubits, and the algorithms that then extract energies.
The comprehensive review of mitigation techniques and, crucially, their sampling overheads — the honest accounting of what mitigation costs you in shots.
Defines quantum volume, the single-number benchmark you see in every vendor announcement. Understanding its definition tells you exactly what those announcements do and do not claim.
How transmons actually work, from Josephson junctions through control electronics to readout. The reference for anyone whose algorithms run on IBM, Google or Rigetti hardware.
The counterpart review for trapped ions — the platform with the best gate fidelities and all-to-all connectivity, and the hardest scaling problem.
Simulates million-qubit stabiliser circuits in seconds, which is what makes modern error-correction research computationally possible. The tutorial notebooks double as a surface-code course.
The standard fast decoder for surface codes, and the natural companion to Stim. Together they let you run realistic threshold simulations on a laptop.
Zero-noise extrapolation, probabilistic error cancellation and more, wrapping whichever SDK you already use. The docs are the best practical tutorial on mitigation anywhere.
The library for compiling fermionic and electronic-structure problems into qubit Hamiltonians. Where quantum chemistry meets quantum circuits in practice.
Hybrid quantum-classical models built as Keras layers, for people who already know TensorFlow. The tutorials are the fastest route from ML experience into QML.
Photonic and continuous-variable quantum computing, a genuinely different model from the qubit circuits everything else here teaches. Worth a detour to see the alternative.
The official home of the standardised quantum-resistant algorithms. This is what organisations are actually migrating to — and it is classical cryptography, not QKD.
Working open-source implementations of post-quantum algorithms plus TLS integrations, so you can actually run a quantum-resistant handshake rather than just read about one.
A free, competitive programme pairing you with a working researcher for a real three-month project. One of the most effective routes into the field without a physics PhD.
A non-profit funding open-source quantum software through microgrants, and running unitaryHACK. A genuine on-ramp to paid contribution work.
Where essentially every quantum result appears first, months before journal publication. High volume — pair it with an alert on specific authors or keywords rather than reading the daily list.
A respected open-access, community-run journal. Everything is free to read, which makes it the most practical peer-reviewed venue to follow if you lack university access.
The APS open-access journal for high-impact quantum information results. A good curated filter over the arXiv firehose when you want the results that mattered.
Nature’s open-access quantum information journal, strong on experimental hardware and error correction results.