A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Topological Quantum Computing

Research Depth 162 in the knowledge graph ☐ I know this ☆ Set as goal
1,119prerequisites beneath it
See this on the map →
Quantum Error Correction BasicsQuantum Gates+1 more→
topological anyon braiding Majorana-fermion non-abelian

Core Idea

Topological quantum computing encodes quantum information in the global topological properties of exotic quasiparticles called non-abelian anyons, rather than in local properties of physical qubits. Quantum gates are performed by braiding anyons — exchanging their positions in spacetime along specified paths. Because the computation depends only on the topology of the braids (which paths cross over which) and not on exact positions or timing, it is inherently protected against local perturbations and noise. This topological protection provides fault tolerance at the physical level, potentially eliminating or greatly reducing the need for active quantum error correction.

Explainer

Standard quantum computing faces a persistent enemy: noise. Qubits decohere, gates have errors, and even the error-correction machinery introduces errors. Topological quantum computing proposes a radical solution: encode information in a form that is physically immune to local noise, so that error correction is built into the physics itself rather than layered on top as an engineering protocol.

The key insight comes from the theory of anyons — quasiparticle excitations that exist in certain 2D quantum systems. In three spatial dimensions, particle exchange statistics are limited to bosons (+1 phase) and fermions (-1 phase). In two dimensions, richer possibilities exist: exchanging particles can produce any phase (abelian anyons) or, more exotically, can apply a unitary transformation to a degenerate ground-state manifold (non-abelian anyons). For non-abelian anyons, the ground-state degeneracy of a system with 2n anyons grows exponentially with n, providing the Hilbert space for quantum computation. Crucially, this degeneracy depends only on the number and type of anyons, not on their positions — it is a topological property.

Braiding is the mechanism for performing gates. Moving one anyon around another traces out a path in spacetime; the outcome depends only on the topology of this path — whether it encircles the other anyon or not — not on the exact trajectory, speed, or timing. Two braids that can be continuously deformed into each other produce identical transformations. This means small perturbations (noise, vibrations, imprecise control) that do not change the braid topology have zero effect on the computation. The error rate is exponentially suppressed in the physical separation between anyons: an error would require moving an anyon across a macroscopic distance to change the topology.

The leading experimental candidates for non-abelian anyons are Majorana zero modes in topological superconductors, which behave as Ising-type anyons. Microsoft has invested heavily in this approach, though creating and manipulating Majorana modes remains experimentally challenging. Ising anyons alone do not provide universal quantum computation through braiding — they generate only the Clifford group. Universality requires either finding a system with Fibonacci anyons (which do support universal computation via braiding alone, but are harder to realize) or supplementing Ising braiding with non-topological operations like T-gate magic state injection. Even in the latter case, the topological protection still dramatically reduces the error rate for most operations, potentially reducing the overhead of error correction by orders of magnitude compared to fully non-topological approaches.

Practice Questions 3 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Double Integrals: Definition and Setup → Iterated Integrals and Fubini's Theorem → Double Integrals over Rectangular Regions → Double Integrals over General Regions → Applications of Double Integrals: Area, Mass, and Moments → Triple Integrals in Cartesian Coordinates → Triple Integrals in Cylindrical and Spherical Coordinates → Change of Variables and the Jacobian Determinant → Applications of Triple Integrals: Volume and Mass → Vector Fields and Their Representations → Line Integrals of Vector Fields → Work and Circulation → Line Integrals of Scalar and Vector Functions → Fundamental Theorem for Line Integrals → Conservative Vector Fields → Conservative Vector Fields and Potential Functions → Curl and Divergence of Vector Fields → Curl and Divergence → Divergence Theorem → Electric Flux and Divergence Theorem → Gauss's Law: Integral Form and Meaning → Solving Problems with Gauss's Law → Conductors in Electrostatic Equilibrium → Capacitance and Capacitors → Dielectrics → Dielectric Constant and Relative Permittivity → Electric Field Inside Dielectric Materials → Dielectric Materials and Polarization → Dielectric Susceptibility and Permittivity → Energy Density in Electric Fields → Electric Current and Current Density → Electrical Resistance and Resistivity → Ohm's Law and Circuit Elements → Electromotive Force (EMF) and Batteries → Kirchhoff's Circuit Laws: Voltage and Current → DC Circuit Network Analysis Methods → Transient Response in RC Circuits → RC Circuits → LC and RLC Circuits → AC Circuits: Fundamentals → Impedance and Reactance → AC Power and Resonance → Electromagnetic Waves → Postulates of Special Relativity → Time Dilation → Length Contraction → Lorentz Transformation → Relativistic Velocity Addition → Relativistic Momentum and Energy → Mass-Energy Equivalence and E=mc² → Photons as Particles with Energy and Momentum → Planck-Einstein Relation: Energy and Frequency → Photoelectric Effect → The Photon: Light as Quanta → Compton Scattering → Wave-Particle Duality → de Broglie Wavelength → The Schrödinger Equation → State Vectors and Wavefunctions → Quantum Superposition → Quantum Entanglement → Bell Theorem and Bell Inequalities → Postulates of Quantum Mechanics → Observables and Quantum Operators → Commutators and Commutation Relations → Quantum Angular Momentum → Quantum Mechanical Treatment of Hydrogen → Solving the Schrödinger Equation for Hydrogen Atom → Quantum Numbers → Spin-1/2 Systems → Pauli Matrices → Quantum Gates → Quantum Circuits → Quantum Error Correction Basics → Stabilizer Codes → Quantum Error Correction with Surface Codes → Fault-Tolerant Quantum Computation → Topological Quantum Computing

Longest path: 163 steps · 1119 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.