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.05901

Fusion-assisted decoding of non-Abelian topological order

Rohith Sajith, Yabo Li, Zijian Song, Tsung-Cheng Lu, Carolyn Zhang

quant-phSubmitted Oct 5, 2026• Announced Oct 6, 2026• 3 citations
arXivHTMLPDF

Abstract

Maximum likelihood (ML) decoders perform quantum error correction by measuring a set of syndromes, classically computing an optimal recovery based on these syndromes and the noise model, and then performing that recovery. ML decoders are well understood for the toric code and generalize straightforwardly to other surface codes with Abelian anyons, where they can saturate information-theoretic decoding thresholds. On the other hand, codes with non-Abelian anyons have become increasingly relevant because they can support transversal or constant-depth non-Clifford gates and admit efficient preparation protocols in modern quantum devices. However, they present new challenges for decoding: non-Abelian anyons cannot in general be deterministically annihilated, and the logical operators cannot be classified by Abelian homology. In this work, we show that refined syndrome sets, including measurements that resolve non-Abelian anyon fusion outcomes, systematically improve the performance of ML decoders. We demonstrate this concretely by constructing explicit decoders for the $D_4$ quantum double model under charge noise, and obtaining numerical results for thresholds via mappings to classical statistical-mechanics models. We show that there is a nonzero noise threshold below which the entire logical qudit can be recovered with a single round of measurements.

AI Summary

Non-Abelian topological memories require decoding information beyond local anyon positions: collective fusion states affect recovery, while fusion measurements can themselves reveal logical information. This paper develops syndrome-dependent maximum-likelihood decoding for quantum-double models under charge noise, specializing to independent non-Abelian $E$-charge noise in the $D_4$ model on a cylinder. The five-dimensional ground space contains a protected “central qubit” associated with the group center. Three nested syndrome records resolve $E$ positions, all onsite charges, and additionally pair-fusion outcomes along matching-selected paths. Exact syndrome probabilities and winding-sector weights map to classical statistical-mechanics partition functions. Sampling physical syndrome records and contracting these partition functions exactly gives estimated central-qubit thresholds $p_c^{(1)}\simeq0.111$, $p_c^{(2)}\simeq0.165$, and $p_c^{(3)}\simeq0.214$. Abelian grading extends the central-sector construction to other groups with nontrivial centers. Path-dependent fusion measurements preserve the central qubit but can measure noncentral logical sectors when recovery paths close noncontractibly with physical errors. A construction also argues for full-qudit recovery below a matching threshold, quoting $p_{\mathrm{full}}\geq p_{\mathrm{HMWPM}}\geq p_{\mathrm{MWPM}}\simeq0.103$, with Abelian-cleanup confinement assumed. Here “single-shot” means one syndrome-measurement stage with potentially nonlocal fusion measurements and perfect measurements and recovery—not tolerance to measurement noise. The explicit threshold improvements concern a restricted charge-noise model and logical subspace; flux noise, efficient likelihood evaluation, and broader optimal recovery remain open. Rényi-2 coherent-information calculations indicate a transition near $p\simeq0.45$–$0.46$ for both logical inputs, but do not establish the intrinsic von Neumann or optimal-recovery thresholds.

Little sign of AI-generated textStrong assumptionsOverclaims

Central claim may not hold: The advertised full-qudit single-round recovery result, particularly the bound p_full ≥ p_HMWPM ≥ 0.103, relies on an explicitly unestablished confinement assumption for Abelian cleanup, while the measurement-reordering identity alone does not establish that assumption or the threshold bound.

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

Comments
29 + 32 pages, 16 + 1 figures

Related papers

Integer Linear Programming Decoder for Abelian and Non-Abelian Topological Codes

Dian Jing, Aubrey Zhang, Liang Jiang +1 more

Topological orders (TOs) are widely used as quantum error-correcting codes, with anyon excitations serving as error syndromes. For certain Abelian TOs, decoding can be performed by independently matching particle-antiparticle pairs of each species. However, matching-based decoders cannot handle more general fusion rules in either Abelian or non-Abelian TOs, nor account for noise that correlates different anyon species. While clustering decoders are more broadly applicable, they typically neglect anyon data and fusion properties, leading to poor performance in practice. In this work, we introduce a fundamentally different decoder for arbitrary TOs based on integer linear programming (ILP). The ILP formulation linearizes the error-correction problem through the introduction of auxiliary variables and encodes fusion rules as linear constraints. Classical optimization then identifies the minimum-weight error configuration. As concrete examples, we determine error-correction thresholds for three TOs: the Abelian $\mathbb{Z}_2$ TO under depolarizing noise, where charge and flux errors are correlated; the Abelian $\mathbb{Z}_3$ TO, which does not admit a pairwise matching decoder; and the non-Abelian $D_4$ TO under noise channels that generate all anyon species. We demonstrate the versatility of the ILP decoder by showing a clear performance advantage over most existing decoders in all three cases. We further extend the method to incorporate noisy syndrome measurements and propose a just-in-time variant for continuous error correction. Our results establish ILP as a natural framework for handling correlated errors and general anyon fusion rules, and as a powerful and flexible general-purpose decoder for incoherent anyon noise in arbitrary TOs, with applications to fault-tolerant quantum computation.

quant-pharXiv:2608.18512•Aug 20, 2026•8 citations

Intrinsic Heralding and Optimal Decoders for Non-Abelian Topological Order

Dian Jing, Pablo Sala, Liang Jiang +1 more

Topological order (TO) provides a natural platform for storing and manipulating quantum information. However, its stability to noise has only been systematically understood for Abelian TOs. In this Letter, we exploit the nondeterministic fusion of non-Abelian anyons to inform active error-correction and design decoders where the fusion products, instead of flag qubits, herald the noise. This intrinsic heralding offers improved thresholds over those of Abelian counterparts. Furthermore, we use Bayesian inference to obtain a statistical mechanics model for fixed-point non-Abelian TOs with perfect measurements under any noise model, which yields the optimal threshold conditioned on measuring anyon syndromes. We numerically illustrate these results for D_{4}≅Z_{4}⋊Z_{2} TO. In particular, for non-Abelian charge noise and perfect syndrome measurement, we find a conditioned optimal threshold p_{c}=0.218(1), whereas an intrinsically heralded minimum-weight perfect matching (MWPM) decoder already gives p_{c}=0.208 42(2), outperforming standard honeycomb-lattice MWPM with p_{c}=0.158 60(1). Our Letter highlights how non-Abelian properties can enhance stability, rather than reduce it, and discusses potential generalizations for achieving fault tolerance.

arXiv:2507.23765•Physical Review Letters•Mar 6, 2026•12 citations

Statistical Mechanics and Symmetries of Non-Abelian Anyon Proliferation: From Deformation to Decoherence

Avi Vadali, Robijn Vanhove, Ruben Verresen +2 more

Topological quantum computation relies on braiding non-Abelian anyons, but requires the underlying topological order to survive imperfect state preparation and environmental noise. We show that the instability of topological order to wavefunction deformations and to decoherence, with the latter probed by syndrome distributions, is generically captured by stat-mech models whose $G\times \textrm{Rep}(G)$ symmetry naturally exposes the corrupting anyonic excitations. As an example, we combine this framework with Monte-Carlo simulations to resolve the stability of $D_4$ topological order under deformations and quantum channels that proliferate multiple non-Abelian anyon species that are individually unable to condense. We show that beyond a finite threshold, proliferation of two non-Abelian anyon species parasitically condenses a shared Abelian-anyon fusion outcome---destroying the topological order. Our symmetry-based approach suggests the resulting trivial phase is distinct from that obtained by condensing all Abelian anyons; in other words, the trivial phase "remembers" which anyons condensed. This framework provides a first step into identifying the relevant symmetry for optimal decoders, conditioned on syndrome measurements, of non-Abelian topological order.

quant-pharXiv:2606.12527•Jun 12, 2026•11 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

Improved HDRG decoders for qudit and non-Abelian quantum error correction

Adrian Hutter, Daniel Loss, James R. Wootton

Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, qudit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strengths of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size L from to for any We apply our algorithm to decoding quantum double models and a non-Abelian anyon model with Fibonacci-like fusion rules, and show that it indeed significantly outperforms previous HDRG decoders. Furthermore, we provide the first study of continuous error correction with imperfect syndrome measurements for the quantum double models. The parallelized runtime of our algorithm is for the perfect measurement case. In the continuous case with imperfect syndrome measurements, the averaged runtime is for Abelian systems, while continuous error correction for non-Abelian anyons stays an open problem.

arXiv:1410.4478•New Journal of Physics•Mar 31, 2015•43 citations

Mixed-state topological order and error-correction thresholds in non-Abelian codes: rigorous results

Sun Woo P. Kim, Max McGinley

We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise. Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes, including surface codes, non-Abelian quantum doubles, and string-net codes. In each case, we prove that for noise strengths up to some explicit constant value, any initially encoded logical information can be recovered to high precision, and that the noise-corrupted state exhibits key hallmarks of mixed-state topological order: long-range entanglement and emergent higher-form symmetries. We also describe how these methods can be adapted to higher dimensions and correlated noise models.

quant-pharXiv:2607.21706•Jul 27, 2026•3 citations
Maximum likelihood (ML) decoders perform quantum error correction by measuring a set of syndromes, classically computing an optimal recovery based on these syndromes and the noise model, and then performing that recovery. ML decoders are well understood for the toric code and generalize straightforwardly to other surface codes with Abelian anyons, where they can saturate information-theoretic decoding thresholds. On the other hand, codes with non-Abelian anyons have become increasingly relevant because they can support transversal or constant-depth non-Clifford gates and admit efficient preparation protocols in modern quantum devices. However, they present new challenges for decoding: non-Abelian anyons cannot in general be deterministically annihilated, and the logical operators cannot be classified by Abelian homology. In this work, we show that refined syndrome sets, including measurements that resolve non-Abelian anyon fusion outcomes, systematically improve the performance of ML decoders. We demonstrate this concretely by constructing explicit decoders for the D4D_4D4​ quantum double model under charge noise, and obtaining numerical results for thresholds via mappings to classical statistical-mechanics models. We show that there is a nonzero noise threshold below which the entire logical qudit can be recovered with a single round of measurements.
Non-Abelian topological memories require decoding information beyond local anyon positions: collective fusion states affect recovery, while fusion measurements can themselves reveal logical information. This paper develops syndrome-dependent maximum-likelihood decoding for quantum-double models under charge noise, specializing to independent non-Abelian EEE-charge noise in the D4D_4D4​ model on a cylinder.
The five-dimensional ground space contains a protected “central qubit” associated with the group center. Three nested syndrome records resolve EEE positions, all onsite charges, and additionally pair-fusion outcomes along matching-selected paths. Exact syndrome probabilities and winding-sector weights map to classical statistical-mechanics partition functions. Sampling physical syndrome records and contracting these partition functions exactly gives estimated central-qubit thresholds pc(1)≃0.111p_c^{(1)}\simeq0.111pc(1)​≃0.111, pc(2)≃0.165p_c^{(2)}\simeq0.165pc(2)​≃0.165, and pc(3)≃0.214p_c^{(3)}\simeq0.214pc(3)​≃0.214. Abelian grading extends the central-sector construction to other groups with nontrivial centers.
Path-dependent fusion measurements preserve the central qubit but can measure noncentral logical sectors when recovery paths close noncontractibly with physical errors. A construction also argues for full-qudit recovery below a matching threshold, quoting pfull≥pHMWPM≥pMWPM≃0.103p_{\mathrm{full}}\geq p_{\mathrm{HMWPM}}\geq p_{\mathrm{MWPM}}\simeq0.103pfull​≥pHMWPM​≥pMWPM​≃0.103, with Abelian-cleanup confinement assumed. Here “single-shot” means one syndrome-measurement stage with potentially nonlocal fusion measurements and perfect measurements and recovery—not tolerance to measurement noise.
The explicit threshold improvements concern a restricted charge-noise model and logical subspace; flux noise, efficient likelihood evaluation, and broader optimal recovery remain open. Rényi-2 coherent-information calculations indicate a transition near p≃0.45p\simeq0.45p≃0.45–0.460.460.46 for both logical inputs, but do not establish the intrinsic von Neumann or optimal-recovery thresholds.
Topological orders (TOs) are widely used as quantum error-correcting codes, with anyon excitations serving as error syndromes. For certain Abelian TOs, decoding can be performed by independently matching particle-antiparticle pairs of each species. However, matching-based decoders cannot handle more general fusion rules in either Abelian or non-Abelian TOs, nor account for noise that correlates different anyon species. While clustering decoders are more broadly applicable, they typically neglect anyon data and fusion properties, leading to poor performance in practice. In this work, we introduce a fundamentally different decoder for arbitrary TOs based on integer linear programming (ILP). The ILP formulation linearizes the error-correction problem through the introduction of auxiliary variables and encodes fusion rules as linear constraints. Classical optimization then identifies the minimum-weight error configuration. As concrete examples, we determine error-correction thresholds for three TOs: the Abelian Z2\mathbb{Z}_2Z2​ TO under depolarizing noise, where charge and flux errors are correlated; the Abelian Z3\mathbb{Z}_3Z3​ TO, which does not admit a pairwise matching decoder; and the non-Abelian D4D_4D4​ TO under noise channels that generate all anyon species. We demonstrate the versatility of the ILP decoder by showing a clear performance advantage over most existing decoders in all three cases. We further extend the method to incorporate noisy syndrome measurements and propose a just-in-time variant for continuous error correction. Our results establish ILP as a natural framework for handling correlated errors and general anyon fusion rules, and as a powerful and flexible general-purpose decoder for incoherent anyon noise in arbitrary TOs, with applications to fault-tolerant quantum computation.
Topological order (TO) provides a natural platform for storing and manipulating quantum information. However, its stability to noise has only been systematically understood for Abelian TOs. In this Letter, we exploit the nondeterministic fusion of non-Abelian anyons to inform active error-correction and design decoders where the fusion products, instead of flag qubits, herald the noise. This intrinsic heralding offers improved thresholds over those of Abelian counterparts. Furthermore, we use Bayesian inference to obtain a statistical mechanics model for fixed-point non-Abelian TOs with perfect measurements under any noise model, which yields the optimal threshold conditioned on measuring anyon syndromes. We numerically illustrate these results for D_{4}≅Z_{4}⋊Z_{2} TO. In particular, for non-Abelian charge noise and perfect syndrome measurement, we find a conditioned optimal threshold p_{c}=0.218(1), whereas an intrinsically heralded minimum-weight perfect matching (MWPM) decoder already gives p_{c}=0.208 42(2), outperforming standard honeycomb-lattice MWPM with p_{c}=0.158 60(1). Our Letter highlights how non-Abelian properties can enhance stability, rather than reduce it, and discusses potential generalizations for achieving fault tolerance.
Topological quantum computation relies on braiding non-Abelian anyons, but requires the underlying topological order to survive imperfect state preparation and environmental noise. We show that the instability of topological order to wavefunction deformations and to decoherence, with the latter probed by syndrome distributions, is generically captured by stat-mech models whose G×Rep(G)G\times \textrm{Rep}(G)G×Rep(G) symmetry naturally exposes the corrupting anyonic excitations. As an example, we combine this framework with Monte-Carlo simulations to resolve the stability of D4D_4D4​ topological order under deformations and quantum channels that proliferate multiple non-Abelian anyon species that are individually unable to condense. We show that beyond a finite threshold, proliferation of two non-Abelian anyon species parasitically condenses a shared Abelian-anyon fusion outcome---destroying the topological order. Our symmetry-based approach suggests the resulting trivial phase is distinct from that obtained by condensing all Abelian anyons; in other words, the trivial phase "remembers" which anyons condensed. This framework provides a first step into identifying the relevant symmetry for optimal decoders, conditioned on syndrome measurements, of non-Abelian topological order.
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.
Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, qudit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strengths of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size L from to for any We apply our algorithm to decoding quantum double models and a non-Abelian anyon model with Fibonacci-like fusion rules, and show that it indeed significantly outperforms previous HDRG decoders. Furthermore, we provide the first study of continuous error correction with imperfect syndrome measurements for the quantum double models. The parallelized runtime of our algorithm is for the perfect measurement case. In the continuous case with imperfect syndrome measurements, the averaged runtime is for Abelian systems, while continuous error correction for non-Abelian anyons stays an open problem.
We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise. Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes, including surface codes, non-Abelian quantum doubles, and string-net codes. In each case, we prove that for noise strengths up to some explicit constant value, any initially encoded logical information can be recovered to high precision, and that the noise-corrupted state exhibits key hallmarks of mixed-state topological order: long-range entanglement and emergent higher-form symmetries. We also describe how these methods can be adapted to higher dimensions and correlated noise models.