Topological quantum computing

Topological quantum computing exploits the exchange statistics of anyons, which are quasiparticles that exist in two-dimensional systems. In contrast to fermions and bosons, exchanging two anyons can multiply the wavefunction by a complex phase that depends on the path taken, a property known as non-Abelian statistics when the phase is a matrix.² The computational space is the degenerate ground state manifold of a topological phase, and quantum gates are implemented by braiding anyons — moving them around each other in a specific sequence. This process is inherently fault-tolerant because local perturbations cannot distinguish topologically distinct braids, and the information is stored non-locally in the system's topology.

Experimental realizations of topological quantum computing are still in their infancy. The most promising platforms include the fractional quantum Hall effect at filling factor ν = 5/2, where non-Abelian anyons (Ising anyons) are predicted to exist.³ Another approach uses Majorana fermions in semiconductor nanowires coupled to superconductors, where the zero-energy bound states can be used as topological qubits.⁴ Recent experiments have reported signatures of Majorana modes, but definitive proof of non-Abelian statistics and braiding remains elusive. Other systems, such as cold atoms in optical lattices and frustrated magnets, are also being explored to engineer topological order.

Topological protection offers a natural solution to the decoherence problem that plagues conventional quantum computers. Because the quantum information is encoded in the global topology of the many-body system, it is immune to local errors caused by thermal fluctuations or material imperfections. However, this protection comes at a cost: manipulating the anyons requires precise control over braiding operations, which are difficult to realize experimentally. Moreover, to perform universal quantum computation, one must supplement braiding (which alone can only implement a subset of gates) with additional operations such as magic state distillation or measurement-based techniques.⁵

Beyond the mainstream narrative, topological quantum computing has deep roots in topological quantum field theory (TQFT), which provides the mathematical framework for braiding statistics. The celebrated Kitaev toric code, a simple spin model, was the first explicit proposal for a topological quantum memory and remains a benchmark for fault-tolerant schemes.¹ Less well-known is the connection to quantum error correction: topological codes like the surface code are directly inspired by topological phases. Another niche aspect is the possibility of using Fibonacci anyons, which are universal for quantum computation through braiding alone, avoiding the need for supplementary gates. Research on topological quantum computing also intersects with high-energy physics, where anyon-like excitations appear in Chern-Simons theory.

Anyon

A quasiparticle that emerges in two-dimensional systems, with exchange statistics intermediate between fermions and bosons.

Non-Abelian statistics

A property of some anyons where exchanging them yields a non-commuting unitary matrix, enabling quantum computation.

Topological protection

The immunity of quantum information to local errors due to its encoding in global topological properties.

Kitaev toric code

A theoretical model of a topological quantum memory on a torus, demonstrating the principle of fault-tolerant storage.