# 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…

## Figures from this paper

## 421 Citations

Introduction to topological quantum computation with non-Abelian anyons

- PhysicsQuantum Science and Technology
- 2018

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.

A Theory of Physical Quantum Computation: The Quantum Computer Condition

- Physics, Computer Science
- 2005

A new unified theoretical framework that describes the full dynamics of quantum computation, and shows that the seemingly different circuit, graph- (including cluster-) state, and adiabatic paradigms for quantum computing are in fact all manifestations of a single, universal paradigm for all physical quantum computation.

Quantum picturalism for topological cluster-state computing

- Computer Science
- 2011

This paper applies the category-theoretic work of Abramsky and Coecke to the topological cluster-state model of QC to give a high-level graphical language that enables direct translation between quantum processes and physical patterns of measurement in a computer—a ‘compiler language’.

Topological Quantum Computing

- Computer Science, Physics
- 2011

This work discusses the necessary conditions for finding nonabelian states in nature and the current promising candidates of topological quantum computing, and introduces the concept of anyons as a generalization of bosons and fermions.

Topological quantum memory

- Physics
- 2002

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, and…

Quantum Computation by Local Measurement

- Physics, Computer Science
- 2012

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.

Quantum automata, braid group and link polynomials

- Computer ScienceQuantum Inf. Comput.
- 2007

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.

A Calculus for Topological Quantum Computation

- Physics
- 2014

Recent developments in theoretical physics have highlighted interesting topological features of some particular two-dimensional entities called anyons. Kitaev suggested that these features can be…

Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter

- Computer ScienceQuantum
- 2019

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.

Roadmap for quantum simulation of the fractional quantum Hall effect

- PhysicsPhysical Review A
- 2020

A major motivation for building a quantum computer is that it provides a tool to efficiently simulate strongly correlated quantum systems. In this paper, we present a detailed roadmap on how to…

## References

SHOWING 1-10 OF 39 REFERENCES

Simulation of Topological Field Theories¶by Quantum Computers

- Physics
- 2002

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…

A Modular Functor Which is Universal¶for Quantum Computation

- Physics
- 2000

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 efficiently…

P/NP, and the quantum field computer

- MathematicsProc. 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.

Microscopic models of two-dimensional magnets with fractionalized excitations

- Physics
- 2001

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 a…

Quantum computations: algorithms and error correction

- Computer Science
- 1997

This book discusses classical models of computations, quantum formalism, symplecto-classical cases, and error correction in the computation process: general principles.

Quantum Computation and the Localization of Modular Functors

- MathematicsFound. 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 computationally…

Algorithms for quantum computation: discrete logarithms and factoring

- Computer ScienceProceedings 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.

Beyond paired quantum Hall states: parafermions and incompressible states in the first excited Landau level

- Physics
- 1999

The Pfaffian quantum Hall states, which can be viewed as involving pairing either of spin-polarized electrons or of composite fermions, are generalized by finding the exact ground states of certain…