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

Outlook

Jiannis K. Pachos

Published Apr 12, 2012• 0 citations
Publisher

Abstract

In the previous chapters we introduced anyons and their properties, we presented how to perform topological quantum computation and studied several examples of topological models. There is a wide variety of research topics concerned with topological quantum computation. Among the many open questions, two have a singular importance. The first natural question is: which physical systems can support non-Abelian anyons? Realising non-Abelian anyons in the laboratory is of fundamental and practical interest. Such exotic statistical behaviour has not yet been encountered in nature. The physical realisation of non-Abelian anyons would be the first step towards the identification of a technological platform for the realisation of topological quantum computation. The second question concerns the efficiency of topological systems in combating errors. It has been proven that the effect of coherent environmental errors in the form of local Hamiltonian perturbations can be suppressed efficiently without degrading the topologically encoded information (Bravyi et al. , 2010). Nevertheless, there is no mechanism that can protect topological order from incoherent probabilistic errors. Topological systems nevertheless constitute a rich and versatile medium that allows imaginative proposals to be developed (Chesi et al. , 2010; Hamma et al. , 2009). Regarding the first question, we can identify two main categories of physical proposals for the realisation of two-dimensional topological systems: systems that are defined on the continuum and discrete systems defined on a lattice. It is natural to ask, which are the most promising architectures to realise in the laboratory?

DOI
10.1017/cbo9780511792908.010

Related papers

Topological Quantum Computing

Quantum computers have shown great promise as a resource providing exponential speedup over classical computers for certain problems.Akin to their classical counterparts, quantum computers will be prone to errors.There are two major sources of errors.First, the most formidable source of error is decoherence.To perform quantum computation, quantum information must be stored, processed and read out while protecting it from the debilitating effects of decoherence.Second, even if the system is protected from decoherence, it is almost certain that all the operations performed on the quantum information during its processing will be imperfect.These errors will accumulate over the duration of the computation, eventually causing failure.Thus, for a quantum computing scheme to be feasible, it needs to be fault-tolerant.What this means is that the quantum computer can still perform its task effectively while its components are imperfect.A major breakthrough in this field is the threshold theorem, which asserts that ideal quantum circuits can be simulated efficiently by noisy ones provided the error rates of individual gates are below a certain threshold [1,2,3].Topological quantum computing is an approach to fault-tolerant quantum computation, where the protection from errors occurs not from active intervention, but at a hardware level.The advantage of this approach is that it is robust to localized imperfections.First envisioned by Alexei Kitaev [4], this scheme makes use of a non-abelian exchange statistics of elementary excitations of some two-dimensional quantum many-body system.These excitations form the degenerate ground-space of this topologically ordered system, and all other states are separated from this space by a finite excitation gap.In order to perform computation in this scheme, one needs to create pairs of these non-abelian excitations (called non-abelian anyons) from vacuum, separating them spatially, transporting them around each other to implement the logical gates and finally, fusing them together for measurements.In order for this scheme to be viable, there are two conditions that must be fulfilled.First, there could be errors due to quantum tunneling between the non-abelian anyons.These processes can take place even at zero temperature.But, the amplitude of these processes are exponentially suppressed with the spatial separation of these particles and goes as e -L/l 0 , where L is the spatial separation and l 0 is some characteristic length scale of topological ordering of the system.Thus, to prevent such tunneling during quantum information processing and storage, L has to be much larger than l 0 .Second, at finite temperature, undesired thermally excited quasiparticles can lead to errors.The generation rate of these particles are exponentially suppressed by a Boltzmann factor e -∆/T , where ∆ is the excitation energy and T is the temperature.Therefore, the temperature must be low enough so that there are sufficiently low number of these undesired excitations.There are several physical systems where these excitations could, in principle, be found, manipulated and measured.Non-abelian anyons were proposed as elementary excitations of the ν = 5/2 state in the fractional quantum hall effect [5].The braiding statistics of these particles and their possible use in quantum computing has been investigated thoroughly.For more information on this topic, the reader is invited to consult [6,7].In a pathbreaking work [8], it was proposed that the non-abelian statistics of the excitations of the ν = 5/2 state are shared by the Majorana excitations of a 2D spinless p + ip superconductor.Since then, there have been other theoretical models [9,10] which also support these non-abelian excitations.Moreover, several experimental realizations of these Majorana excitations in solid state systems have also been proposed (for a comprehensive review, see [11]).In this lecture note, we will focus on implementation of topological quantum computation with

WORLD SCIENTIFIC eBooks•Jan 24, 2017•2 citations

Computational power of anyons

Jiannis K. Pachos

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. Anyons are physically realised as quasiparticles in topological systems. Most of the quasiparticle details are not relevant for the description of anyons. This provides an additional resilience of topological quantum computation against errors in the control of the quasiparticles. In particular, the principles of topological quantum computation are independent of the underlying physical system. We therefore do not discuss its properties in this chapter. The abstraction might create a conceptual vacuum as many intrinsic properties of the system might appear to be absent. For example, we shall not be concerned with the trapping and transport of anyons or with geometrical characteristics of their evolutions. In this chapter we treat anyons as classical fundamental particles, with internal quantum degrees of freedom, much like the spin. Moreover, we assume that we have complete control over the topological system, in terms of initial-state preparation and final-state identification.

Cambridge University Press eBooks•Apr 12, 2012•0 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

Dissecting topological quantum computation

James R. Wootton

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.

•Sep 1, 2010•2 citations

A Short Introduction to Topological Quantum Computation

Ville Lahtinen, Pachos, JK

This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion spaces and statistical quantum evolutions for encoding and processing quantum information. Both the encoding and the processing are inherently resilient against errors due to their topological nature, thus promising to overcome one of the main obstacles for the realisation of quantum computers. We outline the general steps of topological quantum computation, as well as discuss various challenges faced it. We also review the literature on condensed matter systems where anyons can emerge. Finally, the appearance of anyons and employing them for quantum computation is demonstrated in the context of a simple microscopic model -- the topological superconducting nanowire -- that describes the low-energy physics of several experimentally relevant settings. This model supports localised Majorana zero modes that are the simplest and the experimentally most tractable types of anyons that are needed to perform topological quantum computation.

•Sep 9, 2017•201 citations

A Short Introduction to Topological Quantum Computation

Ville Lahtinen, Jiannis K. Pachos

This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion spaces and statistical quantum evolutions for encoding and processing quantum information. Both the encoding and the processing are inherently resilient against errors due to their topological nature, thus promising to overcome one of the main obstacles for the realisation of quantum computers. We outline the general steps of topological quantum computation, as well as discuss various challenges faced by it. We also review the literature on condensed matter systems where anyons can emerge. Finally, the appearance of anyons and employing them for quantum computation is demonstrated in the context of a simple microscopic model -- the topological superconducting nanowire -- that describes the low-energy physics of several experimentally relevant settings. This model supports localised Majorana zero modes that are the simplest and the experimentally most tractable types of anyons that are needed to perform topological quantum computation.

arXiv:1705.04103•SciPost Physics•Sep 9, 2017•236 citations
In the previous chapters we introduced anyons and their properties, we presented how to perform topological quantum computation and studied several examples of topological models. There is a wide variety of research topics concerned with topological quantum computation. Among the many open questions, two have a singular importance. The first natural question is: which physical systems can support non-Abelian anyons? Realising non-Abelian anyons in the laboratory is of fundamental and practical interest. Such exotic statistical behaviour has not yet been encountered in nature. The physical realisation of non-Abelian anyons would be the first step towards the identification of a technological platform for the realisation of topological quantum computation. The second question concerns the efficiency of topological systems in combating errors. It has been proven that the effect of coherent environmental errors in the form of local Hamiltonian perturbations can be suppressed efficiently without degrading the topologically encoded information (Bravyi et al. , 2010). Nevertheless, there is no mechanism that can protect topological order from incoherent probabilistic errors. Topological systems nevertheless constitute a rich and versatile medium that allows imaginative proposals to be developed (Chesi et al. , 2010; Hamma et al. , 2009). Regarding the first question, we can identify two main categories of physical proposals for the realisation of two-dimensional topological systems: systems that are defined on the continuum and discrete systems defined on a lattice. It is natural to ask, which are the most promising architectures to realise in the laboratory?
Quantum computers have shown great promise as a resource providing exponential speedup over classical computers for certain problems.Akin to their classical counterparts, quantum computers will be prone to errors.There are two major sources of errors.First, the most formidable source of error is decoherence.To perform quantum computation, quantum information must be stored, processed and read out while protecting it from the debilitating effects of decoherence.Second, even if the system is protected from decoherence, it is almost certain that all the operations performed on the quantum information during its processing will be imperfect.These errors will accumulate over the duration of the computation, eventually causing failure.Thus, for a quantum computing scheme to be feasible, it needs to be fault-tolerant.What this means is that the quantum computer can still perform its task effectively while its components are imperfect.A major breakthrough in this field is the threshold theorem, which asserts that ideal quantum circuits can be simulated efficiently by noisy ones provided the error rates of individual gates are below a certain threshold [1,2,3].Topological quantum computing is an approach to fault-tolerant quantum computation, where the protection from errors occurs not from active intervention, but at a hardware level.The advantage of this approach is that it is robust to localized imperfections.First envisioned by Alexei Kitaev [4], this scheme makes use of a non-abelian exchange statistics of elementary excitations of some two-dimensional quantum many-body system.These excitations form the degenerate ground-space of this topologically ordered system, and all other states are separated from this space by a finite excitation gap.In order to perform computation in this scheme, one needs to create pairs of these non-abelian excitations (called non-abelian anyons) from vacuum, separating them spatially, transporting them around each other to implement the logical gates and finally, fusing them together for measurements.In order for this scheme to be viable, there are two conditions that must be fulfilled.First, there could be errors due to quantum tunneling between the non-abelian anyons.These processes can take place even at zero temperature.But, the amplitude of these processes are exponentially suppressed with the spatial separation of these particles and goes as e -L/l 0 , where L is the spatial separation and l 0 is some characteristic length scale of topological ordering of the system.Thus, to prevent such tunneling during quantum information processing and storage, L has to be much larger than l 0 .Second, at finite temperature, undesired thermally excited quasiparticles can lead to errors.The generation rate of these particles are exponentially suppressed by a Boltzmann factor e -∆/T , where ∆ is the excitation energy and T is the temperature.Therefore, the temperature must be low enough so that there are sufficiently low number of these undesired excitations.There are several physical systems where these excitations could, in principle, be found, manipulated and measured.Non-abelian anyons were proposed as elementary excitations of the ν = 5/2 state in the fractional quantum hall effect [5].The braiding statistics of these particles and their possible use in quantum computing has been investigated thoroughly.For more information on this topic, the reader is invited to consult [6,7].In a pathbreaking work [8], it was proposed that the non-abelian statistics of the excitations of the ν = 5/2 state are shared by the Majorana excitations of a 2D spinless p + ip superconductor.Since then, there have been other theoretical models [9,10] which also support these non-abelian excitations.Moreover, several experimental realizations of these Majorana excitations in solid state systems have also been proposed (for a comprehensive review, see [11]).In this lecture note, we will focus on implementation of topological quantum computation with
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. Anyons are physically realised as quasiparticles in topological systems. Most of the quasiparticle details are not relevant for the description of anyons. This provides an additional resilience of topological quantum computation against errors in the control of the quasiparticles. In particular, the principles of topological quantum computation are independent of the underlying physical system. We therefore do not discuss its properties in this chapter. The abstraction might create a conceptual vacuum as many intrinsic properties of the system might appear to be absent. For example, we shall not be concerned with the trapping and transport of anyons or with geometrical characteristics of their evolutions. In this chapter we treat anyons as classical fundamental particles, with internal quantum degrees of freedom, much like the spin. Moreover, we assume that we have complete control over the topological system, in terms of initial-state preparation and final-state identification.
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.
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.
This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion spaces and statistical quantum evolutions for encoding and processing quantum information. Both the encoding and the processing are inherently resilient against errors due to their topological nature, thus promising to overcome one of the main obstacles for the realisation of quantum computers. We outline the general steps of topological quantum computation, as well as discuss various challenges faced it. We also review the literature on condensed matter systems where anyons can emerge. Finally, the appearance of anyons and employing them for quantum computation is demonstrated in the context of a simple microscopic model -- the topological superconducting nanowire -- that describes the low-energy physics of several experimentally relevant settings. This model supports localised Majorana zero modes that are the simplest and the experimentally most tractable types of anyons that are needed to perform topological quantum computation.
This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion spaces and statistical quantum evolutions for encoding and processing quantum information. Both the encoding and the processing are inherently resilient against errors due to their topological nature, thus promising to overcome one of the main obstacles for the realisation of quantum computers. We outline the general steps of topological quantum computation, as well as discuss various challenges faced by it. We also review the literature on condensed matter systems where anyons can emerge. Finally, the appearance of anyons and employing them for quantum computation is demonstrated in the context of a simple microscopic model -- the topological superconducting nanowire -- that describes the low-energy physics of several experimentally relevant settings. This model supports localised Majorana zero modes that are the simplest and the experimentally most tractable types of anyons that are needed to perform topological quantum computation.