Crash Course
Learn about quantum computing.
These pages are arranged by what they build on, not by any order you have to follow. Each one lists what to read first, so you can start at the top or jump straight to a topic and work backwards from there.
Start here · no prerequisites
Deutsch-Jozsa, Simon's AlgorithmsThe first algorithms that beat every possible classical approach.RequiresControlled Gates, Entanglement, Bell StatesPseudo-Telepathy, Superdense Coding, TeleportationProtocols that use entanglement to do things classical communication cannot.RequiresControlled Gates, Entanglement, Bell StatesToffoli Gate, UniversalityThree-qubit gates and what it means for a gate set to be universal.RequiresControlled Gates, Entanglement, Bell States
Bernstein-Vazirani Algorithm, Intro to ClassiqAnother oracular algorithm, and a higher-level way to describe quantum circuits.RequiresDeutsch-Jozsa, Simon's AlgorithmsCHSH GameA game that quantum strategies win more often than any classical strategy can.RequiresPseudo-Telepathy, Superdense Coding, TeleportationGrover's AlgorithmSearching an unstructured space quadratically faster than any classical search.RequiresDeutsch-Jozsa, Simon's Algorithms
Iterative Quantum Phase EstimationPhase estimation rewritten to use far fewer qubits.RequiresQuantum Fourier Transform, Phase EstimationShor's AlgorithmFactoring large integers efficiently, and what that means for encryption.RequiresQuantum Fourier Transform, Phase EstimationVariational Quantum EigensolverFinding the minimum eigenvalue of a Hamiltonian with a hybrid algorithm.RequiresQuantum Fourier Transform, Phase Estimation