Q11 · Frontier
A 29-module path through q11 · frontier, in study order from foundations to the frontier.
Modules
- Measurement-Based Quantum Computation
- Cluster States and Graph States
- One-Way Quantum Computer
- Measurement Calculus and Pattern Compilation
- Flow and Gflow Conditions
- Topological Quantum Computation
- Anyons and Fractional Statistics
- Non-Abelian Braiding and Fusion Rules
- Fibonacci and Ising Anyons
- Toric Code and Topological Order
- Majorana Zero Modes
- Magic State Distillation
- The Cost of Magic and Magic Resource Theory
- Lattice Surgery and Defect Braiding
- Fault-Tolerant Architecture Design
- Distributed Quantum Computing
- Quantum Networks and Entanglement Distribution
- Quantum Repeaters
- Quantum Advantage and Supremacy Experiments
- Random Circuit Sampling
- Boson Sampling
- Quantum-Classical Hybrid Algorithms
- Variational Quantum Eigensolver
- Quantum Approximate Optimization Algorithm
- Barren Plateaus in Variational Landscapes
- Continuous-Variable Quantum Computing
- Gaussian States, Operations and the Non-Gaussian Resource
- GKP Codes and Bosonic Error Correction
- Continuous-Variable Cluster States