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

Quantum computing with anyons is fault tolerant

Anasuya Lyons, Benjamin J. Brown

quant-phcond-mat.stat-mechcond-mat.str-elSubmitted Feb 11, 2026• Announced Feb 13, 2026• 13 citations
arXivHTMLPDF

Abstract

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.

Comments
7 + 11 pages, 3 + 7 figures

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

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

基于拓扑量子计算的容错编码设计

Jincheng Zhang

This paper explores the design of a fault-tolerant encoding scheme specifically tailored for topological quantum computing. The central premise is to leverage the inherent robustness of topological protection against decoherence, a primary challenge in realizing practical quantum computers. We propose a scheme utilizing non-Abelian anyons, exotic quasiparticles found in topological superconductors, to construct a robust quantum code. The core concept involves encoding quantum information within the braiding operations of these anyons, where the resulting topological transformations inherently protect against local errors. The scheme's efficacy relies on the topological protection mechanism, effectively mitigating errors arising from environmental noise and imperfections in qubit control. This work provides a theoretical foundation for utilizing topological quantum computing to achieve high-fidelity quantum computation. The key mathematical elements explored include qubit states, braiding operations, and the mathematical description of the topological protection effect.

•Sep 7, 2026•0 citations

Quantum Topological Logic Devices: A Novel Approach to Fault-Tolerant Quantum Computing

Jincheng Zhang

This paper proposes a novel architecture for quantum computing based on topological crystalline transistors protected by topological principles. The core concept leverages non-Abelian anyons to implement a topological quantum error correction code, offering a pathway to robust quantum computation resistant to local disturbances. We detail the theoretical framework, focusing on the design principles and mathematical formalism underlying this approach. The architecture utilizes specially engineered topological crystals to confine and manipulate anyons, enabling reliable quantum operations. We present a rigorous analysis of the error correction mechanisms, demonstrating the potential for significantly improved fault tolerance compared to conventional qubit designs. Key aspects include the encoding scheme using braiding operations of anyons, the topological redundancy for error detection and correction, and the resulting improved qubit fidelity. The proposed design represents a significant step towards practical, scalable quantum computers capable of enduring the inherent challenges of quantum decoherence. The presented model highlights the crucial role of topological protection in realizing a stable and reliable quantum computing platform. Our focus is on the theoretical development and the underlying mathematical structure of this approach, laying the groundwork for future experimental investigations.

•Sep 6, 2026•0 citations

Topological Quantum Computing with Majorana Zero Modes and Beyond

Christina Knapp

Topological quantum computing seeks to store and manipulate information in a protected manner using topological phases of matter. Information encoded in the degenerate state space of pairs of non-Abelian anyons or defects is robust to local perturbations, reducing its susceptiblity to environmental errors and potentially providing a scalable approach to quantum computing. However, topological quantum computing faces significant challenges, not least of which is identifying an experimentally accessible platform supporting non-Abelian topological physics. In this thesis, we critically analyze topological quantum computing with Majorana zero modes, non-Abelian defects of a topological superconductor. We identify intrinsic error sources for Majorana-based systems and propose quantum computing architectures that minimize their effects. Additionally, we consider a new approach for realizing and detecting non-Abelian topological defects in fractional Chern insulators. Topological quantum computing is predicated on the idea that braiding non-Abelian anyons adiabatically can implement quantum gates fault tolerantly. However, any braiding experiment will necessarily depart from the strict adiabatic limit. We begin by analyzing the nature of diabatic errors for anyon braiding, paying particular attention to how such errors scale with braiding time. We find that diabatic errors are unfavorably large and worryingly sensitive to details of the time evolution. We present a measurement-based correction protocol for such errors, and illustrate its application in a particular Majorana-based qubit design. We next propose designs for Majorana-based qubits operated entirely by a measurement-based protocol, thereby avoiding the diabatic errors discussed above. Our designs can be scaled into large two dimensional arrays amenable to long-term quantum computing goals, whose core components are testable in near-term devices. These qubits are robust to quasiparticle poisoning, anticipated to be one of the dominant error sources coupling to Majorana zero modes. We demonstrate that our designs support topologically protected Clifford operations and can be augmented to a universal gate set without requiring additional control parameters.While topological protection greatly suppresses errors, residual coupling to noise limits the lifetimes of our proposed Majorana-based qubits. We analyze the dephasing times for our quasiparticle-poisoning-protected qubits by calculating their charge distribution using a particle number-conserving formalism. We find that fluctuations in the electromagnetic environment couple to an exponentially suppressed topological dipole moment. We estimate dephasing times due to $1/f$ noise, thermal quasiparticle excitations, and phonons for different qubit sizes.The residual errors discussed above will necessarily require error correction for a sufficiently long quantum computation. We develop physically motivated noise models for Majorana-based qubits that can be used to analyze the performance of a quantum error correcting code. We apply this noise model to estimate pseudo-thresholds for a small subsystem code, identifying the relative importance of difference error processes from a fault tolerance perspective. Our results emphasize the necessity of suppressing long-lived quasiparticle excitations that can spread across the code.Finally, we turn our attention to a different platform that could host non-Abelian topological defects: fractional Chern insulators in graphene. We study the edge states of fractional Chern insulators using the field theory of fractional quantum Hall edges supplemented with a symmetry action. We find that lattice symmetries impose a quantized momentum difference for edge electrons in a fractional state of a $C=2$ Chern band. This momentum difference can be used to selectively contact the different edge states, thereby allowing detection of topological defects in the bulk with a standard four terminal measurement. Our proposal could be implemented in graphene subject to an artificially patterned lattice.

•Jan 1, 2019•2 citations

Stable quantum information in topological systems

Adrian Hutter

The superposition principle of quantum mechanics implies that the amount of classical (i.e., non-quantum) information needed to describe a quantum system is in general exponentially large in the size of the system. This makes simulating quantum physics on a classical computer quickly infeasible, even for moderately-sized systems and using the best present-day supercomputers in the world. This is unfortunate, since systems for which quantum effects are relevant are of interest in many areas of science and engineering, ranging from drug design to materials research. In 1982, Richard Feynman gave birth to the idea of a quantum computer, when he realized that simulating quantum physics could be achieved much more efficiently with a computer that was itself a quantum system. Since then, the number of problems for which a quantum computer is known to enjoy an advantage over a classical computer has steadily increased, ranging now far beyond the task of simulating quantum physics. A quantum computation of any interest will need to create complicated superposition states, for otherwise it would not achieve anything that could not be simulated on a classical computer. These superposition states, however, are highly fragile, and this fragility is the main obstacle that the scientific community faces on the road towards a useful quantum computer. Quantum computing will only be possible if it can be performed in a fault-tolerant way. It is due to seminal work by Alexei Kitaev from 1997 that the modern theory of quantum fault-tolerance is closely related to the term topology. Topology, as a sub-field of mathematics, is concerned with the properties of space that are preserved under continuous deformations. Topological order, a purely quantum phenomenon, refers to states which cannot be distinguished or evolved into each other locally, yet are globally distinct. The information that distinguishes between these states is stored in non-local degrees of freedom. If it were possible to store quantum information in these non-local degrees of freedom, this would be hugely attractive from a practical perspective, as it would mean that the information stored this way is immune to many forms of local errors. Two-dimensional topologically ordered states support excitations known as anyons. These are exotic quasi-particles that defy the dichotomy between fermions and bosons that applies to quantum particles in three spatial dimensions. In a topological quantum computer, the non-locally stored quantum information is processed by braiding these anyons around each other. Such a computation would be insensitive to small perturbations of the path along which anyons are braided, but would only depend on its topological properties. An open problem is whether topological order can persist at finite temperature. Equivalently, one can ask whether it is possible to build a system in which quantum information can be stored in a stable manner for arbitrarily long times, without performing active error correction and despite constant influence of a thermal environment. Such a system would constitute a self-correcting quantum memory and would extend the concept of a hard disk drive to the quantum realm. Whether nature allows for such a system to be built is of tremendous interest from both a fundamental and a practical perspective. Two-dimensional topologically ordered systems – those hosting anyons – do not qualify as self-correcting quantum memories; any finite temperature corrupts them in a time that is independent of the size of the system. In the present thesis, we propose and study systems in which the thermal stability of a simple toy model of an anyonic system, Kitaev’s toric code, is enhanced in various ways. We consider coupling it to optical cavity modes, to bosonic particles, or to a ferromagnet. These auxiliary systems then induce long-ranged interactions between the anyons, which allow to increase the finite-temperature lifetime of the stored quantum information arbitrarily by increasing the size of the system. While a topological quantum computer is naturally immune to many forms of imperfections and perturbations, accidental creation of anyonic quasi-particles due to coupling to an external environment is a form of error that requires active correction. This problem has seen surprisingly little attention until recently and is still poorly understood. In this thesis, we develop algorithms that are able to perform this task and provide the first proofs of its in-principle feasibility. Furthermore, we develop a system with the rare property that it both supports anyons that can be used for topological quantum computing, and allows for error correction with well-established techniques. Historically, the first proposals for building a fault-tolerant quantum \ncomputer involved an array of qubits (quantum bits) and a set of elementary operations that can be performed on individual and pairs of qubits. Fault-tolerant qubit-based quantum computing has been inspired tremendously from the insights gained in the study of topological quantum information processing. The surface code, which combines a qubit-based architecture with topological methods, is now at the forefront of the quest towards a fault-tolerant, scalable quantum computer. In the surface code, a large number of measurements are performed on a continuous basis to get some information about what errors have occurred. This information then needs to be converted by a classical algorithm into a prescription for performing error correction. In this thesis, we develop such an algorithm that, at the time of its publication, was the best efficient algorithm known for the surface code. Error correction for qubit-based quantum computers is typically studied with simplistic error models in which the errors on each qubit are independent from each other. We study what kinds of spatial and temporal correlations between the errors arise when a surface code is coupled to a typical model of an environment, and how they affect its correctability.

•Jan 1, 2015•0 citations
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.
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 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.
This paper explores the design of a fault-tolerant encoding scheme specifically tailored for topological quantum computing. The central premise is to leverage the inherent robustness of topological protection against decoherence, a primary challenge in realizing practical quantum computers. We propose a scheme utilizing non-Abelian anyons, exotic quasiparticles found in topological superconductors, to construct a robust quantum code. The core concept involves encoding quantum information within the braiding operations of these anyons, where the resulting topological transformations inherently protect against local errors. The scheme's efficacy relies on the topological protection mechanism, effectively mitigating errors arising from environmental noise and imperfections in qubit control. This work provides a theoretical foundation for utilizing topological quantum computing to achieve high-fidelity quantum computation. The key mathematical elements explored include qubit states, braiding operations, and the mathematical description of the topological protection effect.
This paper proposes a novel architecture for quantum computing based on topological crystalline transistors protected by topological principles. The core concept leverages non-Abelian anyons to implement a topological quantum error correction code, offering a pathway to robust quantum computation resistant to local disturbances. We detail the theoretical framework, focusing on the design principles and mathematical formalism underlying this approach. The architecture utilizes specially engineered topological crystals to confine and manipulate anyons, enabling reliable quantum operations. We present a rigorous analysis of the error correction mechanisms, demonstrating the potential for significantly improved fault tolerance compared to conventional qubit designs. Key aspects include the encoding scheme using braiding operations of anyons, the topological redundancy for error detection and correction, and the resulting improved qubit fidelity. The proposed design represents a significant step towards practical, scalable quantum computers capable of enduring the inherent challenges of quantum decoherence. The presented model highlights the crucial role of topological protection in realizing a stable and reliable quantum computing platform. Our focus is on the theoretical development and the underlying mathematical structure of this approach, laying the groundwork for future experimental investigations.
Topological quantum computing seeks to store and manipulate information in a protected manner using topological phases of matter. Information encoded in the degenerate state space of pairs of non-Abelian anyons or defects is robust to local perturbations, reducing its susceptiblity to environmental errors and potentially providing a scalable approach to quantum computing. However, topological quantum computing faces significant challenges, not least of which is identifying an experimentally accessible platform supporting non-Abelian topological physics. In this thesis, we critically analyze topological quantum computing with Majorana zero modes, non-Abelian defects of a topological superconductor. We identify intrinsic error sources for Majorana-based systems and propose quantum computing architectures that minimize their effects. Additionally, we consider a new approach for realizing and detecting non-Abelian topological defects in fractional Chern insulators. Topological quantum computing is predicated on the idea that braiding non-Abelian anyons adiabatically can implement quantum gates fault tolerantly. However, any braiding experiment will necessarily depart from the strict adiabatic limit. We begin by analyzing the nature of diabatic errors for anyon braiding, paying particular attention to how such errors scale with braiding time. We find that diabatic errors are unfavorably large and worryingly sensitive to details of the time evolution. We present a measurement-based correction protocol for such errors, and illustrate its application in a particular Majorana-based qubit design. We next propose designs for Majorana-based qubits operated entirely by a measurement-based protocol, thereby avoiding the diabatic errors discussed above. Our designs can be scaled into large two dimensional arrays amenable to long-term quantum computing goals, whose core components are testable in near-term devices. These qubits are robust to quasiparticle poisoning, anticipated to be one of the dominant error sources coupling to Majorana zero modes. We demonstrate that our designs support topologically protected Clifford operations and can be augmented to a universal gate set without requiring additional control parameters.While topological protection greatly suppresses errors, residual coupling to noise limits the lifetimes of our proposed Majorana-based qubits. We analyze the dephasing times for our quasiparticle-poisoning-protected qubits by calculating their charge distribution using a particle number-conserving formalism. We find that fluctuations in the electromagnetic environment couple to an exponentially suppressed topological dipole moment. We estimate dephasing times due to 1/f1/f1/f noise, thermal quasiparticle excitations, and phonons for different qubit sizes.The residual errors discussed above will necessarily require error correction for a sufficiently long quantum computation. We develop physically motivated noise models for Majorana-based qubits that can be used to analyze the performance of a quantum error correcting code. We apply this noise model to estimate pseudo-thresholds for a small subsystem code, identifying the relative importance of difference error processes from a fault tolerance perspective. Our results emphasize the necessity of suppressing long-lived quasiparticle excitations that can spread across the code.Finally, we turn our attention to a different platform that could host non-Abelian topological defects: fractional Chern insulators in graphene. We study the edge states of fractional Chern insulators using the field theory of fractional quantum Hall edges supplemented with a symmetry action. We find that lattice symmetries impose a quantized momentum difference for edge electrons in a fractional state of a C=2C=2C=2 Chern band. This momentum difference can be used to selectively contact the different edge states, thereby allowing detection of topological defects in the bulk with a standard four terminal measurement. Our proposal could be implemented in graphene subject to an artificially patterned lattice.
The superposition principle of quantum mechanics implies that the amount of classical (i.e., non-quantum) information needed to describe a quantum system is in general exponentially large in the size of the system. This makes simulating quantum physics on a classical computer quickly infeasible, even for moderately-sized systems and using the best present-day supercomputers in the world. This is unfortunate, since systems for which quantum effects are relevant are of interest in many areas of science and engineering, ranging from drug design to materials research. In 1982, Richard Feynman gave birth to the idea of a quantum computer, when he realized that simulating quantum physics could be achieved much more efficiently with a computer that was itself a quantum system. Since then, the number of problems for which a quantum computer is known to enjoy an advantage over a classical computer has steadily increased, ranging now far beyond the task of simulating quantum physics. A quantum computation of any interest will need to create complicated superposition states, for otherwise it would not achieve anything that could not be simulated on a classical computer. These superposition states, however, are highly fragile, and this fragility is the main obstacle that the scientific community faces on the road towards a useful quantum computer. Quantum computing will only be possible if it can be performed in a fault-tolerant way. It is due to seminal work by Alexei Kitaev from 1997 that the modern theory of quantum fault-tolerance is closely related to the term topology. Topology, as a sub-field of mathematics, is concerned with the properties of space that are preserved under continuous deformations. Topological order, a purely quantum phenomenon, refers to states which cannot be distinguished or evolved into each other locally, yet are globally distinct. The information that distinguishes between these states is stored in non-local degrees of freedom. If it were possible to store quantum information in these non-local degrees of freedom, this would be hugely attractive from a practical perspective, as it would mean that the information stored this way is immune to many forms of local errors. Two-dimensional topologically ordered states support excitations known as anyons. These are exotic quasi-particles that defy the dichotomy between fermions and bosons that applies to quantum particles in three spatial dimensions. In a topological quantum computer, the non-locally stored quantum information is processed by braiding these anyons around each other. Such a computation would be insensitive to small perturbations of the path along which anyons are braided, but would only depend on its topological properties. An open problem is whether topological order can persist at finite temperature. Equivalently, one can ask whether it is possible to build a system in which quantum information can be stored in a stable manner for arbitrarily long times, without performing active error correction and despite constant influence of a thermal environment. Such a system would constitute a self-correcting quantum memory and would extend the concept of a hard disk drive to the quantum realm. Whether nature allows for such a system to be built is of tremendous interest from both a fundamental and a practical perspective. Two-dimensional topologically ordered systems – those hosting anyons – do not qualify as self-correcting quantum memories; any finite temperature corrupts them in a time that is independent of the size of the system. In the present thesis, we propose and study systems in which the thermal stability of a simple toy model of an anyonic system, Kitaev’s toric code, is enhanced in various ways. We consider coupling it to optical cavity modes, to bosonic particles, or to a ferromagnet. These auxiliary systems then induce long-ranged interactions between the anyons, which allow to increase the finite-temperature lifetime of the stored quantum information arbitrarily by increasing the size of the system. While a topological quantum computer is naturally immune to many forms of imperfections and perturbations, accidental creation of anyonic quasi-particles due to coupling to an external environment is a form of error that requires active correction. This problem has seen surprisingly little attention until recently and is still poorly understood. In this thesis, we develop algorithms that are able to perform this task and provide the first proofs of its in-principle feasibility. Furthermore, we develop a system with the rare property that it both supports anyons that can be used for topological quantum computing, and allows for error correction with well-established techniques. Historically, the first proposals for building a fault-tolerant quantum \ncomputer involved an array of qubits (quantum bits) and a set of elementary operations that can be performed on individual and pairs of qubits. Fault-tolerant qubit-based quantum computing has been inspired tremendously from the insights gained in the study of topological quantum information processing. The surface code, which combines a qubit-based architecture with topological methods, is now at the forefront of the quest towards a fault-tolerant, scalable quantum computer. In the surface code, a large number of measurements are performed on a continuous basis to get some information about what errors have occurred. This information then needs to be converted by a classical algorithm into a prescription for performing error correction. In this thesis, we develop such an algorithm that, at the time of its publication, was the best efficient algorithm known for the surface code. Error correction for qubit-based quantum computers is typically studied with simplistic error models in which the errors on each qubit are independent from each other. We study what kinds of spatial and temporal correlations between the errors arise when a surface code is coupled to a typical model of an environment, and how they affect its correctability.