Anyon Braiding and Logical Gates
Moving code excitations around one another and around code boundaries implements logical operations, the picture behind braiding and code deformation.
Gates from motion
In a topological code a logical operation can be realized by physically dragging anyonic excitations, or by moving the holes and boundaries that define encoded qubits. Because the outcome depends only on the topology of the paths, small imprecisions in the path do not change the gate. This geometric robustness is what makes braiding-based operations attractive.
Abelian limits
The toric code's anyons are abelian, meaning braiding multiplies the state by a phase rather than rotating within a degenerate space. Phases alone cannot generate a universal gate set, so pure braiding in the toric code yields only a limited group of logical operations. Practical surface-code machines therefore use code deformation and lattice surgery to move and merge logical qubits, and inject magic states to complete a universal set.
- Braiding two defects can implement a logical CNOT between the qubits they encode.
- Deforming boundaries moves logical operators without ever measuring the encoded data.
- The braiding result is invariant under continuous deformation of the worldlines.
- Non-Clifford gates still require magic-state injection because abelian braiding is Clifford at most.
The spacetime picture is powerful: worldlines of defects trace a braid in three dimensions (two space, one time), and the logical operation is a topological invariant of that braid. This viewpoint unifies braiding, code deformation, and lattice surgery as different ways of drawing the same kind of spacetime diagram.
Genuinely universal braiding would require non-abelian anyons such as Fibonacci anyons, which no simple stabilizer code hosts. Current fault-tolerant proposals stay with abelian codes and accept the extra cost of magic states.