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

Universal Quantum Computation with the $S_3$ Quantum Double: A Pedagogical Exposition

Lo, Chiu Fan Bowen, Alex Lyons, Ruben Verresen, Ashvin Vishwanath, Nathanan Tantivasadakarn

Published Feb 20, 2025• 0 citations
arXivHTMLPDF

Abstract

Non-Abelian topological order (TO) enables topologically protected quantum computation with its anyonic quasiparticles. Recently, TO with $S_3$ gauge symmetry was identified as a sweet spot -- simple enough to emerge from finite-depth adaptive circuits yet powerful enough to support a universal topological gate-set. In these notes, we review how anyon braiding and measurement in $S_3$ TO are primitives for topological quantum computation and we explicitly demonstrate universality. These topological operations are made concrete in the $S_3$ quantum double lattice model, aided by the introduction of a generalized ribbon operator. This provides a roadmap for near-term quantum platforms.

DOI
10.48550/arxiv.2502.14974

Related papers

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

A universal circuit set using the S3 quantum double

Liyuan Chen, Yuanjie Ren, Ruihua Fan +1 more

One potential route toward fault-tolerant universal quantum computation is to use non-Abelian topological codes. In this work, we investigate how to achieve this goal with the quantum double model $${\mathcal{D}}({S}_{3})$$ . By embedding each on-site Hilbert space into a qubit-qutrit pair, we explicitly construct circuits for creating, moving, and locally measuring all non-trivial anyons. We also design a specialized anyon interferometer to remotely measure the total charge of well-separated anyons; this avoids fusion, which compromises fault tolerance. These protocols enable the implementation of a universal gate set proposed by Cui et al. and active correction of the circuit-level noise during computation. To further suppress errors, we encode each physical degree of freedom of $${\mathcal{D}}({S}_{3})$$ into a novel error-correcting code, enabling fault-tolerant realization, at the logical level, of all gates in the anyon manipulation circuits. Our proposal offers a promising path to realize robust universal topological quantum computation in the NISQ era.

arXiv:2411.09697•npj Quantum Information•Jul 3, 2025•5 citations

Non-Abelian Anyons and Topological Phases: Quantum Computation and Quantum Simulation

Liyuan Chen

A central challenge at the intersection of quantum condensed-matter physics and quantum information science is to understand how exotic topological phases and quantum resources govern the power of quantum computation and simulation---and to translate that understanding into practical architectures. This thesis contributes to this program along three interconnected directions: enabling fault-tolerant universal quantum computation with non-Abelian topological order, establishing the fundamental computational reach of near-term analog quantum simulators, and delineating the boundary between classical and quantum computational power through the lenses of topology and magic. In the first direction, drawing on the structure of non-Abelian topological order, we address the dominant resource overhead in current quantum computing architectures---magic-state distillation---by moving beyond the standard stabilizer formalism entirely. We construct a comprehensive framework for fault-tolerant universal quantum computation based on the non-Abelian quantum double model $\mathcal{D}(S_3)$, with all operations realized on qubit--qutrit degrees of freedom in a planar, geometrically local architecture feasible on all current experimental platforms. This work addresses the long-standing open question of realizable, fault-tolerant universal topological quantum computation. In the second direction, we establish the computational universality of analog quantum simulators operating under global control---platforms that circumvent the demanding requirements of digitization and individual addressability. We prove a necessary and sufficient condition for universality in globally controlled qubit chains, showing that widely used platforms such as Rydberg atom arrays and trapped ions are generically universal once lattice reflection symmetry is broken. We further derive sufficient conditions for universality in fermionic and bosonic optical superlattices. As an experimental demonstration of this framework, we realize the dynamics of the cluster-state $ZXZ$ model---an exemplar of symmetry-protected topological order---in Rydberg atom arrays, validating the theoretical foundation. In the third direction, we sharpen the classical--quantum computational boundary from both sides. We show that non-Abelian Majorana braiding realized in classical mechanical metamaterials admits a faithful classical simulation, establishing that braiding-only architectures are classically simulable without supplementary non-Clifford resources. Conversely, we prove that random matrix product states carry magic growing exponentially with system size, demonstrating that generic one-dimensional many-body states harbor ample non-stabilizer resources. Together, these results delineate precisely where genuine quantum advantage emerges in topological and many-body systems. Taken as a whole, this thesis leverages the convergence of topological matter and quantum information to remove key bottlenecks toward fault-tolerant quantum computation, to place near-term quantum simulation on rigorous footing, and to clarify the fundamental resources that separate classical from quantum computational power.

•Jan 1, 2026•0 citations

Quantum doubles in symmetric blockade structures

Hans Peter Büchler, Tobias F. Maier, Simon Fell +1 more

Exactly solvable models of topologically ordered phases with non-abelian anyons typically require complicated many-body interactions which do not naturally appear in nature. This motivates the "inverse problem" of quantum many-body physics: given microscopic systems with experimentally realistic two-body interactions, how to design a Hamiltonian that realizes a desired topological phase? Here we solve this problem on a platform motivated by Rydberg atoms, where elementary two-level systems couple via simple blockade interactions. Within this framework, we construct Hamiltonians that realize topological orders described by non-abelian quantum double models. We analytically prove the existence of topological order in the ground state, and present efficient schemes to prepare these states. We also introduce protocols for the controlled adiabatic braiding of anyonic excitations to probe their non-abelian statistics. Our construction is generic and applies to quantum doubles $\mathcal{D}(G)$ for arbitrary finite groups $G$. We illustrate braiding for the simplest non-abelian quantum double $\mathcal{D}(S_3)$.

quant-pharXiv:2511.04414•Physical review. B./Physical review. B•Nov 7, 2025•0 citations

Introduction to topological quantum computation with non-Abelian anyons

Bernard Field, Tapio Simula

Abstract Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots. In addition to simulating a modular circuit-style quantum algorithm, we also show how the magnitude of the Jones polynomial at specific points could be obtained exactly using Fibonacci or Ising anyons. Such an exact algorithm seems ideally suited for a proof of concept demonstration of a topological quantum computer.

arXiv:1802.06176•Quantum Science and Technology•Jun 6, 2018•135 citations

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 Quantum Computation with the S3S_3S3​ Quantum Double: A Pedagogical Exposition
Non-Abelian topological order (TO) enables topologically protected quantum computation with its anyonic quasiparticles. Recently, TO with S3S_3S3​ gauge symmetry was identified as a sweet spot -- simple enough to emerge from finite-depth adaptive circuits yet powerful enough to support a universal topological gate-set. In these notes, we review how anyon braiding and measurement in S3S_3S3​ TO are primitives for topological quantum computation and we explicitly demonstrate universality. These topological operations are made concrete in the S3S_3S3​ quantum double lattice model, aided by the introduction of a generalized ribbon operator. This provides a roadmap for near-term quantum platforms.
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.
One potential route toward fault-tolerant universal quantum computation is to use non-Abelian topological codes. In this work, we investigate how to achieve this goal with the quantum double model D(S3){\mathcal{D}}({S}_{3})D(S3​) . By embedding each on-site Hilbert space into a qubit-qutrit pair, we explicitly construct circuits for creating, moving, and locally measuring all non-trivial anyons. We also design a specialized anyon interferometer to remotely measure the total charge of well-separated anyons; this avoids fusion, which compromises fault tolerance. These protocols enable the implementation of a universal gate set proposed by Cui et al. and active correction of the circuit-level noise during computation. To further suppress errors, we encode each physical degree of freedom of D(S3){\mathcal{D}}({S}_{3})D(S3​) into a novel error-correcting code, enabling fault-tolerant realization, at the logical level, of all gates in the anyon manipulation circuits. Our proposal offers a promising path to realize robust universal topological quantum computation in the NISQ era.
A central challenge at the intersection of quantum condensed-matter physics and quantum information science is to understand how exotic topological phases and quantum resources govern the power of quantum computation and simulation---and to translate that understanding into practical architectures. This thesis contributes to this program along three interconnected directions: enabling fault-tolerant universal quantum computation with non-Abelian topological order, establishing the fundamental computational reach of near-term analog quantum simulators, and delineating the boundary between classical and quantum computational power through the lenses of topology and magic. In the first direction, drawing on the structure of non-Abelian topological order, we address the dominant resource overhead in current quantum computing architectures---magic-state distillation---by moving beyond the standard stabilizer formalism entirely. We construct a comprehensive framework for fault-tolerant universal quantum computation based on the non-Abelian quantum double model D(S3)\mathcal{D}(S_3)D(S3​), with all operations realized on qubit--qutrit degrees of freedom in a planar, geometrically local architecture feasible on all current experimental platforms. This work addresses the long-standing open question of realizable, fault-tolerant universal topological quantum computation. In the second direction, we establish the computational universality of analog quantum simulators operating under global control---platforms that circumvent the demanding requirements of digitization and individual addressability. We prove a necessary and sufficient condition for universality in globally controlled qubit chains, showing that widely used platforms such as Rydberg atom arrays and trapped ions are generically universal once lattice reflection symmetry is broken. We further derive sufficient conditions for universality in fermionic and bosonic optical superlattices. As an experimental demonstration of this framework, we realize the dynamics of the cluster-state ZXZZXZZXZ model---an exemplar of symmetry-protected topological order---in Rydberg atom arrays, validating the theoretical foundation. In the third direction, we sharpen the classical--quantum computational boundary from both sides. We show that non-Abelian Majorana braiding realized in classical mechanical metamaterials admits a faithful classical simulation, establishing that braiding-only architectures are classically simulable without supplementary non-Clifford resources. Conversely, we prove that random matrix product states carry magic growing exponentially with system size, demonstrating that generic one-dimensional many-body states harbor ample non-stabilizer resources. Together, these results delineate precisely where genuine quantum advantage emerges in topological and many-body systems. Taken as a whole, this thesis leverages the convergence of topological matter and quantum information to remove key bottlenecks toward fault-tolerant quantum computation, to place near-term quantum simulation on rigorous footing, and to clarify the fundamental resources that separate classical from quantum computational power.
Exactly solvable models of topologically ordered phases with non-abelian anyons typically require complicated many-body interactions which do not naturally appear in nature. This motivates the "inverse problem" of quantum many-body physics: given microscopic systems with experimentally realistic two-body interactions, how to design a Hamiltonian that realizes a desired topological phase? Here we solve this problem on a platform motivated by Rydberg atoms, where elementary two-level systems couple via simple blockade interactions. Within this framework, we construct Hamiltonians that realize topological orders described by non-abelian quantum double models. We analytically prove the existence of topological order in the ground state, and present efficient schemes to prepare these states. We also introduce protocols for the controlled adiabatic braiding of anyonic excitations to probe their non-abelian statistics. Our construction is generic and applies to quantum doubles D(G)\mathcal{D}(G)D(G) for arbitrary finite groups GGG. We illustrate braiding for the simplest non-abelian quantum double D(S3)\mathcal{D}(S_3)D(S3​).
Abstract Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots. In addition to simulating a modular circuit-style quantum algorithm, we also show how the magnitude of the Jones polynomial at specific points could be obtained exactly using Fibonacci or Ising anyons. Such an exact algorithm seems ideally suited for a proof of concept demonstration of a topological quantum computer.
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.