Your learning progress
You can study in order or follow a pathway. Mark a chapter complete after you can explain its main idea and work its example. Your progress stays in this browser.
Your progress is saved on this device. Choose the pace and depth that suit you.
Continue with F01→- ○F01 · Classical Computing versus Quantum ComputingCore
- ○F02 · Introduction to Quantum InformationCore
- ○F03 · Essential Mathematics: Complex NumbersCore
- ○F04 · Vectors, Matrices and Linear AlgebraCore
- ○F05 · Dirac Notation: Kets and BrasCore
- ○F06 · Probability, Amplitudes and NormalisationCore
- ○F07 · Understanding QubitsCore
- ○F08 · SuperpositionCore
- ○F09 · Quantum MeasurementCore
- ○F10 · Quantum Phase and InterferenceCore
- ○F11 · The Bloch SphereCore
- ○F12 · Multiple Qubits and Tensor ProductsCore
- ○F13 · Entanglement and Bell StatesCore
- ○F14 · Quantum Reversibility and the No-Cloning PrincipleCore
- ○F15 · Introduction to Quantum GatesCore
- ○F16 · Pauli Gates and the Hadamard GateCore
- ○F17 · Phase and Rotation GatesCore
- ○F18 · Controlled Gates and CNOTCore
- ○F19 · Constructing Quantum CircuitsCore
- ○F20 · Quantum Oracles and Phase KickbackCore
- ○F21 · Measuring and Simulating Quantum CircuitsCore
- ○F22 · Quantum Noise and Hardware LimitationsCore
- ○F23 · Classical versus Quantum Algorithmic ComplexityCore
- ○F24 · Quantum Queries and OraclesCore
- ○F25 · How Quantum Algorithms Use InterferenceCore
- ○F26 · First Complete Quantum AlgorithmCore
- ○P01 · Programming environments: Python, notebooks, SDK choicesCore
- ○P04 · Quantum circuits as code: qubits, registers and gatesCore
- ○P11 · Statevector and unitary verification techniquesUndergraduate
- ○P12 · Probabilistic assertions and confidence intervalsUndergraduate
- ○P13 · Property-based and metamorphic quantum testsUndergraduate
- ○P14 · Debugging quantum logic and circuit defectsUndergraduate
- ○P15 · Test-driven circuit development and mutation testingUndergraduate
- ○P17 · Compilation and transpilation fundamentalsUndergraduate
- ○P20 · Noise models, backend constraints and execution budgetsUndergraduate
- ○A01 · What Makes a Quantum Algorithm Different?Core
- ○A02 · Deutsch’s AlgorithmCore
- ○A03 · Deutsch–Jozsa AlgorithmCore
- ○A04 · Bernstein–Vazirani AlgorithmCore
- ○A05 · Simon’s AlgorithmUndergraduate
- ○A06 · Grover’s Search AlgorithmCore
- ○A07 · Amplitude AmplificationUndergraduate
- ○A08 · Quantum CountingUndergraduate
- ○A09 · Quantum Amplitude EstimationUndergraduate
- ○A10 · Quantum Walk AlgorithmsUndergraduate
- ○A11 · Quantum Fourier TransformUndergraduate
- ○A12 · Quantum Phase EstimationUndergraduate
- ○A13 · Order FindingUndergraduate
- ○A14 · Shor’s Factoring AlgorithmUndergraduate
- ○A15 · Hidden Subgroup ProblemsUndergraduate
- ○A16 · Introduction to Optimisation ProblemsCore
- ○A17 · QUBO and Ising ModelsUndergraduate
- ○A18 · Quantum Approximate Optimisation AlgorithmUndergraduate
- ○A19 · Variational Quantum EigensolverUndergraduate
- ○A20 · Quantum AnnealingUndergraduate
- ○A21 · Quantum Optimisation and Classical BaselinesCore
- ○A22 · Hamiltonian SimulationUndergraduate
- ○A23 · Trotter–Suzuki MethodsUndergraduate
- ○A24 · Linear Combination of UnitariesResearch
- ○A25 · QubitizationResearch
- ○A26 · HHL Quantum Linear Systems AlgorithmUndergraduate
- ○A27 · Block EncodingResearch
- ○A28 · Quantum Singular Value TransformationResearch
- ○A29 · Quantum Machine LearningUndergraduate
- ○A30 · Quantum KernelsUndergraduate
- ○A31 · Variational Quantum ClassifiersUndergraduate
- ○A32 · Quantum Sampling AlgorithmsUndergraduate
- ○A33 · Applications in Cryptography and SecurityCore
- ○A34 · Quantum Algorithms in Real-World OptimisationCore
- ○A35 · Quantum Advantage and ComplexityUndergraduate
- ○A36 · Noise and Resource EstimationUndergraduate
- ○A37 · Error Mitigation and Error CorrectionUndergraduate
- ○A38 · Fault-Tolerant Algorithm ConsiderationsResearch
- ○A39 · Quantum versus Classical BenchmarkingCore
- ○A40 · Open Research ChallengesResearch
- ○AA01 · Adiabatic quantum computation and algorithmic equivalencesResearch
- ○AA02 · Quantum minimum finding (Dürr–Høyer)Undergraduate
- ○AA03 · Amplitude estimation variants and modern iterative approachesUndergraduate
- ○AA04 · Quantum signal processing and polynomial transformationsResearch
- ○AA05 · Quantum eigenvalue transformation and spectral filteringResearch
- ○AA06 · Quantum singular value transformation applicationsResearch
- ○AA07 · Quantum linear-algebra improvements and input/output assumptionsResearch
- ○AA08 · Quantum principal components and spectral methodsResearch
- ○AA09 · Quantum recommendation and nearest-neighbour ideasResearch
- ○AA10 · Quantum gradient and derivative estimationResearch
- ○AA11 · Quantum approximate counting and mean estimationUndergraduate
- ○AA12 · Quantum Monte Carlo integration and risk estimationUndergraduate
- ○AA13 · Quantum Gibbs-state preparation and thermal samplingResearch
- ○AA14 · Quantum Metropolis methods and thermalisationResearch
- ○AA15 · Quantum walk search on graphs and spatial searchUndergraduate
- ○AA16 · Element distinctness and collision problemsUndergraduate
- ○AA17 · Quantum backtracking and tree-search methodsResearch
- ○AA18 · Formula evaluation and span-program viewpointsResearch
- ○AA19 · Quantum dynamic programming and graph problemsResearch
- ○AA20 · Quantum learning theory and sample complexityResearch
- ○AA21 · Quantum neural network models and barren plateausResearch
- ○AA22 · Quantum generative modelling and Born machinesUndergraduate
- ○AA23 · Quantum chemistry and electronic structure workflowsUndergraduate
- ○AA24 · Quantum PDE/ODE ideas and differential-equation algorithmsResearch
- ○AA25 · Quantum finance and stochastic modellingUndergraduate
- ○AA26 · Quantum methods for scientific optimisation and energy systemsUndergraduate
- ○AA27 · Query adversary and lower-bound techniquesResearch
- ○AA28 · Hamiltonian simulation algorithms beyond product formulasResearch
- ○AA29 · Precision, condition-number and fault-tolerance costsResearch
- ○AA30 · Dequantisation, quantum-inspired classical algorithms and honest baselinesUndergraduate
- ○T01 · Quantum teleportationCore
- ○T02 · Superdense codingCore
- ○T03 · The Hadamard testUndergraduate
- ○T04 · The swap testCore
- ○T05 · Quantum random-access memoryUndergraduate
- ○T06 · Classical shadowsUndergraduate
- ○T07 · Regev’s factoring algorithmResearch