Simulation of Topological Field Theories¶by Quantum Computers

  title={Simulation of Topological Field Theories¶by Quantum Computers},
  author={Michael H. Freedman and Alexei Y. Kitaev and Zhenghan Wang},
  journal={Communications in Mathematical Physics},
Abstract: Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering, the most abstract reaches of theoretical physics has spawned “topological models” having a finite dimensional internal state space with no natural tensor product structure and in which the evolution of the state is discrete, H≡ 0. These are called… Expand

Figures from this paper

Unitary R-matrices for topological quantum computing
The main problem with current approaches to quantum computing is the difficulty of establishing and maintaining entanglement. A Topological Quantum Computer (TQC) aims to overcome this by usingExpand
Topological Quantum Computation and Protected Gates
This thesis serves to give a mathematical overview of topological quantum computation and to apply the theory to characterize desirable fault-tolerant operations called protected gates. TopologicalExpand
Topological Quantum Computation
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 poly-Expand
v 1 4 J an 2 00 1 Topological Quantum Computation
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 JonesExpand
Towards topological quantum computer
Abstract Quantum R-matrices, the entangling deformations of non-entangling (classical) permutations, provide a distinguished basis in the space of unitary evolutions and, consequently, a naturalExpand
Efficient quantum processing of three–manifold topological invariants
A quantum algorithm for approximating efficiently three–manifold topological invariants in the framework of SU(2) Chern–Simons–Witten (CSW) topological quantum field theory at finite values of theExpand
Topological View on Entanglement and Complexity
Topological Quantum Field Theories are examples of quantum field theories with a discrete and even finite-dimensional Hilbert space. In this respect they are an intermediate step between quantumExpand
Circuit Complexity in Topological Quantum Field Theory
Quantum circuit complexity has played a central role in recent advances in holography and many-body physics. Within quantum field theory, it has typically been studied in a Lorentzian (real-time)Expand
Introduction to topological quantum computation with non-Abelian anyons
This work aims to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Expand
Computing Spin networks
Abstract We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamicalExpand


A Modular Functor Which is Universal¶for Quantum Computation
Abstract:We show that the topological modular functor from Witten–Chern–Simons theory is universal for quantum computation in the sense that a quantum circuit computation can be efficientlyExpand
Topological Quantum Computation
The connection between fault-tolerant quantum computation and nonabelian quantum statistics in two spatial dimensions is explored and it is shown that if information is encoded in pairs of quasiparticles, then the Aharonov-Bohm interactions can be adequate for universal fault-Tolerance quantum computation. Expand
P/NP, and the quantum field computer
  • M. Freedman
  • Computer Science, Medicine
  • Proc. Natl. Acad. Sci. USA
  • 1998
This work proposes that each physical theory supports computational models whose power is limited by the physical theory, and suggests that some physical system whose effective Lagrangian contains a non-Abelian topological term might be manipulated to serve as an analog computer capable of solving NP or even #P-hard problems in polynomial time. Expand
Quantum Circuit Complexity
  • A. Yao
  • Mathematics, Computer Science
  • FOCS
  • 1993
It is shown that any function computable in polynomial time by a quantum Turing machine has aPolynomial-size quantum circuit, and this result enables us to construct a universal quantum computer which can simulate a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them. Expand
Quantum field theory and the Jones polynomial
It is shown that 2+1 dimensional quantum Yang-Mills theory, with an action consisting purely of the Chern-Simons term, is exactly soluble and gives a natural framework for understanding the JonesExpand
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given. Expand
A silicon-based nuclear spin quantum computer
Quantum computers promise to exceed the computational efficiency of ordinary classical machines because quantum algorithms allow the execution of certain tasks in fewer steps. But practicalExpand
Fractional statistics and anyon superconductivity
The occurrence of fractional statistics has been discovered in more and more quantum field theory models, including some of the most geometrical and canonical ones. In a remarkable case, theExpand
Fault-tolerant quantum computation with constant error
This paper shows how to perform fault tolerant quantum computation when the error probability, q, is smaller than some constant threshold, q.. the cost is polylogarithmic in time and space, and no measurements are used during the quantum computation. Expand
Quantum computational networks
  • D. Deutsch
  • Mathematics
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1989
The theory of quantum computational networks is the quantum generalization of the theory of logic circuits used in classical computing machines. Quantum gates are the generalization of classicalExpand