相关论文: Universal Quantum Gate Set from Multiple-Braiding …

We study systematically numerical method into constructing a universal quantum gate set for topological quantum computation (TQC) using SU(2)k anyon models. The F-matrices and R-symbol were computed through the q-deformed representation…

Topological quantum computing holding global anti-interference ability is realized by braiding some anyons, such as well-known Fibonacci anyons. Here, based on $SO(3)_2 $ theory we obtain a total of 6 anyon models utilizing…

We provide a comprehensive systematic method for the numerical computation of elementary braid operations in topological quantum computation (TQC). This {procedure} is systematically applicable to all anyon models, including $SU(2)_k$.…

We show that braidings of the metaplectic anyons $X_\epsilon$ in $SO(3)_2=SU(2)_4$ with their total charge equal to the metaplectic mode $Y$ supplemented with measurements of the total charge of two metaplectic anyons are universal for…

We study various aspects of the topological quantum computation scheme based on the non-Abelian anyons corresponding to fractional quantum hall effect states at filling fraction 5/2 using the Temperley-Lieb recoupling theory. Unitary…

Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…

We present a systematic numerical construction of a universal quantum gate set for topological quantum computation based on the non-semisimple Ising anyons model. By employing a Genetic Algorithm-enhanced Solovay-Kitaev Algorithm…

Quantum gates built out of braid group elements form the building blocks of topological quantum computation. They have been extensively studied in $SU(2)_k$ quantum group theories, a rich source of examples of non-Abelian anyons such as the…

We study the problem of universality in the anyon model described by the $SU(2)$ Witten-Chern-Simons theory at level $k$. A classic theorem of Freedman-Larsen-Wang states that for $k \geq 3, \ k \neq 4$, braiding of the anyons of…

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,…

Topological quantum computation encodes quantum information in the internal fusion space of non-Abelian anyonic quasiparticles, whose braiding implements logical gates. This goes beyond Abelian topological order (TO) such as the toric code,…

We have studied ${\rm SU}(2)_k$ anyon models, assessing their prospects for topological quantum computation. In particular, we have compared the Ising ($k=2$) anyon and Fibonacci ($k=3$) anyon models, motivated by their potential for future…

A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons…

A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum…

Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons and…

Important developments in fault-tolerant quantum computation using the braiding of anyons have placed the theory of braid groups at the very foundation of topological quantum computing. Furthermore, the realization by Kauffman and Lomonaco…

This paper explores of the role of unitary braiding operators in quantum computing. We show that a single specific solution R (the Bell basis change matrix) of the Yang-Baxter Equation is a universal gate for quantum computing, in the…

Topological quantum computation with Fibonacci anyons relies on the possibility of efficiently generating unitary transformations upon pseudoparticles braiding. The crucial fact that such set of braids has a dense image in the unitary…

We describe the hashing technique to obtain a fast approximation of a target quantum gate in the unitary group SU(2) represented by a product of the elements of a universal basis. The hashing exploits the structure of the icosahedral group…

Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with…