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:2610.06845

Rewire and reset are all you need: Minimal resources for manipulating non-Abelions

Chiu Fan Bowen Lo, Rohith Sajith, Anasuya Lyons, Ashvin Vishwanath, Ruben Verresen

quant-phcond-mat.str-elSubmitted Oct 5, 2026• Announced Oct 6, 2026• 0 citations
arXivHTMLPDF

Abstract

Braiding and fusing anyons are fundamental to topological quantum computation, yet existing circuit protocols often employ ancillas and measurements. We determine the minimal circuit resources for performing such anyon operations in quantum double models of generic finite groups. Our approach braids anyons through a sequential unitary circuit without ancillas. Intuitively, this is obtained by deforming the underlying graph on which the anyons live. More generally, we introduce graph rewiring, a diagrammatic calculus that assigns a geometric interpretation to individual two-qudit gates and tracks their action on stabilizers. For fusion, we prove a general no-go theorem excluding purely unitary protocols for fusing unknown anyon types without introducing ancillas. Remarkably, we show such "input-agnostic" fusion is enabled by simply using a qudit reset. Hence, contrary to folklore, ancilla resources are not needed to braid or fuse non-Abelian anyons (non-Abelions). This work has implications in experimental efforts in error correction: our fusion protocol highlights reset as an underutilized primitive for error correction without the spacetime-overhead of ancillas and measurements.

AI Summary

The paper asks which circuit resources are needed to braid and fuse anyons in finite-group quantum doubles $D(G)$, distinguishing fusion from read-out of its outcome. It introduces graph rewiring: an individual controlled group-multiplication gate slides an edge endpoint along a neighboring edge, mapping vertex and plaquette operators to those of the modified graph. Gate-conjugation identities establish this correspondence for arbitrary finite $G$, including excited sectors. Rewiring gives ancilla-free unitary circuits for nearest-neighbor charge and flux exchange, each using six controlled multiplications and one single-qudit inversion on the square lattice. Sequential composition implements longer-distance exchanges. For fluxes, the circuit explicitly realizes $|w_1,w_2\rangle\mapsto|w_2,w_2w_1w_2^{-1}\rangle$. A dimension-counting argument rules out purely unitary input-agnostic fusion that always empties the source, including protocols with an ancilla returned to its initial state. Charge and flux fusion instead use an ungauge–reset–regauge construction: three controlled multiplications expose the source on one edge, one unconditional reset removes it, and three inverse gates restore the lattice. Heisenberg-picture projector identities establish exact preservation of fusion-outcome probabilities; full dyon-label tracking for flux fusion assumes specified neighboring vertices are charge-free. Fusion produces no classical outcome record. Reset need not preserve coherence between fusion channels, illustrated explicitly in $D(S_3)$. The constructions concern finite-group quantum doubles, not general string-net theories. Error-correction applications remain prospective: no decoding threshold, fault-tolerant memory protocol, or improved relaxation-time bound is established.

Little sign of AI-generated textOverclaims

Central claim may not hold: The abstract's unrestricted fusion claim exceeds the demonstrated protocols, whose full dyonic-label guarantee assumes five neutral perimeter vertices and is not extended to arbitrary dyonic inputs. The known-source no-go derivation uses a false Frobenius-reciprocity identity, contradicted by the paper's own S3 fusion rules, although the main input-agnostic no-go theorem survives. The purported unitary charge-ribbon circuit contains the generally nonunitary operator Z^Gamma_ij, which cannot become unitary through unitary rewiring.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
20 pages; 58 pages total

Related papers

Reconstructing non-Abelian braiding and fusion without anyon transport

Lucy Byles, Matthew D. Horner, Benjamin T. H. Varcoe +1 more

Non-Abelian anyons offer a route to fault-tolerant and universal quantum computing, but experimental access to their defining braiding and fusion data remains limited by the resource overhead of implementing extended anyonic processes on quantum hardware. Here we introduce and experimentally realise a measurement-only protocol based on temporally ordered ribbon operations that reconstructs the non-Abelian braiding and fusion primitives of the quantum double model $D(S_3)$ without physical anyon transport. We implement a reduced two-qutrit version of the protocol on Quantinuum's H2 trapped-ion processors, realising ancilla-assisted ribbon operations and anyonic charge projections in a qubit encoding. We reconstruct the squared braiding phases and fusion amplitudes using an adapted Hadamard test and post-selected measurements, respectively. The associated braiding and fusion transformations reproduce their ideal actions with average normalised output-state fidelities of $\overline{\mathcal{F}}_{R}=0.9988$ and $\overline{\mathcal{F}}_{F}=0.9987$. Combining these primitives produces a non-Clifford braid and a non-stabilizer resource state, supporting measurement-only anyonic encodings as building blocks for larger topologically encoded quantum processors.

quant-pharXiv:2608.04103•Aug 6, 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•8 citations

Reconstructing non-Abelian braiding and fusion without anyon transport

Jiannis K. Pachos, Lucy Byles, Matthew D. Horner +1 more

Abstract Non-Abelian anyons offer a route to fault-tolerant and universal quantum computing, but experimental access to their defining braiding and fusion data remains limited by the resource overhead of implementing extended anyonic processes on quantum hardware. Here we introduce and experimentally realise a measurement-only protocol based on temporally ordered ribbon operations that reconstructs the non-Abelian braiding and fusion primitives of the quantum double model $D(S_3)$ without physical anyon transport. We implement a reduced two-qutrit version of the protocol on Quantinuum's H2 trapped-ion processors, realising ancilla-assisted ribbon operations and anyonic charge projections in a qubit encoding. We reconstruct the squared braiding phases and fusion amplitudes using an adapted Hadamard test and post-selected measurements, respectively. The associated braiding and fusion transformations reproduce their ideal actions with average normalised output-state fidelities of $\overline{\mathcal{F}}_{R}=0.9988$ and $\overline{\mathcal{F}}_{F}=0.9987$. Combining these primitives produces a non-Clifford braid and a non-stabilizer resource state, supporting measurement-only anyonic encodings as building blocks for larger topologically encoded quantum processors.

•Sep 9, 2026•0 citations

Non-Abelian braiding of graph vertices in a superconducting processor

Google Quantum AI and Collaborators, Trond I. Andersen, Yuri D. Lensky +97 more

Abstract Indistinguishability of particles is a fundamental principle of quantum mechanics 1 . For all elementary and quasiparticles observed to date—including fermions, bosons and Abelian anyons—this principle guarantees that the braiding of identical particles leaves the system unchanged 2,3 . However, in two spatial dimensions, an intriguing possibility exists: braiding of non-Abelian anyons causes rotations in a space of topologically degenerate wavefunctions 4–8 . Hence, it can change the observables of the system without violating the principle of indistinguishability. Despite the well-developed mathematical description of non-Abelian anyons and numerous theoretical proposals 9–22 , the experimental observation of their exchange statistics has remained elusive for decades. Controllable many-body quantum states generated on quantum processors offer another path for exploring these fundamental phenomena. Whereas efforts on conventional solid-state platforms typically involve Hamiltonian dynamics of quasiparticles, superconducting quantum processors allow for directly manipulating the many-body wavefunction by means of unitary gates. Building on predictions that stabilizer codes can host projective non-Abelian Ising anyons 9,10 , we implement a generalized stabilizer code and unitary protocol 23 to create and braid them. This allows us to experimentally verify the fusion rules of the anyons and braid them to realize their statistics. We then study the prospect of using the anyons for quantum computation and use braiding to create an entangled state of anyons encoding three logical qubits. Our work provides new insights about non-Abelian braiding and, through the future inclusion of error correction to achieve topological protection, could open a path towards fault-tolerant quantum computing.

arXiv:2210.10255•Nature•May 11, 2023•148 citations

Systematic Computation of Braid Generator Matrix in Topological Quantum Computing

Abdellah Tounsi, Nacer Eddine Belaloui, Mohamed Messaoud Louamri +3 more

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$. Braiding non-abelian anyons is the essence of TQC, offering a topologically protected implementation of quantum gates. However, obtaining elementary braid matrix representations starting from the fusion and rotation matrices of a specific anyon model is {theoretically guarenteed but no numerical method is given, especially for systems with numerous anyons and complex fusion patterns. Our proposed method addresses this challenge, first in the special case of sparse encoding, allowing for the inclusion of an arbitrary number of anyons per qudit, {and in the general case}. This is accomplished by introducing two methods, one is based on a novel braiding move we call knitting, {the second introduces more general algorithm which is optimal in number of required moves}. The method plays a key role in a broad topological quantum circuit simulator, enabling the examination and study of complex quantum circuits within the TQC framework. Importantly, it proves effective across various anyonic models, accommodating diverse fusion rules. We validate the method by simulating an approximated CNOT gate and present a first-of-a-kind GHZ state simulation on five qubits using three Fibonacci anyons per qubit.

arXiv:2307.01892•Jul 4, 2023•3 citations

Non-Abelian braiding of Fibonacci anyons with a superconducting processor

Shibo Xu, Zheng-Zhi Sun, Ke Wang +29 more

Abstract Quantum many-body systems with a non-Abelian topological order can host anyonic quasiparticles. It has been proposed that anyons could be used to encode and manipulate information in a topologically protected manner that is immune to local noise, with quantum gates performed by braiding and fusing anyons. Unfortunately, realizing non-Abelian topologically ordered states is challenging, and it was not until recently that the signatures of non-Abelian statistics were observed through digital quantum simulation approaches. However, not all forms of topological order can be used to realize universal quantum computation. Here we use a superconducting quantum processor to simulate non-Abelian topologically ordered states of the Fibonacci string-net model and demonstrate braidings of Fibonacci anyons featuring universal computational power. We demonstrate the non-trivial topological nature of the quantum states by measuring the topological entanglement entropy. In addition, we create two pairs of Fibonacci anyons and demonstrate their fusion rule and non-Abelian braiding statistics by applying unitary gates on the underlying physical qubits. Our results establish a digital approach to explore non-Abelian topological states and their associated braiding statistics with current noisy intermediate-scale quantum processors.

arXiv:2404.00091•Nature Physics•Jul 1, 2024•70 citations
Braiding and fusing anyons are fundamental to topological quantum computation, yet existing circuit protocols often employ ancillas and measurements. We determine the minimal circuit resources for performing such anyon operations in quantum double models of generic finite groups. Our approach braids anyons through a sequential unitary circuit without ancillas. Intuitively, this is obtained by deforming the underlying graph on which the anyons live. More generally, we introduce graph rewiring, a diagrammatic calculus that assigns a geometric interpretation to individual two-qudit gates and tracks their action on stabilizers. For fusion, we prove a general no-go theorem excluding purely unitary protocols for fusing unknown anyon types without introducing ancillas. Remarkably, we show such "input-agnostic" fusion is enabled by simply using a qudit reset. Hence, contrary to folklore, ancilla resources are not needed to braid or fuse non-Abelian anyons (non-Abelions). This work has implications in experimental efforts in error correction: our fusion protocol highlights reset as an underutilized primitive for error correction without the spacetime-overhead of ancillas and measurements.
The paper asks which circuit resources are needed to braid and fuse anyons in finite-group quantum doubles D(G)D(G)D(G), distinguishing fusion from read-out of its outcome. It introduces graph rewiring: an individual controlled group-multiplication gate slides an edge endpoint along a neighboring edge, mapping vertex and plaquette operators to those of the modified graph. Gate-conjugation identities establish this correspondence for arbitrary finite GGG, including excited sectors.
Rewiring gives ancilla-free unitary circuits for nearest-neighbor charge and flux exchange, each using six controlled multiplications and one single-qudit inversion on the square lattice. Sequential composition implements longer-distance exchanges. For fluxes, the circuit explicitly realizes ∣w1,w2⟩↦∣w2,w2w1w2−1⟩|w_1,w_2\rangle\mapsto|w_2,w_2w_1w_2^{-1}\rangle∣w1​,w2​⟩↦∣w2​,w2​w1​w2−1​⟩. A dimension-counting argument rules out purely unitary input-agnostic fusion that always empties the source, including protocols with an ancilla returned to its initial state.
Charge and flux fusion instead use an ungauge–reset–regauge construction: three controlled multiplications expose the source on one edge, one unconditional reset removes it, and three inverse gates restore the lattice. Heisenberg-picture projector identities establish exact preservation of fusion-outcome probabilities; full dyon-label tracking for flux fusion assumes specified neighboring vertices are charge-free. Fusion produces no classical outcome record.
Reset need not preserve coherence between fusion channels, illustrated explicitly in D(S3)D(S_3)D(S3​). The constructions concern finite-group quantum doubles, not general string-net theories. Error-correction applications remain prospective: no decoding threshold, fault-tolerant memory protocol, or improved relaxation-time bound is established.
Non-Abelian anyons offer a route to fault-tolerant and universal quantum computing, but experimental access to their defining braiding and fusion data remains limited by the resource overhead of implementing extended anyonic processes on quantum hardware. Here we introduce and experimentally realise a measurement-only protocol based on temporally ordered ribbon operations that reconstructs the non-Abelian braiding and fusion primitives of the quantum double model D(S3)D(S_3)D(S3​) without physical anyon transport. We implement a reduced two-qutrit version of the protocol on Quantinuum's H2 trapped-ion processors, realising ancilla-assisted ribbon operations and anyonic charge projections in a qubit encoding. We reconstruct the squared braiding phases and fusion amplitudes using an adapted Hadamard test and post-selected measurements, respectively. The associated braiding and fusion transformations reproduce their ideal actions with average normalised output-state fidelities of F‾R=0.9988\overline{\mathcal{F}}_{R}=0.9988FR​=0.9988 and F‾F=0.9987\overline{\mathcal{F}}_{F}=0.9987FF​=0.9987. Combining these primitives produces a non-Clifford braid and a non-stabilizer resource state, supporting measurement-only anyonic encodings as building blocks for larger topologically encoded quantum processors.
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.
Abstract Non-Abelian anyons offer a route to fault-tolerant and universal quantum computing, but experimental access to their defining braiding and fusion data remains limited by the resource overhead of implementing extended anyonic processes on quantum hardware. Here we introduce and experimentally realise a measurement-only protocol based on temporally ordered ribbon operations that reconstructs the non-Abelian braiding and fusion primitives of the quantum double model D(S3)D(S_3)D(S3​) without physical anyon transport. We implement a reduced two-qutrit version of the protocol on Quantinuum's H2 trapped-ion processors, realising ancilla-assisted ribbon operations and anyonic charge projections in a qubit encoding. We reconstruct the squared braiding phases and fusion amplitudes using an adapted Hadamard test and post-selected measurements, respectively. The associated braiding and fusion transformations reproduce their ideal actions with average normalised output-state fidelities of F‾R=0.9988\overline{\mathcal{F}}_{R}=0.9988FR​=0.9988 and F‾F=0.9987\overline{\mathcal{F}}_{F}=0.9987FF​=0.9987. Combining these primitives produces a non-Clifford braid and a non-stabilizer resource state, supporting measurement-only anyonic encodings as building blocks for larger topologically encoded quantum processors.
Abstract Indistinguishability of particles is a fundamental principle of quantum mechanics 1 . For all elementary and quasiparticles observed to date—including fermions, bosons and Abelian anyons—this principle guarantees that the braiding of identical particles leaves the system unchanged 2,3 . However, in two spatial dimensions, an intriguing possibility exists: braiding of non-Abelian anyons causes rotations in a space of topologically degenerate wavefunctions 4–8 . Hence, it can change the observables of the system without violating the principle of indistinguishability. Despite the well-developed mathematical description of non-Abelian anyons and numerous theoretical proposals 9–22 , the experimental observation of their exchange statistics has remained elusive for decades. Controllable many-body quantum states generated on quantum processors offer another path for exploring these fundamental phenomena. Whereas efforts on conventional solid-state platforms typically involve Hamiltonian dynamics of quasiparticles, superconducting quantum processors allow for directly manipulating the many-body wavefunction by means of unitary gates. Building on predictions that stabilizer codes can host projective non-Abelian Ising anyons 9,10 , we implement a generalized stabilizer code and unitary protocol 23 to create and braid them. This allows us to experimentally verify the fusion rules of the anyons and braid them to realize their statistics. We then study the prospect of using the anyons for quantum computation and use braiding to create an entangled state of anyons encoding three logical qubits. Our work provides new insights about non-Abelian braiding and, through the future inclusion of error correction to achieve topological protection, could open a path towards fault-tolerant quantum computing.
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)kSU(2)_kSU(2)k​. Braiding non-abelian anyons is the essence of TQC, offering a topologically protected implementation of quantum gates. However, obtaining elementary braid matrix representations starting from the fusion and rotation matrices of a specific anyon model is {theoretically guarenteed but no numerical method is given, especially for systems with numerous anyons and complex fusion patterns. Our proposed method addresses this challenge, first in the special case of sparse encoding, allowing for the inclusion of an arbitrary number of anyons per qudit, {and in the general case}. This is accomplished by introducing two methods, one is based on a novel braiding move we call knitting, {the second introduces more general algorithm which is optimal in number of required moves}. The method plays a key role in a broad topological quantum circuit simulator, enabling the examination and study of complex quantum circuits within the TQC framework. Importantly, it proves effective across various anyonic models, accommodating diverse fusion rules. We validate the method by simulating an approximated CNOT gate and present a first-of-a-kind GHZ state simulation on five qubits using three Fibonacci anyons per qubit.
Abstract Quantum many-body systems with a non-Abelian topological order can host anyonic quasiparticles. It has been proposed that anyons could be used to encode and manipulate information in a topologically protected manner that is immune to local noise, with quantum gates performed by braiding and fusing anyons. Unfortunately, realizing non-Abelian topologically ordered states is challenging, and it was not until recently that the signatures of non-Abelian statistics were observed through digital quantum simulation approaches. However, not all forms of topological order can be used to realize universal quantum computation. Here we use a superconducting quantum processor to simulate non-Abelian topologically ordered states of the Fibonacci string-net model and demonstrate braidings of Fibonacci anyons featuring universal computational power. We demonstrate the non-trivial topological nature of the quantum states by measuring the topological entanglement entropy. In addition, we create two pairs of Fibonacci anyons and demonstrate their fusion rule and non-Abelian braiding statistics by applying unitary gates on the underlying physical qubits. Our results establish a digital approach to explore non-Abelian topological states and their associated braiding statistics with current noisy intermediate-scale quantum processors.