Anyons from nonsolvable finite groups are sufficient for universal quantum computation
Journal Article
·
· Physical Review. A
- Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125 (United States)
We present a constructive proof that anyonic magnetic charges with fluxes in a nonsolvable finite group can perform universal quantum computations. The gates are built out of the elementary operations of braiding, fusion, and vacuum pair creation, supplemented by a reservoir of ancillas of known flux. Procedures for building the ancilla reservoir and for correcting leakage are also described. Finally, a universal qudit gate set, which is ideally suited for anyons, is presented. The gate set consists of classical computation supplemented by measurements of the X operator.
- OSTI ID:
- 20633695
- Journal Information:
- Physical Review. A, Vol. 67, Issue 2; Other Information: DOI: 10.1103/PhysRevA.67.022315; (c) 2003 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Universal quantum computation with metaplectic anyons
Anyon computers with smaller groups
Quantum computation with Turaev-Viro codes
Journal Article
·
Sun Mar 15 00:00:00 EDT 2015
· Journal of Mathematical Physics
·
OSTI ID:20633695
Anyon computers with smaller groups
Journal Article
·
Mon Mar 01 00:00:00 EST 2004
· Physical Review. A
·
OSTI ID:20633695
Quantum computation with Turaev-Viro codes
Journal Article
·
Wed Dec 15 00:00:00 EST 2010
· Annals of Physics (New York)
·
OSTI ID:20633695