A modular functor which is universal for quantum computation
arXiv:quant-ph/0001108
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.
Cited by in corpus (35)
- The Physical Implementation of Quantum Computation
- Quantum algorithms: an overview
- Computational capacity of the universe
- Quantum computation with Turaev-Viro codes
- The BQP-hardness of approximating the Jones Polynomial
- A hierarchy of topological tensor network states
- Topological Qubit Design and Leakage
- Spin network quantum simulator
- Protected gates for topological quantum field theories
- Graph isomorphism and Gaussian boson sampling
- Topological and symmetry broken phases of Z_N parafermions in one dimension
- Quantum Knots
- Topological Features in Ion Trap Holonomic Computation
- Instantaneous braids and Dehn twists in topologically ordered states
- Catalogue of Andreev spectra and Josephson effects in structures with time-reversal-invariant topological superconductor wires
- Scrambling via Braiding of Nonabelions
- Spin Networks and Anyonic Topological Computing
- Braid Matrices and Quantum Gates for Ising Anyons Topological Quantum Computation
- Vortex Loops and Majoranas
- Non-Abelian statistics with mixed-boundary punctures on the toric code
- Low-dimensional representations of the three component loop braid group
- Anyons in Geometric Models of Matter
- Fast quantum algorithms for approximating some irreducible representations of groups
- Non-Abelian Fusion Rules from an Abelian System
- Deterministic quantum one-time pad via Fibonacci anyons
- Defects and degeneracies in supersymmetry protected phases
- Charged particle in a flat box with static electromagnetic field and Landau's levels
- On Topological Quantum Computing With Mapping Class Group Representations
- Exact analytical solution of a time-reversal-invariant topological superconducting wire
- Sumcheck-based delegation of quantum computing to rational server
- On the extension of stringlike localised sectors in 2+1 dimensions
- Braiding properties of paired spin-singlet and non-abelian hierarchy states
- Elementary Particles as Gates for Universal Quantum Computation
- Computational complexity and 3-manifolds and zombies
- Representations of the loop braid groups from braided tensor categories