Recognition: unknown
A modular functor which is universal for quantum computation
read the original abstract
We show that the topological modular functor from Witten-Chern-Simons theory is universal for quantum computation in the sense a quantum circuit computation can be efficiently approximated by an intertwining action of a braid on the functor's state space. A computational model based on Chern-Simons theory at a fifth root of unity is defined and shown to be polynomially equivalent to the quantum circuit model. The chief technical advance: the density of the irreducible sectors of the Jones representation, have topological implications which will be considered elsewhere.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 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.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.