Topological quantum computation

521Citations
Citations of this article
187Readers
Mendeley users who have this article in their library.

Abstract

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 polynomial 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 possibility for the realization of quantum computers. The chief advantage of anyonic computation would be physical error correction: An error rate scaling like e-αℓ, where ℓ is a length scale, and α is some positive constant. In contrast, the "presumptive" qubit-model of quantum computation, which repairs errors combinatorically, requires a fantastically low initial error rate (about 10-4) before computation can be stabilized.

Cite

CITATION STYLE

APA

Freedman, M. H., Kitaev, A., Larsen, M. J., & Wang, Z. (2003). Topological quantum computation. Bulletin of the American Mathematical Society, 40(1), 31–38. https://doi.org/10.1090/S0273-0979-02-00964-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free