Anyons from non-solvable finite groups are sufficient for universal quantum computation
Quantum Physics
2009-11-07 v2
Abstract
We present a constructive proof that anyonic magnetic charges with fluxes in a non-solvable 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.
Keywords
Cite
@article{arxiv.quant-ph/0206128,
title = {Anyons from non-solvable finite groups are sufficient for universal quantum computation},
author = {Carlos Mochon},
journal= {arXiv preprint arXiv:quant-ph/0206128},
year = {2009}
}
Comments
17 pages, REVTeX 4 (minor changes in v2, added motivation for leakage correction)