Planned
Quantum Algorithms
How quantum methods are structured, and when they might help. 44 planned courses across six levels.
All courses on this page are planned. Titles, order and durations may change before launch.
Beginner 4 planned
- QQ-301How Quantum Algorithms Work
Read an algorithm as a sequence of state preparation, transformations and measurements designed around a problem.Beginner Planned - QQ-302Deutsch-Jozsa Algorithm
Trace the decision rule and oracle assumptions in a small Deutsch, Jozsa example.Beginner Planned - QQ-303Bernstein-Vazirani Algorithm
Connect the hidden bit string to the measurement pattern in a Bernstein, Vazirani circuit.Beginner Planned - QQ-325Algorithm Inputs, Outputs and Cost Assumptions
Separate problem size, input preparation and output readout in a proposed algorithm.Beginner Planned
Intermediate 16 planned
- QQ-304Simon's Algorithm
Explain how measured linear constraints reveal the hidden period in Simon's algorithm.Intermediate Planned - QQ-305Quantum Fourier Transform (QFT)
Trace the phase relationships produced by a small quantum Fourier transform.Intermediate Planned - QQ-306Phase Estimation
Explain how phase kickback and a measurement register recover an eigenphase to finite precision.Intermediate Planned - QQ-308Grover's Search Algorithm
Explain Grover iterations using the marked-state oracle and the geometry of amplitude amplification.Intermediate Planned - QQ-309Grover in Code: Qiskit Implementation
Implement a small search oracle in Qiskit and compare measured success rates across iteration counts.Intermediate Planned - QQ-310Amplitude Amplification
Describe how an alternating pair of reflections increases the weight of a target subspace.Intermediate Planned - QQ-313Quantum Walks
Compare classical and quantum walks using how probability spreads across a small graph.Intermediate Planned - QQ-314Hamiltonian Simulation Basics
Translate a small Hamiltonian into a quantum evolution task and identify approximation error.Intermediate Planned - QQ-315VQE: Variational Quantum Eigensolver
Explain the role of an ansatz, observable measurements and a classical optimiser in VQE.Intermediate Planned - QQ-317QAOA: Quantum Approximate Optimisation
Connect an optimisation objective and mixer to the layers of a QAOA circuit.Intermediate Planned - QQ-318QAOA in Code: Max-Cut Example
Encode Max-Cut on a small graph and interpret QAOA outputs against the graph's known solutions.Intermediate Planned - QQ-319Quantum Annealing vs Gate-Based
Compare how annealing and gate-based systems express objectives, constraints and candidate solutions.Intermediate Planned - QQ-320Choosing the Right Algorithm for the Problem
Select candidate quantum algorithms based on input structure, assumptions and output requirements.Intermediate Planned - QQ-324Algorithms Portfolio & Next Steps
Document algorithm choices, baselines, experiments and unresolved questions in a portfolio entry.Intermediate Planned - QQ-326Oracles, Ancillas and Uncomputation
Translate a small Boolean predicate into a reversible oracle and account for workspace cleanup.Intermediate Planned - QQ-327Phase Kickback as an Algorithm Primitive
Use an eigenstate example to trace how a controlled operation transfers phase to a control qubit.Intermediate Planned
Advanced 15 planned
- QQ-307Shor's Algorithm: Factoring, Honestly Explained
Connect factoring to period finding and distinguish small demonstrations from large-scale resource demands.Advanced Planned - QQ-311Quantum Counting
Recover an estimate of the number of marked inputs by relating a Grover operator's phase to a count.Advanced Planned - QQ-312HHL Algorithm: Linear Systems
Identify the assumptions, output encoding and practical caveats of the HHL linear-systems algorithm.Advanced Planned - QQ-316VQE in Code: Chemistry Example
Implement a small molecular energy calculation and compare the variational result with a reference estimate.Advanced Planned - QQ-321Algorithm Complexity: Speedups, Real and Claimed
Interpret query, circuit and end-to-end complexity claims and identify costs that an asymptotic comparison may omit.Advanced Planned - QQ-322Implementing Algorithms on NISQ Hardware
Adapt an algorithm experiment to limited qubit count, connectivity, sampling and noise.Advanced Planned - QQ-323Algorithms Capstone: Solve a Real Optimisation Problem
Translate a bounded optimisation problem into an experiment with a defensible classical benchmark.Advanced Planned - QQ-328Amplitude Estimation for Sampling Problems
Connect amplitude estimation to expectation-value problems and compare circuit costs with classical sampling.Advanced Planned - QQ-329Variational Ansatz Design
Compare ansatz families by parameter count, symmetry and hardware implications for a structured objective.Advanced Planned - QQ-330Hamiltonian Product Formulas and Error Bounds
Compare product-formula choices for a small Hamiltonian and examine how step size changes resource demands.Advanced Planned - QQ-331Mapping Fermions to Qubits
Compare common mappings for a small fermionic problem and interpret the resulting Pauli terms.Advanced Planned - QQ-332Grouping Observables to Reduce Measurements
Choose measurement groups for a Hamiltonian and quantify the scheduling and sampling trade-offs.Advanced Planned - QQ-333Constrained Optimisation and Feasible Mixers
Compare penalty formulations and mixers that preserve feasibility for a small optimisation problem.Advanced Planned - QQ-334Quantum Monte Carlo and Quantum Amplitude Estimation
Distinguish classical quantum Monte Carlo simulation from amplitude-estimation algorithms that use quantum circuits.Advanced Planned - QQ-335Classical Baselines for Quantum Optimisation
Specify comparison instances, solver settings and evaluation endpoints for fair optimisation benchmarking.Advanced Planned
Expert 5 planned
- QQ-336Block Encodings as Algorithm Interfaces
Interpret normalisation, embedded operators and ancilla requirements in a simple block encoding.Expert Planned - QQ-337Quantum Signal Processing
Explain how a sequence of phases transforms eigenvalues and read a small polynomial approximation.Expert Planned - QQ-338Resource Accounting for Quantum Algorithms
Translate an algorithm's circuit assumptions into logical qubits, gate counts and repeated-run requirements.Expert Planned - QQ-339Measurement-Based Quantum Computing
Explain how measurement choices and feed-forward determine computation on a prepared graph state.Expert Planned - QQ-340Quantum Search with Multiple Solutions
Compare search schedules when the number of marked items is known, estimated or unknown.Expert Planned
Specialist 4 planned
- QQ-341Quantum Singular Value Transformation
Connect block-encoded matrices with polynomial transformations and evaluate the assumptions of a worked application.Specialist Planned - QQ-342Fault-Tolerant Simulation for Chemistry
Read a resource estimate for molecular simulation and identify dependencies on precision, representation and hardware assumptions.Specialist Planned - QQ-343Quantum Algorithm Lower Bounds
Interpret a lower-bound argument in a stated query model and identify the scope of its conclusion.Specialist Planned - QQ-344Quantum Algorithms for Differential Equations
Compare approaches to encoding solution states and assess data preparation, precision and readout costs.Specialist Planned