Bad Qubits — Learn Quantum by Doing

Multiple choice

In topological quantum computation, why are gates implemented by braiding non-abelian anyons intrinsically protected from small errors?

The braid group B_n is finite, so only a fixed list of perfect gates exists
Each braid measures the anyons, projecting out any accumulated error
Braiding gates are continuously tunable, so any error can be smoothly corrected after the fact
The braid's unitary depends only on the topological class of the braid (its over/under crossing pattern), not on the speed, shape, or small wiggles of the worldlines, so there is no continuous parameter to mis-set