Anyons from non-solvable finite groups are sufficient for universal quantum computation
نویسنده
چکیده
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.
منابع مشابه
Anyon computers with smaller groups
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 th...
متن کاملUniversal quantum computation with weakly integral anyons
Harnessing non-abelian statistics of anyons to perform quantum computational tasks is getting closer to reality. While the existence of universal anyons by braiding alone such as the Fibonacci anyon is theoretically a possibility, accessible anyons with current technology all belong to a class that is called weakly integral—anyons whose squared quantum dimensions are integers. We analyze the co...
متن کاملQuantum Computation with Abelian Anyons
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topolog-ical effects. Single-anyon operations such as hopping from site to site on a lattice suffice to perform all quantum logic operations. Quantum computation using abelian anyons shares some but not all of the robustness of quantum computa...
متن کاملOn non-normal non-abelian subgroups of finite groups
In this paper we prove that a finite group $G$ having at most three conjugacy classes of non-normal non-abelian proper subgroups is always solvable except for $Gcong{rm{A_5}}$, which extends Theorem 3.3 in [Some sufficient conditions on the number of non-abelian subgroups of a finite group to be solvable, Acta Math. Sinica (English Series) 27 (2011) 891--896.]. Moreover, we s...
متن کاملUniversal Gates via Fusion and Measurement Operations on SU(2)4 Anyons
We examine a class of operations for topological quantum computation based on fusing and measuring topological charges for systems with SU(2)4 or k = 4 Jones-Kauffman anyons. We show that such operations augment the braiding operations, which, by themselves, are not computationally universal. This augmentation results in a computationally universal gate set through the generation of an exact, t...
متن کامل