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

Dissecting topological quantum computation

James R. Wootton

Published Sep 1, 2010• 2 citations
OpenAlex

Abstract

Anyons are quasiparticles that may be realized in two dimensional systems. They come in two types, the simpler Abelian anyons and the more complex non-Abelian anyons. Both of these have been considered as a means for quantum computation, but non-Abelian anyons are usually assumed to be better suited to the task. Here we challenge this view, demonstrating that Abelian anyon models have as much potential as some simple non-Abelian models. First the means to perform quantum computation with Abelian anyon models is considered. These models, like many non-Abelian models, cannot realize universal quantum computation by braiding alone. Non-topological operations must be used in addition, whose complexity depends on the physical means by which the anyons are realized. Here we consider anyons based on spin lattice models, with single spin measurements playing the role of non-topological operations. The computational power achieved by various kinds of measurement is explored and the requirements for universality are determined. The possibility to simulate non-Abelian anyons using Abelian ones is then considered. Finally, a non-Abelian quantum memory is dissected in order to determine the means by which it provides fault-tolerant storage of information. This understanding is then employed to build equivalent quantum memories with Abelian anyon models. The methodology provides with the means to demonstrate that Abelian models have the capability to simulate non-Abelian anyons, and to realize the same computational power and fault-tolerance as non Abelian models. Apart from the intellectual interest in relating topological models with each other, and of understanding the properties of non-Abelian anyons in terms of the simpler Abelian ones, these results can also be applied in the lab. The simpler structure of Abelian anyons means that their physical realization is more straightforward. The demonstration of non-Abelian properties with Abelian models therefore allows features of non-Abelian anyons to be realized with present and near future technology. Based on this possibility, proposals are made here for proof of principle experiments.

Related papers

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

Universal Quantum Computation with Abelian Anyon Models

James R. Wootton, Jiannis K. Pachos

We consider topological quantum memories for a general class of abelian anyon models defined on spin lattices. These are non-universal for quantum computation when restricting to topological operations alone, such as braiding and fusion. The effects of additional non-topological operations, such as spin measurements, are studied. These are shown to allow universal quantum computation, while still utilizing topological protection. Our work gives an insight into the relation between abelian models and their non-abelian counterparts.

Electronic Notes in Theoretical Computer Science•Feb 1, 2011•8 citations

Universal Quantum Computation with Abelian Anyon Models

James R. Wootton, Jiannis K. Pachos

We consider topological quantum memories for a general class of abelian anyon models defined on spin lattices. These are non-universal for quantum computation when restricting to topological operations alone, such as braiding and fusion. The effects of additional non-topological operations, such as spin measurements, are studied. These are shown to allow universal quantum computation, while still utilizing topological protection. Our work gives an insight into the relation between abelian models and their non-abelian counterparts.

arXiv:0904.4373•Apr 28, 2009•2 citations

Quantum Computing with $\mathbb{Z}_2$ Abelian anyon system

Zhu, Yuanye

Topological quantum computers provide a fault-tolerant method for performing quantum computation. Topological quantum computers manipulate topological defects with exotic exchange statistics called anyons. The simplest anyon model for universal topological quantum computation is the Fibonacci anyon model, which is a non-abelian anyon system. In non-abelian anyon systems, exchanging anyons always results a unitary operations instead of a simple phase changing in abelian anyon systems. So, non-abelian anyon systems are of the interest to topological quantum computation. Up till now, most people still hold the belief that topological quantum computions can be implemented only on the non-abelian anyon systems. But actually this is not true. Inspired by extrinsic semiconductor technology, we suggest that abelian anyon systems with defects also support topological quantum computing. In this letter, we report a topological quantum computer prototype based on $\mathbb{Z}_2$ abelian anyon system.

arXiv:2203.17235•Mar 29, 2022•0 citations

Non-Abelian anyons and topological quantum computation

Chetan Nayak, Steven H. Simon, Ady Stern +2 more

Topological quantum computation has emerged as one of the most exciting approaches to constructing a fault-tolerant quantum computer. The proposal relies on the existence of topological states of matter whose quasiparticle excitations are neither bosons nor fermions, but are particles known as non-Abelian anyons, meaning that they obey non-Abelian braiding statistics. Quantum information is stored in states with multiple quasiparticles, which have a topological degeneracy. The unitary gate operations that are necessary for quantum computation are carried out by braiding quasiparticles and then measuring the multiquasiparticle states. The fault tolerance of a topological quantum computer arises from the nonlocal encoding of the quasiparticle states, which makes them immune to errors caused by local perturbations. To date, the only such topological states thought to have been found in nature are fractional quantum Hall states, most prominently the $\ensuremath{\nu}=5∕2$ state, although several other prospective candidates have been proposed in systems as disparate as ultracold atoms in optical lattices and thin-film superconductors. In this review article, current research in this field is described, focusing on the general theoretical concepts of non-Abelian statistics as it relates to topological quantum computation, on understanding non-Abelian quantum Hall states, on proposed experiments to detect non-Abelian anyons, and on proposed architectures for a topological quantum computer. Both the mathematical underpinnings of topological quantum computation and the physics of the subject are addressed, using the $\ensuremath{\nu}=5∕2$ fractional quantum Hall state as the archetype of a non-Abelian topological state enabling fault-tolerant quantum computation.

arXiv:0707.1889•Reviews of Modern Physics•Sep 12, 2008•6,846 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
Anyons are quasiparticles that may be realized in two dimensional systems. They come in two types, the simpler Abelian anyons and the more complex non-Abelian anyons. Both of these have been considered as a means for quantum computation, but non-Abelian anyons are usually assumed to be better suited to the task. Here we challenge this view, demonstrating that Abelian anyon models have as much potential as some simple non-Abelian models. First the means to perform quantum computation with Abelian anyon models is considered. These models, like many non-Abelian models, cannot realize universal quantum computation by braiding alone. Non-topological operations must be used in addition, whose complexity depends on the physical means by which the anyons are realized. Here we consider anyons based on spin lattice models, with single spin measurements playing the role of non-topological operations. The computational power achieved by various kinds of measurement is explored and the requirements for universality are determined. The possibility to simulate non-Abelian anyons using Abelian ones is then considered. Finally, a non-Abelian quantum memory is dissected in order to determine the means by which it provides fault-tolerant storage of information. This understanding is then employed to build equivalent quantum memories with Abelian anyon models. The methodology provides with the means to demonstrate that Abelian models have the capability to simulate non-Abelian anyons, and to realize the same computational power and fault-tolerance as non Abelian models. Apart from the intellectual interest in relating topological models with each other, and of understanding the properties of non-Abelian anyons in terms of the simpler Abelian ones, these results can also be applied in the lab. The simpler structure of Abelian anyons means that their physical realization is more straightforward. The demonstration of non-Abelian properties with Abelian models therefore allows features of non-Abelian anyons to be realized with present and near future technology. Based on this possibility, proposals are made here for proof of principle experiments.
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.
We consider topological quantum memories for a general class of abelian anyon models defined on spin lattices. These are non-universal for quantum computation when restricting to topological operations alone, such as braiding and fusion. The effects of additional non-topological operations, such as spin measurements, are studied. These are shown to allow universal quantum computation, while still utilizing topological protection. Our work gives an insight into the relation between abelian models and their non-abelian counterparts.
We consider topological quantum memories for a general class of abelian anyon models defined on spin lattices. These are non-universal for quantum computation when restricting to topological operations alone, such as braiding and fusion. The effects of additional non-topological operations, such as spin measurements, are studied. These are shown to allow universal quantum computation, while still utilizing topological protection. Our work gives an insight into the relation between abelian models and their non-abelian counterparts.
Quantum Computing with Z2\mathbb{Z}_2Z2​ Abelian anyon system
Topological quantum computers provide a fault-tolerant method for performing quantum computation. Topological quantum computers manipulate topological defects with exotic exchange statistics called anyons. The simplest anyon model for universal topological quantum computation is the Fibonacci anyon model, which is a non-abelian anyon system. In non-abelian anyon systems, exchanging anyons always results a unitary operations instead of a simple phase changing in abelian anyon systems. So, non-abelian anyon systems are of the interest to topological quantum computation. Up till now, most people still hold the belief that topological quantum computions can be implemented only on the non-abelian anyon systems. But actually this is not true. Inspired by extrinsic semiconductor technology, we suggest that abelian anyon systems with defects also support topological quantum computing. In this letter, we report a topological quantum computer prototype based on Z2\mathbb{Z}_2Z2​ abelian anyon system.
Topological quantum computation has emerged as one of the most exciting approaches to constructing a fault-tolerant quantum computer. The proposal relies on the existence of topological states of matter whose quasiparticle excitations are neither bosons nor fermions, but are particles known as non-Abelian anyons, meaning that they obey non-Abelian braiding statistics. Quantum information is stored in states with multiple quasiparticles, which have a topological degeneracy. The unitary gate operations that are necessary for quantum computation are carried out by braiding quasiparticles and then measuring the multiquasiparticle states. The fault tolerance of a topological quantum computer arises from the nonlocal encoding of the quasiparticle states, which makes them immune to errors caused by local perturbations. To date, the only such topological states thought to have been found in nature are fractional quantum Hall states, most prominently the $\ensuremath{\nu}=5∕2$ state, although several other prospective candidates have been proposed in systems as disparate as ultracold atoms in optical lattices and thin-film superconductors. In this review article, current research in this field is described, focusing on the general theoretical concepts of non-Abelian statistics as it relates to topological quantum computation, on understanding non-Abelian quantum Hall states, on proposed experiments to detect non-Abelian anyons, and on proposed architectures for a topological quantum computer. Both the mathematical underpinnings of topological quantum computation and the physics of the subject are addressed, using the $\ensuremath{\nu}=5∕2$ fractional quantum Hall state as the archetype of a non-Abelian topological state enabling fault-tolerant quantum computation.
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.