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:0911.2691 · Physical Review Letters

Implementing Arbitrary Phase Gates with Ising Anyons

Parsa Bonderson, David J. Clarke, Chetan Nayak, Kirill Shtengel

Published May 7, 2010• 67 citations
arXivHTMLPDF

Abstract

Ising-type non-Abelian anyons are likely to occur in a number of physical systems, including quantum Hall systems, where recent experiments support their existence. In general, non-Abelian anyons may be utilized to provide a topologically error-protected medium for quantum information processing. However, the topologically protected operations that may be obtained by braiding and measuring topological charge of Ising anyons are precisely the Clifford gates, which are not computationally universal. The Clifford gate set can be made universal by supplementing it with single-qubit pi/8-phase gates. We propose a method of implementing arbitrary single-qubit phase gates for Ising anyons by running a current of anyons with interfering paths around computational anyons.

DOI
10.1103/physrevlett.104.180505

Related papers

Robust universal braiding with nonsemisimple Ising anyons

Filippo Iulianelli, Sung Kim, Joshua Sussan +1 more

Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory provides new anyon types indexed by a real parameter $α$, the neglecton. Braiding acts unitarily with respect to an indefinite Hermitian form, while the computational subspace sits in a positive-definite sector. We demonstrate that this universality is robust, persisting over an open interval of the neglecton parameter $α$ where the computational subspace remains positive-definite. We identify special values of $α$ where the physical subspace decouples exactly from negative-norm components, ensuring fully unitary evolution and suppressed leakage. We further present an alternative encoding supporting exact single-qubit Clifford gates alongside a non-Clifford phase gate. We show that high-precision tuning of $α$ is not required for efficient gate compilation, significantly enhancing the physical plausibility of non-semisimple anyonic architectures.

arXiv:2509.02843•Physical Review A•Mar 27, 2026•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•0 citations

Topologically protected Hadamard, phase and Controlled-NOT gates for quantum computation with non-Abelian anyons in the Pfaffian quantum Hall state

Lachezar S. Georgiev

We extend the topological quantum computation scheme using the Pfaffian quantum Hall state, which has been recently proposed by Das Sarma et al., in a way that might potentially allow for the topologically protected construction of a universal set of quantum gates. We construct, for the first time, a topologically protected Controlled-NOT gate which is entirely based on quasihole braidings of Pfaffian qubits. All single-qubit gates, except for the pi/8 gate, are also explicitly implemented by quasihole braidings. Instead of the pi/8 gate we try to construct a topologically protected Toffoli gate, in terms of the Controlled-phase gate and CNOT or by a braid-group based Controlled-Controlled-Z precursor. We also give a topologically protected realization of the Bravyi-Kitaev two-qubit gate g_3.

•Jul 5, 2006•0 citations

Continuous error correction for Ising anyons

Adrian Hutter, James R. Wootton

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. Here, we prove the feasibility of this task, establishing non-Abelian anyons as a viable platform for scalable quantum computation. We thereby focus on Ising anyons as the most prominent example of non-Abelian anyons and show that for these a finite error rate can indeed be corrected continuously. There is a threshold error rate ${p}_{c}>0$ such that for all error rates $p<{p}_{c}$ the probability of a logical error per time step can be made exponentially small in the distance of a logical qubit.

arXiv:1508.04033•Physical Review A•Apr 18, 2016•11 citations

Topologically protected gates for quantum computation with non-Abelian anyons in the Pfaffian quantum Hall state

Lachezar S. Georgiev

We extend the topological quantum computation scheme using the Pfaffian quantum Hall state, which has been recently proposed by Das Sarma et al., in a way that might potentially allow for the topologically protected construction of a universal set of quantum gates. We construct, for the first time, a topologically protected controlled-NOT gate, which is entirely based on quasihole braidings of Pfaffian qubits. All single-qubit gates, except for the $\ensuremath{\pi}∕8$ gate, are also explicitly implemented by quasihole braidings. Instead of the $\ensuremath{\pi}∕8$ gate we try to construct a topologically protected Toffoli gate, in terms of the controlled-phase gate and CNOT or by a braid-group-based controlled-controlled-$Z$ precursor. We also give a topologically protected realization of the Bravyi-Kitaev two-qubit gate ${g}_{3}$.

arXiv:cond-mat/0607125•Physical Review B•Dec 21, 2006•54 citations

Implementation of Clifford gates in the Ising-anyon topological quantum computer

André Ahlbrecht, Lachezar S. Georgiev, Reinhard F. Werner

We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for $n\ensuremath{\ge}3$ qubits we prove that the image of the braid group is a nontrivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.

arXiv:0812.2338•Physical Review A•Mar 11, 2009•57 citations
Ising-type non-Abelian anyons are likely to occur in a number of physical systems, including quantum Hall systems, where recent experiments support their existence. In general, non-Abelian anyons may be utilized to provide a topologically error-protected medium for quantum information processing. However, the topologically protected operations that may be obtained by braiding and measuring topological charge of Ising anyons are precisely the Clifford gates, which are not computationally universal. The Clifford gate set can be made universal by supplementing it with single-qubit pi/8-phase gates. We propose a method of implementing arbitrary single-qubit phase gates for Ising anyons by running a current of anyons with interfering paths around computational anyons.
Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory provides new anyon types indexed by a real parameter ααα, the neglecton. Braiding acts unitarily with respect to an indefinite Hermitian form, while the computational subspace sits in a positive-definite sector. We demonstrate that this universality is robust, persisting over an open interval of the neglecton parameter ααα where the computational subspace remains positive-definite. We identify special values of ααα where the physical subspace decouples exactly from negative-norm components, ensuring fully unitary evolution and suppressed leakage. We further present an alternative encoding supporting exact single-qubit Clifford gates alongside a non-Clifford phase gate. We show that high-precision tuning of ααα is not required for efficient gate compilation, significantly enhancing the physical plausibility of non-semisimple anyonic architectures.
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.
We extend the topological quantum computation scheme using the Pfaffian quantum Hall state, which has been recently proposed by Das Sarma et al., in a way that might potentially allow for the topologically protected construction of a universal set of quantum gates. We construct, for the first time, a topologically protected Controlled-NOT gate which is entirely based on quasihole braidings of Pfaffian qubits. All single-qubit gates, except for the pi/8 gate, are also explicitly implemented by quasihole braidings. Instead of the pi/8 gate we try to construct a topologically protected Toffoli gate, in terms of the Controlled-phase gate and CNOT or by a braid-group based Controlled-Controlled-Z precursor. We also give a topologically protected realization of the Bravyi-Kitaev two-qubit gate g_3.
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. Here, we prove the feasibility of this task, establishing non-Abelian anyons as a viable platform for scalable quantum computation. We thereby focus on Ising anyons as the most prominent example of non-Abelian anyons and show that for these a finite error rate can indeed be corrected continuously. There is a threshold error rate pc>0{p}_{c}>0pc​>0 such that for all error rates p<pcp<{p}_{c}p<pc​ the probability of a logical error per time step can be made exponentially small in the distance of a logical qubit.
We extend the topological quantum computation scheme using the Pfaffian quantum Hall state, which has been recently proposed by Das Sarma et al., in a way that might potentially allow for the topologically protected construction of a universal set of quantum gates. We construct, for the first time, a topologically protected controlled-NOT gate, which is entirely based on quasihole braidings of Pfaffian qubits. All single-qubit gates, except for the $\ensuremath{\pi}∕8$ gate, are also explicitly implemented by quasihole braidings. Instead of the $\ensuremath{\pi}∕8$ gate we try to construct a topologically protected Toffoli gate, in terms of the controlled-phase gate and CNOT or by a braid-group-based controlled-controlled-ZZZ precursor. We also give a topologically protected realization of the Bravyi-Kitaev two-qubit gate g3{g}_{3}g3​.
We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for $n\ensuremath{\ge}3$ qubits we prove that the image of the braid group is a nontrivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.