vix.ing · top · new · best · stats

Fault-tolerant quantum computation by anyons

1997/07/09 by Alexei Kitaev, A.Yu. Kitaev, A. Yu. Kitaev · 3 voices · 7,400 citations
Computer Science · Physics and Astronomy · #Algorithm #Anyon #Computation #Computer science #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum mechanics #Theoretical physics #Topological quantum computer #Unitary state #cond-mat.mes-hall #hep-th #quant-ph

paper · pdf · doi:10.1016/s0003-4916(02)00018-0

published in Annals of Physics 303(1), 2-30 (Elsevier BV) · 27 pages, Latex2e, uses amssymb.sty, 13 Postscript figures

arxiv created 1997/07/09 · arxiv published 1997/07/09 · openalex publication_date 2003/01/01 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in pairs and observing the result of fusion. Such computation is fault-tolerant by its physical nature.

Cited by

Discussions

Related