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

Cambridge University Press eBooks

Computational power of anyons

Jiannis K. Pachos

Published Apr 12, 2012• 0 citations
Publisher

Abstract

Topological quantum computation encodes and manipulates information by exclusively employing anyons. To study the computational power of anyons we plan to look into their fusion and braiding properties in a systematic way. This will allow us to identify a Hilbert space, where quantum information can be encoded fault-tolerantly. We also identify unitary evolutions that serve as logical gates. It is an amazing fact that fundamental properties, such as particle statistics, can be employed to perform quantum computation. As we shall see below, the resilience of these intrinsic particle properties against environmental perturbations is responsible for the fault-tolerance of topological quantum computation.

DOI
10.1017/cbo9780511792908.004

Related papers

Topological Quantum Computation : An Analysis of an Anyon Model Based on Quantum Double Symmetries

Ville Lahtinen

There exists various suggestions for building a functional and a fault-tolerant large-scale quantum computer. Topological quantum computation is a more exotic suggestion, which makes use of the properties of quasiparticles manifest only in certain two-dimensional systems. These so called anyons exhibit topological degrees of freedom, which, in principle, can be used to execute quantum computation with intrinsic fault-tolerance. This feature is the main incentive to study topological quantum computation. The objective of this thesis is to provide an accessible introduction to the theory. In this thesis one has considered the theory of anyons arising in two-dimensional quantum mechanical systems, which are described by gauge theories based on so called quantum double symmetries. The quasiparticles are shown to exhibit interactions and carry quantum numbers, which are both of topological nature. Particularly, it is found that the addition of the quantum numbers is not unique, but that the fusion of the quasiparticles is described by a non-trivial fusion algebra. It is discussed how this property can be used to encode quantum information in a manner which is intrinsically protected from decoherence and how one could, in principle, perform quantum computation by braiding the quasiparticles. As an example of the presented general discussion, the particle spectrum and the fusion algebra of an anyon model based on the gauge group S_3 are explicitly derived. The fusion algebra is found to branch into multiple proper subalgebras and the simplest one of them is chosen as a model for an illustrative demonstration. The different steps of a topological quantum computation are outlined and the computational power of the model is assessed. It turns out that the chosen model is not universal for quantum computation. However, because the objective was a demonstration of the theory with explicit calculations, none of the other more complicated fusion subalgebras were considered. Studying their applicability for quantum computation could be a topic of further research.

Työväentutkimus Vuosikirja•May 8, 2006•3 citations

Anyon braiding statistics: From fundamental physics to scalable quantum computing

HE Jianhong, GAO Jie

Topological quantum computation aims to encode quantum information in the nonlocal degrees of freedom of non-Abelian anyons and manipulate it through braiding and fusion operations, offering a promising pathway to fault-tolerant quantum computation. Non-Abelian anyons, with their nontrivial braiding statistics and intrinsic topological fault tolerance, are regarded as a key building block for realizing scalable and decoherence-resistant quantum computing. This review systematically surveys the key developments in anyon physics over the past four decades, from the early theoretical prediction of fractional statistics to direct experimental verification of anyon braiding in fractional quantum Hall states. The physical principles and key findings of essential experimental schemes, including Fabry-Pérot interferometers, Mach-Zehnder interferometers, and anyon colliders, are comprehensively covered. Based on these foundations, the characterization of topological order in even-denominator fractional quantum Hall states, exemplified by the ν=5/2 state, and transport and interferometric probes of non-Abelian statistics are discussed in detail. Furthermore, recent advances in topological quantum states in novel material platforms, including graphene and twisted transition metal dichalcogenides, are reviewed, together with artificial quantum platforms that simulate non-Abelian braiding using superconducting quantum processors. Finally, the key challenges and future directions on the path from anyon physics to scalable topological quantum computing prototype devices are outlined.

•Sep 1, 2026•0 citations

Topological Quantum Computation

Tudor D. Stanescu

Quantum computation is a proposed model of computation that applies quantum\nmechanics to perform information processing and store information in quantum\nstates. Quantum mechanics applies for many different phenomena, with\nmany possible systems in which it is possible to model and manipulate the\nfundamental quantum information bit - the qubit - and thus there are hypothetically\nmany ways to construct a quantum computer. One proposed way of\nquantum computation is to use non-abelian anyons to model qubits. These are\nexotic quasi-particles whose wave functions evolve non-trivially when permuting\ntheir positions. This allows for computation with qubits simply by permuting\nanyons, a process called braiding since their trajectories in spacetime resemble\nbraids. The quantum states associated with the anyons evolve only when the\npositions of anyons are permuted and do not depend on the paths the anyons\ntake. For this reason this model of quantum computation is called topological\nquantum computation (TQC). One of the main advantages of TQC is that computations\nare inherently fault tolerant: there is no noise due to anyons taking\nstrange paths since the quantum evolution is path independent. The goal of\nthis text is to investigate the mathematical framework for this proposed model\nof quantum computation. The main results are the possible gates that can be\napplied to two one-qubit topological computers. Given the key properties of\nthe anyons used, Theorem 5.2 states the possible one-qubit gates in an Ising\ncomputer, and Theorem 7.1 states the possible one-qubit gates in a Fibonacci\ncomputer.

CRC Press eBooks•Dec 13, 2016•17 citations

Topological Quantum Computing: Foundations, Research Trends, and Long-Term Impact

Boda T. S. S. Srihari Krishna Gopal, Talabattula Divya Sai Sri Akanksha

Topological quantum computation relies on the concepts of non-Abelian anyons and topological superconductors, holding great promise for noise-protected computation scalable since it stores quantum information coherently, irrespective of position. Included in this review are fundamentals like Majorana fermion zero modes, current innovations at Microsoft regarding nanowires, along with challenges and plans for scaling quantum computation at the level of million-qubits by the year 2030. It employs the use of anyons, a kind of quasi particle that exists in a two-dimensional setting. The world lines of the anyons cross each other in a braid fashion in the three-dimensional spacetime (one time-dimensional and two space-dimensional). The braids correspond to the logic gates in a computer. The one big advantage that the use of the quantum braid has over the trapped quantum particles has to do with stability. A small disturbance in a system may cause the decoherence of the quantum states and errors in calculation in a regular quantum computer, but in the braids, the disturbance does not affect the topological properties because it is like the difference between cutting and reconnecting a string to create a new braid compared to a ball (standing in place for a regular trapped quantum particle in four-dimensional spacetime) hitting a wall. Topological quantum computers are equivalent in computational power to other standard models of quantum computation, in particular to the quantum circuit model and to the quantum Turing machine model. That is, any of these models can efficiently simulate any of the others. Nonetheless, certain algorithms may be a more natural fit to the topological quantum computer model. For example, algorithms for evaluating the Jones polynomial were first developed in the topological model, and only later converted and extended in the standard quantum circuit model.

Indian Journal of Computer Science•Apr 30, 2026•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•7,068 citations

Quantum computing with anyons is fault tolerant

Anasuya Lyons, Benjamin J. Brown

In seminal work (arxiv:quant-ph/9707021) Alexei Kitaev proposed topological quantum computing (arXiv:cond-mat/0010440, arxiv:quant-ph/9707021, arXiv:quant-ph/0001108, arXiv:0707.1889), whereby logic gates of a quantum computer are conducted by creating, braiding and fusing anyonic particles on a two-dimensional plane. Furthermore, he showed the proposal is inherently robust to local perturbations (arXiv:cond-mat/0010440, arxiv:quant-ph/9707021, arXiv:1001.0344, arXiv:1001.4363) when anyons are created as quasiparticle excitations of a topologically ordered lattice model prepared at zero temperature. Over the decades following this proposal there have been considerable technological developments towards the construction of a fault-tolerant quantum computer. Rather than maintaining some target ground state at zero temperature, a modern approach is to actively correct the errors a target state experiences, where we use noisy quantum circuit elements to identify and subsequently correct for deviations from the ideal state. We present an error-correction scheme that enables us to carry out robust universal quantum computation by braiding anyons. We show that our scheme can be carried out on a suitably large device with an arbitrarily small failure rate assuming circuit elements are below some threshold level of local noise. The error-corrected scheme we have developed therefore enables us to carry out fault-tolerant topological quantum computation using modern quantum hardware that is now under development.

quant-pharXiv:2602.11258•Feb 13, 2026•13 citations
Topological quantum computation encodes and manipulates information by exclusively employing anyons. To study the computational power of anyons we plan to look into their fusion and braiding properties in a systematic way. This will allow us to identify a Hilbert space, where quantum information can be encoded fault-tolerantly. We also identify unitary evolutions that serve as logical gates. It is an amazing fact that fundamental properties, such as particle statistics, can be employed to perform quantum computation. As we shall see below, the resilience of these intrinsic particle properties against environmental perturbations is responsible for the fault-tolerance of topological quantum computation.
There exists various suggestions for building a functional and a fault-tolerant large-scale quantum computer. Topological quantum computation is a more exotic suggestion, which makes use of the properties of quasiparticles manifest only in certain two-dimensional systems. These so called anyons exhibit topological degrees of freedom, which, in principle, can be used to execute quantum computation with intrinsic fault-tolerance. This feature is the main incentive to study topological quantum computation. The objective of this thesis is to provide an accessible introduction to the theory. In this thesis one has considered the theory of anyons arising in two-dimensional quantum mechanical systems, which are described by gauge theories based on so called quantum double symmetries. The quasiparticles are shown to exhibit interactions and carry quantum numbers, which are both of topological nature. Particularly, it is found that the addition of the quantum numbers is not unique, but that the fusion of the quasiparticles is described by a non-trivial fusion algebra. It is discussed how this property can be used to encode quantum information in a manner which is intrinsically protected from decoherence and how one could, in principle, perform quantum computation by braiding the quasiparticles. As an example of the presented general discussion, the particle spectrum and the fusion algebra of an anyon model based on the gauge group S_3 are explicitly derived. The fusion algebra is found to branch into multiple proper subalgebras and the simplest one of them is chosen as a model for an illustrative demonstration. The different steps of a topological quantum computation are outlined and the computational power of the model is assessed. It turns out that the chosen model is not universal for quantum computation. However, because the objective was a demonstration of the theory with explicit calculations, none of the other more complicated fusion subalgebras were considered. Studying their applicability for quantum computation could be a topic of further research.
Topological quantum computation aims to encode quantum information in the nonlocal degrees of freedom of non-Abelian anyons and manipulate it through braiding and fusion operations, offering a promising pathway to fault-tolerant quantum computation. Non-Abelian anyons, with their nontrivial braiding statistics and intrinsic topological fault tolerance, are regarded as a key building block for realizing scalable and decoherence-resistant quantum computing. This review systematically surveys the key developments in anyon physics over the past four decades, from the early theoretical prediction of fractional statistics to direct experimental verification of anyon braiding in fractional quantum Hall states. The physical principles and key findings of essential experimental schemes, including Fabry-Pérot interferometers, Mach-Zehnder interferometers, and anyon colliders, are comprehensively covered. Based on these foundations, the characterization of topological order in even-denominator fractional quantum Hall states, exemplified by the ν=5/2 state, and transport and interferometric probes of non-Abelian statistics are discussed in detail. Furthermore, recent advances in topological quantum states in novel material platforms, including graphene and twisted transition metal dichalcogenides, are reviewed, together with artificial quantum platforms that simulate non-Abelian braiding using superconducting quantum processors. Finally, the key challenges and future directions on the path from anyon physics to scalable topological quantum computing prototype devices are outlined.
Quantum computation is a proposed model of computation that applies quantum\nmechanics to perform information processing and store information in quantum\nstates. Quantum mechanics applies for many different phenomena, with\nmany possible systems in which it is possible to model and manipulate the\nfundamental quantum information bit - the qubit - and thus there are hypothetically\nmany ways to construct a quantum computer. One proposed way of\nquantum computation is to use non-abelian anyons to model qubits. These are\nexotic quasi-particles whose wave functions evolve non-trivially when permuting\ntheir positions. This allows for computation with qubits simply by permuting\nanyons, a process called braiding since their trajectories in spacetime resemble\nbraids. The quantum states associated with the anyons evolve only when the\npositions of anyons are permuted and do not depend on the paths the anyons\ntake. For this reason this model of quantum computation is called topological\nquantum computation (TQC). One of the main advantages of TQC is that computations\nare inherently fault tolerant: there is no noise due to anyons taking\nstrange paths since the quantum evolution is path independent. The goal of\nthis text is to investigate the mathematical framework for this proposed model\nof quantum computation. The main results are the possible gates that can be\napplied to two one-qubit topological computers. Given the key properties of\nthe anyons used, Theorem 5.2 states the possible one-qubit gates in an Ising\ncomputer, and Theorem 7.1 states the possible one-qubit gates in a Fibonacci\ncomputer.
Topological quantum computation relies on the concepts of non-Abelian anyons and topological superconductors, holding great promise for noise-protected computation scalable since it stores quantum information coherently, irrespective of position. Included in this review are fundamentals like Majorana fermion zero modes, current innovations at Microsoft regarding nanowires, along with challenges and plans for scaling quantum computation at the level of million-qubits by the year 2030. It employs the use of anyons, a kind of quasi particle that exists in a two-dimensional setting. The world lines of the anyons cross each other in a braid fashion in the three-dimensional spacetime (one time-dimensional and two space-dimensional). The braids correspond to the logic gates in a computer. The one big advantage that the use of the quantum braid has over the trapped quantum particles has to do with stability. A small disturbance in a system may cause the decoherence of the quantum states and errors in calculation in a regular quantum computer, but in the braids, the disturbance does not affect the topological properties because it is like the difference between cutting and reconnecting a string to create a new braid compared to a ball (standing in place for a regular trapped quantum particle in four-dimensional spacetime) hitting a wall. Topological quantum computers are equivalent in computational power to other standard models of quantum computation, in particular to the quantum circuit model and to the quantum Turing machine model. That is, any of these models can efficiently simulate any of the others. Nonetheless, certain algorithms may be a more natural fit to the topological quantum computer model. For example, algorithms for evaluating the Jones polynomial were first developed in the topological model, and only later converted and extended in the standard quantum circuit model.
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.
In seminal work (arxiv:quant-ph/9707021) Alexei Kitaev proposed topological quantum computing (arXiv:cond-mat/0010440, arxiv:quant-ph/9707021, arXiv:quant-ph/0001108, arXiv:0707.1889), whereby logic gates of a quantum computer are conducted by creating, braiding and fusing anyonic particles on a two-dimensional plane. Furthermore, he showed the proposal is inherently robust to local perturbations (arXiv:cond-mat/0010440, arxiv:quant-ph/9707021, arXiv:1001.0344, arXiv:1001.4363) when anyons are created as quasiparticle excitations of a topologically ordered lattice model prepared at zero temperature. Over the decades following this proposal there have been considerable technological developments towards the construction of a fault-tolerant quantum computer. Rather than maintaining some target ground state at zero temperature, a modern approach is to actively correct the errors a target state experiences, where we use noisy quantum circuit elements to identify and subsequently correct for deviations from the ideal state. We present an error-correction scheme that enables us to carry out robust universal quantum computation by braiding anyons. We show that our scheme can be carried out on a suitably large device with an arbitrarily small failure rate assuming circuit elements are below some threshold level of local noise. The error-corrected scheme we have developed therefore enables us to carry out fault-tolerant topological quantum computation using modern quantum hardware that is now under development.