Related papers: Geometrical approach to SU(2) navigation with Fibo…
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…
In a topological quantum computer, braids of non-Abelian anyons in a (2+1)-dimensional space-time form quantum gates, whose fault tolerance relies on the topological, rather than geometric, properties of the braids. Here we propose to…
A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented…
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…
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…
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…
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…
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 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…
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…
We investigate a promising conformal field theory realization scheme for topological quantum computation based on the Fibonacci anyons, which are believed to be realized as quasiparticle excitations in the $\mathbb{Z}_3$ parafermion…
The model of a topological quantum computer is a promising one due to its natural resistance to noise and other errors. Operations in such a computer are implemented by braiding the trajectories of anyons. While it is easy to understand how…
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations…
We study the implementation of a universal quantum gate set via multiple-braiding within $SU(2)_k$ ($k > 2$, $k \neq 4$) anyon models. The multiple elementary braiding matrices (MEBMs) are derived from the $q$-deformed representation theory…
We review the q-deformed spin network approach to topological quantum field theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. The simplest case of these models is the…
Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two…
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 show that the "geometric models of matter" approach proposed by the first author can be used to construct models of anyon quasiparticles with fractional quantum numbers, using 4-dimensional edge-cone orbifold geometries with orbifold…
We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…
A great part of the mathematical foundations of topological quantum computation is given by the theory of modular categories which provides a description of the topological phases of matter such as anyon systems. In the near future the…