Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1102.5029 · New Journal of Physics

Topological qubit design and leakage

Robert Ainsworth, Johannes K. Slingerland

Published Jun 30, 2011• 72 citations
arXivHTMLPDF

Abstract

We examine how best to design qubits for use in topological quantum computation. These qubits are topological Hilbert spaces associated with small groups of anyons. Operations are performed on these by exchanging the anyons. One might argue that in order to have as many simple single-qubit operations as possible, the number of anyons per group should be maximized. However, we show that there is a maximal number of particles per qubit, namely 4, and more generally a maximal number of particles for qudits of dimension d . We also look at the possibility of having topological qubits for which one can perform two-qubit gates without leakage into non-computational states. It turns out that the requirement that all two-qubit gates are leakage free is very restrictive and this property can only be realized for two-qubit systems related to Ising-like anyon models, which do not allow for universal quantum computation by braiding. Our results follow directly from the representation theory of braid groups, which implies that they are valid for all anyon models. We also make some remarks about generalizations to other exchange groups.

DOI
10.1088/1367-2630/13/6/065030

Related papers

Optimising Qubit Designs forTopological QuantumComputation

Robert Ainsworth

The goal of this thesis is to examine some of the ways in which we might\noptimise the design of topological qubits. The topological operations which\nare imposed on qubits, in order to perform logic gates for topological quantum\ncomputations, are governed by the exchange group of the constituent particles.\nWe examine representations of these exchange groups and investigate what restrictions\ntheir structure places on the effciency, reliability and universality of\nqubits (and multi-qubit systems) as a function of the number of particles composing\nthem. Specific results are given for the limits placed on d-dimensional\nqudits where logic gates are imposed by braiding anyons in 2+1 dimensions.\nWe also study qudits designed from ring-shaped, anyon-like excitations in\n3+1 dimensions, where logic gates are implemented by elements of the loop\nbraid group. We introduce the concept of local representations, where the generators\nof the loop braid group are defined to act non-trivially only on the local\nvector spaces associated with the rings which undergo the motion. We present\na method for obtaining local representations of qudits and show how any such\nrepresentation can be decomposed into representations which come from the\nquantum doubles of groups. Due to the dimension of the local representation\nbeing related to the number of generators, any non-Abelian properties of the\nrepresentation are not compromised with an addition of extra operations, we\nconclude that universal representations may be easier to find than in previously\ndiscussed cases (though not for topological operations alone).\nWe model a ring of Ising anyons in a fractional quantum Hall \nuid to study\nhow interactions in a real environment may impact any qubits we have created.\nFractional quantum Hall liquids are currently one of the most promising possibilities\nfor the physical realisation of TQC and so present a natural choice of\nsystem in which to study these effects. We show how interactions between the\nanyons compromise the practicality of qubits defined by the fusion channels\nof anyon pairs and explore the use of the fermion number parity sectors as\nqubit states. Interactions between the anyon ring and the edge of the liquid\nare modelled to study the effect they will have on the state of the qubit. We\nperform numerical simulations, for a small system, to give some indication of\nhow the edge interaction will in\nuence the reliability of the qubit.

•Jan 1, 2014•1 citation

Compiling single-qubit braiding gate for Fibonacci anyons topological quantum computation

Mohamed Taha Rouabah, Nacer Eddine Belaloui, Abdellah Tounsi

Abstract 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 universal set of quantum gates can be constructed by braiding these anyons yielding to a topologically protected circuit model. In the present study we remind the basics of this emerging quantum computation scheme and illustrate how a topological qubit built with three Fibonacci anyons might be adopted to achieve leakage free braiding gate by exchanging the anyons composing it. A single-qubit braiding gate that approximates the Hadamard quantum gate to a certain accuracy is numerically implemented using a brute force search method. The algorithms utilized for that purpose are explained and the numerical programs are publicly shared for reproduction and further use.

arXiv:2008.03542•Journal of Physics Conference Series•Jan 1, 2021•9 citations

Ternary logic design in topological quantum computing

Muhammad Ilyas, Shawn Xingshan Cui, Marek A. Perkowski

Abstract A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with the environment. It is a real challenge to completely isolate a quantum system to make it free of decoherence. This problem can be circumvented by the use of topological quantum phases of matter. These phases have quasiparticles excitations called anyons. The anyons are charge-flux composites and show exotic fractional statistics. When the order of exchange matters, then the anyons are called non-abelian anyons. Majorana fermions in topological superconductors and quasiparticles in some quantum Hall states are non-abelian anyons. Such topological phases of matter have a ground state degeneracy. The fusion of two or more non-abelian anyons can result in a superposition of several anyons. The topological quantum gates are implemented by braiding and fusion of the non-abelian anyons. The fault-tolerance is achieved through the topological degrees of freedom of anyons. Such degrees of freedom are non-local, hence inaccessible to the local perturbations. In this paper, the Hilbert space for a topological qubit is discussed. The Ising and Fibonacci anyonic models for binary gates are briefly given. Ternary logic gates are more compact than their binary counterparts and naturally arise in a type of anyonic model called the metaplectic anyons. The mathematical model, for the fusion and braiding matrices of metaplectic anyons, is the quantum deformation of the recoupling theory. We proposed that the existing quantum ternary arithmetic gates can be realized by braiding and topological charge measurement of the metaplectic anyons.

arXiv:2204.01000•Journal of Physics A Mathematical and Theoretical•Jun 22, 2022•9 citations

Topological Quantum Computation

Tudor D. Stanescu

Quantum computation is a proposed model of computation that applies quantum\nmechanics to perform information processing and store information in quantum\nstates. Quantum mechanics applies for many different phenomena, with\nmany possible systems in which it is possible to model and manipulate the\nfundamental quantum information bit - the qubit - and thus there are hypothetically\nmany ways to construct a quantum computer. One proposed way of\nquantum computation is to use non-abelian anyons to model qubits. These are\nexotic quasi-particles whose wave functions evolve non-trivially when permuting\ntheir positions. This allows for computation with qubits simply by permuting\nanyons, a process called braiding since their trajectories in spacetime resemble\nbraids. The quantum states associated with the anyons evolve only when the\npositions of anyons are permuted and do not depend on the paths the anyons\ntake. For this reason this model of quantum computation is called topological\nquantum computation (TQC). One of the main advantages of TQC is that computations\nare inherently fault tolerant: there is no noise due to anyons taking\nstrange paths since the quantum evolution is path independent. The goal of\nthis text is to investigate the mathematical framework for this proposed model\nof quantum computation. The main results are the possible gates that can be\napplied to two one-qubit topological computers. Given the key properties of\nthe anyons used, Theorem 5.2 states the possible one-qubit gates in an Ising\ncomputer, and Theorem 7.1 states the possible one-qubit gates in a Fibonacci\ncomputer.

CRC Press eBooks•Dec 13, 2016•17 citations

Topological Quantum Compiling

A quantum computer must be capable of manipulating quantum information while at the same time protecting it from error and loss of quantum coherence due to interactions with the environment. Topological quantum computation (TQC) offers a particularly elegant way to achieve this. In TQC, quantum information is stored in exotic states of matter which are intrinsically protected from decoherence, and quantum computation is carried out by dragging particle-like excitations (quasiparticles) around one another in two space dimensions. The resulting quasiparticle trajectories define world-lines in three-dimensional space-time, and the corresponding computation depends only on the topology of the braids formed by the world-lines. Quasiparticles that can be used for TQC are expected to exist in a variety of fractional quantum Hall states, among them the so-called Fibonacci anyons. These quasiparticles are conjectured to exist in the = 12/5 fractional quantum Hall state which has been observed in experiments. It has been shown that qubits can be encoded using three or four Fibonacci anyons and single-qubit gates can be carried out by braiding quasiparticles within each qubit. Braids that approximate single-qubit gates can be found through brute force searching and the result can be systematically improved, to any desired accuracy, by applying the Solovay- Kitaev algorithm in SU(2). Two-qubit gates are significantly harder to implement, mostly due to the following two reasons. First, the Hilbert space of the quasiparticles forming two qubits is considerably larger than the Hilbert space of the quasiparticles of a single qubit. Therefore, performing a brute force search to find braids that approximate two-qubit gates, as well as the implementation of the Solovay-Kitaev algorithm for subsequent improvements are prohibitively more difficult. Second, to construct any entangling two-qubit gate, one needs to braid some xvii of the quasiparticles from one qubit around quasiparticles of the other qubit. This process will inevitably lead to leakage errors, i.e. transitions from the qubit space to other available states in the Hilbert space. In this thesis, I will present several efficient methods to construct two-qubit gates using a specific class of quasiparticles. In particular, I show that the problem of finding braids that correspond to two-qubit gates can be reduced to a series of smaller problems which involve braiding only three objects at a time. The required computational power for finding these braids is equivalent to that needed to find single-qubit gates, therefore, these braids can be found with the same high degree of accuracy and efficiency. The end result of this work is an efficient procedure for translating (or "compiling") arbitrary quantum algorithms into specific braiding patterns for Fibonacci anyons, as well as quasiparticles of certain other fractional quantum Hall states that can be used for TQC.

•Jan 1, 2007•0 citations

Universal Gates from Braiding and Fusing Anyons on Quantum Hardware

Chiu Fan Bowen Lo, Anasuya Lyons, Dan Gresh +8 more

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, as its anyons lack internal structure. However, the simplest non-Abelian generalizations of the toric code do not support universality via braiding alone. Here we demonstrate that such minimally non-Abelian TOs can be made universal by treating anyon fusion as a computational primitive. We prepare a 54-qubit TO wavefunction associated with the smallest non-Abelian group, $S_3$, on Quantinuum's H2 quantum processor. This phase of matter exhibits cyclic anyon fusion rules, known to underpin universality, which we evidence by trapping a single non-Abelian anyon on the torus. We encode logical qutrits in the nonlocal fusion space of non-Abelian fluxes and, by combining an entangling braiding operation with anyon charge measurements, realize a universal topological gate set and read-out, which we further demonstrate by topologically preparing a magic state. This work establishes $S_3$ TO as simple enough to be prepared efficiently, yet rich enough to enable universal topological quantum computation.

quant-pharXiv:2601.20956•Nature•Jan 30, 2026•8 citations
We examine how best to design qubits for use in topological quantum computation. These qubits are topological Hilbert spaces associated with small groups of anyons. Operations are performed on these by exchanging the anyons. One might argue that in order to have as many simple single-qubit operations as possible, the number of anyons per group should be maximized. However, we show that there is a maximal number of particles per qubit, namely 4, and more generally a maximal number of particles for qudits of dimension d . We also look at the possibility of having topological qubits for which one can perform two-qubit gates without leakage into non-computational states. It turns out that the requirement that all two-qubit gates are leakage free is very restrictive and this property can only be realized for two-qubit systems related to Ising-like anyon models, which do not allow for universal quantum computation by braiding. Our results follow directly from the representation theory of braid groups, which implies that they are valid for all anyon models. We also make some remarks about generalizations to other exchange groups.
The goal of this thesis is to examine some of the ways in which we might\noptimise the design of topological qubits. The topological operations which\nare imposed on qubits, in order to perform logic gates for topological quantum\ncomputations, are governed by the exchange group of the constituent particles.\nWe examine representations of these exchange groups and investigate what restrictions\ntheir structure places on the effciency, reliability and universality of\nqubits (and multi-qubit systems) as a function of the number of particles composing\nthem. Specific results are given for the limits placed on d-dimensional\nqudits where logic gates are imposed by braiding anyons in 2+1 dimensions.\nWe also study qudits designed from ring-shaped, anyon-like excitations in\n3+1 dimensions, where logic gates are implemented by elements of the loop\nbraid group. We introduce the concept of local representations, where the generators\nof the loop braid group are defined to act non-trivially only on the local\nvector spaces associated with the rings which undergo the motion. We present\na method for obtaining local representations of qudits and show how any such\nrepresentation can be decomposed into representations which come from the\nquantum doubles of groups. Due to the dimension of the local representation\nbeing related to the number of generators, any non-Abelian properties of the\nrepresentation are not compromised with an addition of extra operations, we\nconclude that universal representations may be easier to find than in previously\ndiscussed cases (though not for topological operations alone).\nWe model a ring of Ising anyons in a fractional quantum Hall \nuid to study\nhow interactions in a real environment may impact any qubits we have created.\nFractional quantum Hall liquids are currently one of the most promising possibilities\nfor the physical realisation of TQC and so present a natural choice of\nsystem in which to study these effects. We show how interactions between the\nanyons compromise the practicality of qubits defined by the fusion channels\nof anyon pairs and explore the use of the fermion number parity sectors as\nqubit states. Interactions between the anyon ring and the edge of the liquid\nare modelled to study the effect they will have on the state of the qubit. We\nperform numerical simulations, for a small system, to give some indication of\nhow the edge interaction will in\nuence the reliability of the qubit.
Abstract 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 universal set of quantum gates can be constructed by braiding these anyons yielding to a topologically protected circuit model. In the present study we remind the basics of this emerging quantum computation scheme and illustrate how a topological qubit built with three Fibonacci anyons might be adopted to achieve leakage free braiding gate by exchanging the anyons composing it. A single-qubit braiding gate that approximates the Hadamard quantum gate to a certain accuracy is numerically implemented using a brute force search method. The algorithms utilized for that purpose are explained and the numerical programs are publicly shared for reproduction and further use.
Abstract A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with the environment. It is a real challenge to completely isolate a quantum system to make it free of decoherence. This problem can be circumvented by the use of topological quantum phases of matter. These phases have quasiparticles excitations called anyons. The anyons are charge-flux composites and show exotic fractional statistics. When the order of exchange matters, then the anyons are called non-abelian anyons. Majorana fermions in topological superconductors and quasiparticles in some quantum Hall states are non-abelian anyons. Such topological phases of matter have a ground state degeneracy. The fusion of two or more non-abelian anyons can result in a superposition of several anyons. The topological quantum gates are implemented by braiding and fusion of the non-abelian anyons. The fault-tolerance is achieved through the topological degrees of freedom of anyons. Such degrees of freedom are non-local, hence inaccessible to the local perturbations. In this paper, the Hilbert space for a topological qubit is discussed. The Ising and Fibonacci anyonic models for binary gates are briefly given. Ternary logic gates are more compact than their binary counterparts and naturally arise in a type of anyonic model called the metaplectic anyons. The mathematical model, for the fusion and braiding matrices of metaplectic anyons, is the quantum deformation of the recoupling theory. We proposed that the existing quantum ternary arithmetic gates can be realized by braiding and topological charge measurement of the metaplectic anyons.
Quantum computation is a proposed model of computation that applies quantum\nmechanics to perform information processing and store information in quantum\nstates. Quantum mechanics applies for many different phenomena, with\nmany possible systems in which it is possible to model and manipulate the\nfundamental quantum information bit - the qubit - and thus there are hypothetically\nmany ways to construct a quantum computer. One proposed way of\nquantum computation is to use non-abelian anyons to model qubits. These are\nexotic quasi-particles whose wave functions evolve non-trivially when permuting\ntheir positions. This allows for computation with qubits simply by permuting\nanyons, a process called braiding since their trajectories in spacetime resemble\nbraids. The quantum states associated with the anyons evolve only when the\npositions of anyons are permuted and do not depend on the paths the anyons\ntake. For this reason this model of quantum computation is called topological\nquantum computation (TQC). One of the main advantages of TQC is that computations\nare inherently fault tolerant: there is no noise due to anyons taking\nstrange paths since the quantum evolution is path independent. The goal of\nthis text is to investigate the mathematical framework for this proposed model\nof quantum computation. The main results are the possible gates that can be\napplied to two one-qubit topological computers. Given the key properties of\nthe anyons used, Theorem 5.2 states the possible one-qubit gates in an Ising\ncomputer, and Theorem 7.1 states the possible one-qubit gates in a Fibonacci\ncomputer.
A quantum computer must be capable of manipulating quantum information while at the same time protecting it from error and loss of quantum coherence due to interactions with the environment. Topological quantum computation (TQC) offers a particularly elegant way to achieve this. In TQC, quantum information is stored in exotic states of matter which are intrinsically protected from decoherence, and quantum computation is carried out by dragging particle-like excitations (quasiparticles) around one another in two space dimensions. The resulting quasiparticle trajectories define world-lines in three-dimensional space-time, and the corresponding computation depends only on the topology of the braids formed by the world-lines. Quasiparticles that can be used for TQC are expected to exist in a variety of fractional quantum Hall states, among them the so-called Fibonacci anyons. These quasiparticles are conjectured to exist in the = 12/5 fractional quantum Hall state which has been observed in experiments. It has been shown that qubits can be encoded using three or four Fibonacci anyons and single-qubit gates can be carried out by braiding quasiparticles within each qubit. Braids that approximate single-qubit gates can be found through brute force searching and the result can be systematically improved, to any desired accuracy, by applying the Solovay- Kitaev algorithm in SU(2). Two-qubit gates are significantly harder to implement, mostly due to the following two reasons. First, the Hilbert space of the quasiparticles forming two qubits is considerably larger than the Hilbert space of the quasiparticles of a single qubit. Therefore, performing a brute force search to find braids that approximate two-qubit gates, as well as the implementation of the Solovay-Kitaev algorithm for subsequent improvements are prohibitively more difficult. Second, to construct any entangling two-qubit gate, one needs to braid some xvii of the quasiparticles from one qubit around quasiparticles of the other qubit. This process will inevitably lead to leakage errors, i.e. transitions from the qubit space to other available states in the Hilbert space. In this thesis, I will present several efficient methods to construct two-qubit gates using a specific class of quasiparticles. In particular, I show that the problem of finding braids that correspond to two-qubit gates can be reduced to a series of smaller problems which involve braiding only three objects at a time. The required computational power for finding these braids is equivalent to that needed to find single-qubit gates, therefore, these braids can be found with the same high degree of accuracy and efficiency. The end result of this work is an efficient procedure for translating (or "compiling") arbitrary quantum algorithms into specific braiding patterns for Fibonacci anyons, as well as quasiparticles of certain other fractional quantum Hall states that can be used for TQC.
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, as its anyons lack internal structure. However, the simplest non-Abelian generalizations of the toric code do not support universality via braiding alone. Here we demonstrate that such minimally non-Abelian TOs can be made universal by treating anyon fusion as a computational primitive. We prepare a 54-qubit TO wavefunction associated with the smallest non-Abelian group, S3S_3S3​, on Quantinuum's H2 quantum processor. This phase of matter exhibits cyclic anyon fusion rules, known to underpin universality, which we evidence by trapping a single non-Abelian anyon on the torus. We encode logical qutrits in the nonlocal fusion space of non-Abelian fluxes and, by combining an entangling braiding operation with anyon charge measurements, realize a universal topological gate set and read-out, which we further demonstrate by topologically preparing a magic state. This work establishes S3S_3S3​ TO as simple enough to be prepared efficiently, yet rich enough to enable universal topological quantum computation.