Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials

A method, termed controlled-injection, is proposed for compiling three-qubit controlled gates within the non-abelian Fibonacci anyon model. Building on single-qubit compilation techniques with three Fibonacci anyons, the approach showcases enhanced accuracy and reduced braid length compared to the conventional decomposition method for the controlled three-qubit gates. This method necessitates only four two-qubit gates for decomposition, a notable reduction from the convention...

Topological quantum computation has recently emerged as one of the most exciting approaches to constructing a fault-tolerant quantum computer. The proposal relies on the existence of topological states of matter whose quasiparticle excitations are neither bosons nor fermions, but are particles known as {\it Non-Abelian anyons}, meaning that they obey {\it non-Abelian braiding statistics}. Quantum information is stored in states with multiple quasiparticles, which have a topol...

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 off-diagonal matrix elements that can be made arbitrarily small in a particular natural basis through a simple and efficient iterative procedure. This procedure does not require brute force search, the Solovay-Kitaev method, or any other numerical ...

Topological degeneracy is the degeneracy of the ground states in a many-body system in the large-system-size limit. Topological degeneracy cannot be lifted by any local perturbation of the Hamiltonian. The topological degeneracies on closed manifolds have been used to discover/define topological order in many-body systems, which contain excitations with fractional statistics. In this paper, we study a new type of topological degeneracy induced by condensing anyons along a lin...

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. Our methods are rooted in the bracket state sum model for the Jones polynomial. We give our results for a large class of representations based on values for the bracket polynomial that are roots of unity. We make a separate and self-contained study of the quantum universal Fibona...

Fibonacci anyon, an exotic quasi-particle excitation, plays a pivotal role in realization of a quantum computer. Starting from a $SU(2)_4$ topological phase, in this paper we demonstrate a way to construct a Fibonacci topological phase which has only one non-trivial excitation described by the Fibonacci anyon. We show that arrays of anyonic chains created by excitations of the $SU(2)_4$ phase leads to the Fibonacci phase. We further demonstrate that our theoretical propositio...

Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits, typically arranged in a planar connectivity. However, many applications of quantum computing require more connectivity than the planar lattice offered by the hardware on more qubits than is available on a single quantum processing unit (QPU). Here we overcome these limitati...

We present a systematic numerical method to compute the elementary braiding operations for topological quantum computation (TQC). Braiding non-Abelian anyons is a crucial technique in TQC, offering a topologically protected implementation of quantum gates. However, obtaining matrix representations for braid generators can be challenging, especially for systems with numerous anyons or complex fusion patterns. Our proposed method addresses this challenge, allowing for the inclu...

Quantum gates in topological quantum computation are performed by braiding non-Abelian anyons. These braiding processes can presumably be performed with very low error rates. However, to make a topological quantum computation architecture truly scalable, even rare errors need to be corrected. Error correction for non-Abelian anyons is complicated by the fact that it needs to be performed on a continuous basis and further errors may occur while we are correcting existing ones....

We consider topological quantum computation (TQC) with a particular class of anyons that are believed to exist in the Fractional Quantum Hall Effect state at Landau level filling fraction nu=5/2. Since the braid group representation describing statistics of these anyons is not computationally universal, one cannot directly apply the standard TQC technique. We propose to use very noisy non-topological operations such as direct short-range interaction between anyons to simulate...