Topological Quantum Computation
read the original abstract
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liquids and 2D-magnets are modeled by modular functors, opening a new possibility for the realization of quantum computers. The chief advantage of anyonic computation would be physical error correction: An error rate scaling like $e^{-\a\l}$, where $\l$ is a length scale, and $\alpha$ is some positive constant. In contrast, the $\q$presumptive" qubit-model of quantum computation, which repairs errors combinatorically, requires a fantastically low initial error rate (about $10^{-4}$) before computation can be stabilized.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Parameterized Families of Toric Code Phase: $em$-duality family and higher-order anyon pumping
Parameterized families of toric code Hamiltonians realize em-duality pumping and higher-order anyon pumping, diagnosed by topological pumping into tensor-network bond spaces and corner modes.
-
Engineering of Anyons on M5-Probes via Flux Quantization
Flux quantization of the M5-brane tensor field in twisted Cohomotopy yields Pontrjagin homology observables that reproduce abelian Chern-Simons theory and braid actions on defect anyons.
-
Magic and Non-Clifford Gates in Topological Quantum Field Theory
Non-Clifford gates including Ising, Toffoli, and T arise as exact path integrals in Chern-Simons and Dijkgraaf-Witten topological quantum field theories.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.