Topological Quantum Computation

@inproceedings{Freedman2001TopologicalQC,
  title={Topological Quantum Computation},
  author={Michael H. Freedman and Alexei Y. Kitaev and Michael Larsen and Zhenghan Wang},
  year={2001}
}
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- nomial 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 possi- bility for the realization of quantum computers. The chief advantage of anyonic computation would be… Expand

Figures from this paper

Paper Mentions

Introduction to topological quantum computation with non-Abelian anyons
TLDR
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
A Theory of Physical Quantum Computation: The Quantum Computer Condition
In this paper we present a new unified theoretical framework that describes the full dynamics of quantum computation. Our formulation allows any questions pertaining to the physical behavior of aExpand
Quantum picturalism for topological cluster-state computing
Topological quantum computing (QC) is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in aExpand
Topological Quantum Computing
Quantum computers have the ability to solve certain problems exponentially faster than the best known algorithms for classical computers. Examples include database searching, simulation of quantumExpand
Topological quantum memory
We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, andExpand
Quantum Computation by Local Measurement
TLDR
An introduction to the one-way quantum computer, a scheme of measurement-based quantum computation (MBQC), in this model, the computation is driven by local measurements on a carefully chosen, highly entangled state. Expand
Quantum automata, braid group and link polynomials
TLDR
In this combinatorial framework, families of finite-states and discrete-time quantum automata capable of accepting the language generated by the braid group are implemented, whose transition amplitudes are colored Jones polynomials. Expand
A Calculus for Topological Quantum Computation
Recent developments in theoretical physics have highlighted interesting topological features of some particular two-dimensional entities called anyons. Kitaev suggested that these features can beExpand
Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
TLDR
This work presents a unified understanding of symmetry-protected topological (SPT) order protected by subsystem symmetries and its relation to measurement-based quantum computation (MBQC), and shows the power of tensor networks and quantum information theory in classifying subsystem SPT order. Expand
Universal Logical Gates on Topologically Encoded Qubits via Constant-Depth Unitary Circuits.
TLDR
It is demonstrated that non-Abelian anyons in Turaev-Viro quantum error correcting codes can be moved over a distance of order of the code distance, and thus braided, by a constant depth local unitary quantum circuit followed by a permutation of qubits. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
Simulation of Topological Field Theories¶by Quantum Computers
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 aExpand
Fault-tolerant quantum computation
  • P. Shor
  • Computer Science, Physics
  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
TLDR
For any quantum computation with t gates, it is shown how to build a polynomial size quantum circuit that tolerates O(1/log/sup c/t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O( 1/t). Expand
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
P/NP, and the quantum field computer
  • M. Freedman
  • Computer Science, Medicine
  • Proc. Natl. Acad. Sci. USA
  • 1998
TLDR
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 theory, the Church–Turing principle and the universal quantum computer
  • D. Deutsch
  • Mathematics
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizibleExpand
Microscopic models of two-dimensional magnets with fractionalized excitations
We demonstrate that spin-charge separation can occur in two dimensions and note its confluence with superconductivity, topology, gauge theory, and fault-tolerant quantum computation. We construct aExpand
Fault-tolerant quantum computation
The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due toExpand
Quantum computations: algorithms and error correction
Contents §0. Introduction §1. Abelian problem on the stabilizer §2. Classical models of computations2.1. Boolean schemes and sequences of operations2.2. Reversible computations §3. QuantumExpand
2n-quasihole states realize 2n−1-dimensional spinor braiding statistics in paired quantum Hall states
By explicitly identifying a basis valid for any number of electrons, we demonstrate that simple multi-quasihole wave functions for the v = 12 Pfaffian paired Hall state exhibit an exponentialExpand
Quantum Computation and the Localization of Modular Functors
  • M. Freedman
  • Mathematics, Computer Science
  • Found. Comput. Math.
  • 2001
The mathematical problem of localizing modular functors to neighborhoods of points is shown to be closely related to the physical problem of engineering a local Hamiltonian for a computationallyExpand
...
1
2
3
4
...