Mochon, Carlos (2004) Anyon computers with smaller groups. Physical Review A, 69 (3). Art. No. 032306. ISSN 1050-2947. http://resolver.caltech.edu/CaltechAUTHORS:MOCpra04a
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:MOCpra04a
Anyons obtained from a finite gauge theory have a computational power that depends on the symmetry group. The relationship between group structure and computational power is discussed in this paper. In particular, it is shown that anyons based on finite groups that are solvable but not nilpotent are capable of universal quantum computation. This extends previously published results to groups that are smaller and therefore more practical. Additionally, a new universal gate set is built out of an operation called a probabilistic projection, and a quasiuniversal leakage correction scheme is discussed.
|Additional Information:||©2004 The American Physical Society (Received 10 July 2003; published 11 March 2004) Much of this work is inspired by the construction of Alexei Kitaev, who showed that universal computation was possible with anyons based on the group S3. His construction used the magic state (1/sqrt3)(|0>-|1>-|2>) to build a qubit Toffoli gate. Many of the above ideas were captured by the unpublished notes of John Preskill. I am also indebted to Charlene Ahn and Ben Toner who were kind enough to read and review this paper. This work was supported in part by the National Science Foundation under Grant No. EIA-0086038 and by the U.S. Department of Energy under Grant No. DE-FG03-92-ER40701.|
|Subject Keywords:||anyons; gauge field theory; group theory; quantum gates; probability|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||18 Jul 2006|
|Last Modified:||26 Dec 2012 08:56|
Repository Staff Only: item control page