Fault-tolerant quantum computation by anyons

Kitaev, A. Yu.

doi:10.1016/S0003-4916(02)00018-0

Record: found
Abstract: found
Article: found

Is Open Access

Fault-tolerant quantum computation by anyons

Preprint

Author(s): A. Yu. Kitaev

Publication date Created: 09 July 1997

Read this article at

ScienceOpen Publisher ArXiv

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

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.

Related collections

Most cited references 6

Record: found
Abstract: not found
Article: not found

Fractional Statistics and the Quantum Hall Effect

Daniel Arovas, J. Schrieffer, Frank Wilczek (1984)

0 comments Cited 394 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: found
Article: found

Is Open Access

Quantum Error Correction and Orthogonal Geometry

P W Shor, N. J. A. Sloane, A. R. Calderbank … (1996)

A group theoretic framework is introduced that simplifies the description of known quantum error-correcting codes and greatly facilitates the construction of new examples. Codes are given which map 3 qubits to 8 qubits correcting 1 error, 4 to 10 qubits correcting 1 error, 1 to 13 qubits correcting 2 errors, and 1 to 29 qubits correcting 5 errors.