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:1406.5974 · Physical Review A

Error thresholds for Abelian quantum double models: Increasing the bit-flip stability of topological quantum memory

Ruben S. Andrist, James R. Wootton, Helmut G. Katzgraber

Published Apr 24, 2015• 44 citations
arXivHTMLPDF

Abstract

Current approaches for building quantum computing devices focus on two-level quantum systems which nicely mimic the concept of a classical bit, albeit enhanced with additional quantum properties. However, rather than artificially limiting the number of states to two, the use of $d$-level quantum systems (qudits) could provide advantages for quantum information processing. Among other merits, it has recently been shown that multilevel quantum systems can offer increased stability to external disturbances. In this study we demonstrate that topological quantum memories built from qudits, also known as Abelian quantum double models, exhibit a substantially increased resilience to noise. That is, even when taking into account the multitude of errors possible for multilevel quantum systems, topological quantum error-correction codes employing qudits can sustain a larger error rate than their two-level counterparts. In particular, we find strong numerical evidence that the thresholds of these error-correction codes are given by the hashing bound. Considering the significantly increased error thresholds attained, this might well outweigh the added complexity of engineering and controlling higher-dimensional quantum systems.

DOI
10.1103/physreva.91.042331

Related papers

Ising model formulation for highly accurate topological color codes decoding

Yugo Takada, Yusaku Takeuchi, Keisuke Fujii

Quantum error correction is an essential ingredient for reliable quantum computation for theoretically provable quantum speedup. Topological color codes, one of the quantum error correction codes, have an advantage against the surface codes in that all Clifford gates can be implemented transversally. However, the hardness of decoding makes the color codes not suitable as the best candidate for experimentally feasible implementation of quantum error correction. Here we propose an Ising model formulation that enables highly accurate decoding of the color codes. In this formulation, we map stabilizer operators to classical spin variables to represent an error satisfying the syndrome. Then we construct an Ising Hamiltonian that counts the number of errors and formulate the decoding problem as an energy minimization problem of an Ising Hamiltonian, which is solved by simulated annealing. In numerical simulations on the (4.8.8) lattice, we find an error threshold of 10.36(5)% for bit-flip noise model, 18.47(5)% for depolarizing noise model, and 2.90(4)% for phenomenological noise model (bit-flip error is located on each of data and measurement qubits), all of which are higher than the thresholds of existing efficient decoding algorithms. Furthermore, we verify that the achieved logical error rates are almost optimal in the sense that they are almost the same as those obtained by exact optimizations by CPLEX with smaller decoding time in many cases. Since the decoding process has been a bottleneck for performance analysis, the proposed decoding method is useful for further exploration of the possibility of the topological color codes. Published by the American Physical Society 2024

arXiv:2303.01348•Physical Review Research•Jan 24, 2024•12 citations

Towards fault-tolerant quantum computation with higher-dimensional systems

Hussain Anwar

The main focus of this thesis is to explore the advantages of using higher-dimensional quantum systems (qudits) as building blocks for fault-tolerant quantum computation. In particular, we investigate the two main essential ingredients of many state-of-the-art fault-tolerant schemes [133], which are magic state distillation and topological error correction. The theory for both of these components is well established for the qubit case, but little has been known for the generalised qudit case. For magic state distillation, we first present a general numerical approach that can be used to investigate the distillation properties of any stabilizer code. We use this approach to study small threedimensional (qutrit) codes and classify, for the first time, new types of qutrit magic states. We then provide an analytic study of a family of distillation protocols based on the quantum Reed-Muller codes. We discover a particular five-dimensional code that, by many measures, outperforms all known qubit codes. For the topological error correction, we study the qudit toric code serving as a quantum memory. For this purpose we examine an efficient renormalization group decoder to estimate the error correction threshold. We find that when the qudit toric code is subject to a generalised bit-flip noise, and for a sufficiently high dimension, a threshold of 30% can be obtained under perfect decoding.

•Mar 28, 2014•3 citations

Topological quantum error correction and quantum algorithm simulations

David Wang

Quantum computers are machines that manipulate quantum information stored in the form of qubits, the quantum analogue to the classical bit.Unlike the bit, quantum mechanics allows a qubit to be in a linear superposition of both its basis states.Given the same number of bits and qubits, the latter stores exponentially more information.Quantum algorithms exploit these superposition states, allowing quantum computers to solve problems such as prime number factorisation and searches faster than classical computers.Realising a large-scale quantum computer is difficult because quantum information is highly susceptible to noise.Error correction may be employed to suppress the noise, so that the results of large quantum algorithms are valid.The overhead incurred from introducing error correction is neutralised if all elementary quantum operations are constructed with an error rate below some threshold error rate.Below threshold, arbitrary length quantum computation is possible.We investigate two topological quantum error correcting codes, the planar code and the 2D colour code.We find the threshold for the 2D colour code to be 0.1%, and improve the planar code threshold from 0.75% to 1.1%.Existing protocols for the transmission of quantum states are hindered by maximum communication distances and low communication rates.We adapt the planar code for use in quantum communication, and show that this allows the fault-tolerant transmission of quantum information over arbitrary distances at a rate limited only by local quantum gate speed.Error correction is an expensive investment and thus one seeks to employ as little as possible without compromising the integrity of the results.It is therefore important to study the robustness of algorithms to noise.We show that using the matrix product state representation allows one to simulate far larger instances of the quantum factoring algorithm than under the traditional amplitude formalism representation.We simulate systems with as many as 42 qubits on a single processor with 32GB RAM, comparable to amplitude formalism simulations performed on far larger computers.

•Jan 1, 2011•0 citations

Theoretical and Numerican Studies of Phase Transitions and Error Thresholds in Topological Quantum Memories

Pejman Jouzdani

This dissertation is the collection of a progressive research on the topic of topological quantum computation and information with the focus on the error threshold of the well-known models such as the unpaired Majorana, the toric code, and the planar code. We study the basics of quantum computation and quantum information, and in particular quantum error correction. Quantum error correction provides a tool for enhancing the quantum computation fidelity in the noisy environment of a real world. We begin with a brief introduction to stabilizer codes. The stabilizer formalism of the theory of quantum error correction gives a well-defined description of quantum codes that is used throughout this dissertation. Then, we turn our attention to a quite new subject, namely, topological quantum codes. Topological quantum codes take advantage of the topological characteristics of a physical many-body system. The physical many-body systems studied in the context of topological quantum codes are of two essential natures: they either have intrinsic interaction that self-corrects errors, or are actively corrected to be maintained in a desired quantum state. Examples of the former are the toric code and the unpaired Majorana, while an example for the latter is the surface code. A brief introduction and history of topological phenomena in condensed matter is provided. The unpaired Majorana and the Kitaev toy model are briefly explained. Later we introduce a spin model that maps onto the Kitaev toy model through a sequence of transformations. We show how this model is robust and tolerates local perturbations. The research on this topic, at the time of writing this dissertation, is still incomplete and only preliminary results are represented. As another example of passive error correcting codes with intrinsic Hamiltonian, the toric code is introduced. We also analyze the dynamics of the errors in the toric code known as anyons. We show numerically how the addition of disorder to the physical system underlying the toric code slows down the dynamics of the anyons. We go further and numerically analyze the presence of time-dependent noise and the consequent delocalization of localized errors. The main portion of this dissertation is dedicated to the surface code. We study the surface code coupled to a non-interacting bosonic bath. We show how the interaction between the code and the bosonic bath can effectively induce correlated errors. These correlated errors may be corrected up to some extend. The extension beyond which quantum error correction seems impossible is the error threshold of the code. This threshold is analyzed by mapping the effective correlated error model onto a statistical model. We then study the phase transition in the statistical model. The analysis is in two parts. First, we carry out derivation of the effective correlated model, its mapping onto a statistical model, and perform an exact numerical analysis. Second, we employ a Monte Carlo method to extend the numerical analysis to large system size. We also tackle the problem of surface code with correlated and single-qubit errors by an exact mapping onto a two-dimensional Ising model with boundary fields. We show how the phase transition point in one model, the Ising model, coincides with the intrinsic error threshold of the other model, the surface code.

Journal of International Crisis and Risk Communication Research•Jan 1, 2014•0 citations

Mixed-state topological order and error-correction thresholds in non-Abelian codes: rigorous results

Sun Woo P. Kim, Max McGinley

We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise. Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes, including surface codes, non-Abelian quantum doubles, and string-net codes. In each case, we prove that for noise strengths up to some explicit constant value, any initially encoded logical information can be recovered to high precision, and that the noise-corrupted state exhibits key hallmarks of mixed-state topological order: long-range entanglement and emergent higher-form symmetries. We also describe how these methods can be adapted to higher dimensions and correlated noise models.

quant-pharXiv:2607.21706•Jul 27, 2026•3 citations

Stability of topologically-protected quantum computing proposals as seen through spin glasses

Helmut G. Katzgraber, Ruben S. Andrist

Sensitivity to noise makes most of the current quantum computing schemes prone to error and nonscalable, allowing only for small proof-of-principle devices. Topologically-protected quantum computing aims at solving this problem by encoding quantum bits and gates in topological properties of the hardware medium that are immune to noise that does not impact the entire system at once. There are different approaches to achieve topological stability or active error correction, ranging from quasiparticle braidings to spin models and topological colour codes. The stability of these proposals against noise can be quantified by their error threshold. This figure of merit can be computed by mapping the problem onto complex statistical-mechanical spin-glass models with local disorder on nontrival lattices that can have many-body interactions and are sometimes described by lattice gauge theories. The error threshold for a given source of error then represents the point in the temperature-disorder phase diagram where a stable symmetry-broken phase vanishes. An overview of the techniques used to estimate the error thresholds is given, as well as a summary of recent results on the stability of different topologically-protected quantum computing schemes to different error sources.

arXiv:1306.0540•Journal of Physics Conference Series•Dec 16, 2013•9 citations
Current approaches for building quantum computing devices focus on two-level quantum systems which nicely mimic the concept of a classical bit, albeit enhanced with additional quantum properties. However, rather than artificially limiting the number of states to two, the use of ddd-level quantum systems (qudits) could provide advantages for quantum information processing. Among other merits, it has recently been shown that multilevel quantum systems can offer increased stability to external disturbances. In this study we demonstrate that topological quantum memories built from qudits, also known as Abelian quantum double models, exhibit a substantially increased resilience to noise. That is, even when taking into account the multitude of errors possible for multilevel quantum systems, topological quantum error-correction codes employing qudits can sustain a larger error rate than their two-level counterparts. In particular, we find strong numerical evidence that the thresholds of these error-correction codes are given by the hashing bound. Considering the significantly increased error thresholds attained, this might well outweigh the added complexity of engineering and controlling higher-dimensional quantum systems.
Quantum error correction is an essential ingredient for reliable quantum computation for theoretically provable quantum speedup. Topological color codes, one of the quantum error correction codes, have an advantage against the surface codes in that all Clifford gates can be implemented transversally. However, the hardness of decoding makes the color codes not suitable as the best candidate for experimentally feasible implementation of quantum error correction. Here we propose an Ising model formulation that enables highly accurate decoding of the color codes. In this formulation, we map stabilizer operators to classical spin variables to represent an error satisfying the syndrome. Then we construct an Ising Hamiltonian that counts the number of errors and formulate the decoding problem as an energy minimization problem of an Ising Hamiltonian, which is solved by simulated annealing. In numerical simulations on the (4.8.8) lattice, we find an error threshold of 10.36(5)% for bit-flip noise model, 18.47(5)% for depolarizing noise model, and 2.90(4)% for phenomenological noise model (bit-flip error is located on each of data and measurement qubits), all of which are higher than the thresholds of existing efficient decoding algorithms. Furthermore, we verify that the achieved logical error rates are almost optimal in the sense that they are almost the same as those obtained by exact optimizations by CPLEX with smaller decoding time in many cases. Since the decoding process has been a bottleneck for performance analysis, the proposed decoding method is useful for further exploration of the possibility of the topological color codes. Published by the American Physical Society 2024
The main focus of this thesis is to explore the advantages of using higher-dimensional quantum systems (qudits) as building blocks for fault-tolerant quantum computation. In particular, we investigate the two main essential ingredients of many state-of-the-art fault-tolerant schemes [133], which are magic state distillation and topological error correction. The theory for both of these components is well established for the qubit case, but little has been known for the generalised qudit case. For magic state distillation, we first present a general numerical approach that can be used to investigate the distillation properties of any stabilizer code. We use this approach to study small threedimensional (qutrit) codes and classify, for the first time, new types of qutrit magic states. We then provide an analytic study of a family of distillation protocols based on the quantum Reed-Muller codes. We discover a particular five-dimensional code that, by many measures, outperforms all known qubit codes. For the topological error correction, we study the qudit toric code serving as a quantum memory. For this purpose we examine an efficient renormalization group decoder to estimate the error correction threshold. We find that when the qudit toric code is subject to a generalised bit-flip noise, and for a sufficiently high dimension, a threshold of 30% can be obtained under perfect decoding.
Quantum computers are machines that manipulate quantum information stored in the form of qubits, the quantum analogue to the classical bit.Unlike the bit, quantum mechanics allows a qubit to be in a linear superposition of both its basis states.Given the same number of bits and qubits, the latter stores exponentially more information.Quantum algorithms exploit these superposition states, allowing quantum computers to solve problems such as prime number factorisation and searches faster than classical computers.Realising a large-scale quantum computer is difficult because quantum information is highly susceptible to noise.Error correction may be employed to suppress the noise, so that the results of large quantum algorithms are valid.The overhead incurred from introducing error correction is neutralised if all elementary quantum operations are constructed with an error rate below some threshold error rate.Below threshold, arbitrary length quantum computation is possible.We investigate two topological quantum error correcting codes, the planar code and the 2D colour code.We find the threshold for the 2D colour code to be 0.1%, and improve the planar code threshold from 0.75% to 1.1%.Existing protocols for the transmission of quantum states are hindered by maximum communication distances and low communication rates.We adapt the planar code for use in quantum communication, and show that this allows the fault-tolerant transmission of quantum information over arbitrary distances at a rate limited only by local quantum gate speed.Error correction is an expensive investment and thus one seeks to employ as little as possible without compromising the integrity of the results.It is therefore important to study the robustness of algorithms to noise.We show that using the matrix product state representation allows one to simulate far larger instances of the quantum factoring algorithm than under the traditional amplitude formalism representation.We simulate systems with as many as 42 qubits on a single processor with 32GB RAM, comparable to amplitude formalism simulations performed on far larger computers.
This dissertation is the collection of a progressive research on the topic of topological quantum computation and information with the focus on the error threshold of the well-known models such as the unpaired Majorana, the toric code, and the planar code. We study the basics of quantum computation and quantum information, and in particular quantum error correction. Quantum error correction provides a tool for enhancing the quantum computation fidelity in the noisy environment of a real world. We begin with a brief introduction to stabilizer codes. The stabilizer formalism of the theory of quantum error correction gives a well-defined description of quantum codes that is used throughout this dissertation. Then, we turn our attention to a quite new subject, namely, topological quantum codes. Topological quantum codes take advantage of the topological characteristics of a physical many-body system. The physical many-body systems studied in the context of topological quantum codes are of two essential natures: they either have intrinsic interaction that self-corrects errors, or are actively corrected to be maintained in a desired quantum state. Examples of the former are the toric code and the unpaired Majorana, while an example for the latter is the surface code. A brief introduction and history of topological phenomena in condensed matter is provided. The unpaired Majorana and the Kitaev toy model are briefly explained. Later we introduce a spin model that maps onto the Kitaev toy model through a sequence of transformations. We show how this model is robust and tolerates local perturbations. The research on this topic, at the time of writing this dissertation, is still incomplete and only preliminary results are represented. As another example of passive error correcting codes with intrinsic Hamiltonian, the toric code is introduced. We also analyze the dynamics of the errors in the toric code known as anyons. We show numerically how the addition of disorder to the physical system underlying the toric code slows down the dynamics of the anyons. We go further and numerically analyze the presence of time-dependent noise and the consequent delocalization of localized errors. The main portion of this dissertation is dedicated to the surface code. We study the surface code coupled to a non-interacting bosonic bath. We show how the interaction between the code and the bosonic bath can effectively induce correlated errors. These correlated errors may be corrected up to some extend. The extension beyond which quantum error correction seems impossible is the error threshold of the code. This threshold is analyzed by mapping the effective correlated error model onto a statistical model. We then study the phase transition in the statistical model. The analysis is in two parts. First, we carry out derivation of the effective correlated model, its mapping onto a statistical model, and perform an exact numerical analysis. Second, we employ a Monte Carlo method to extend the numerical analysis to large system size. We also tackle the problem of surface code with correlated and single-qubit errors by an exact mapping onto a two-dimensional Ising model with boundary fields. We show how the phase transition point in one model, the Ising model, coincides with the intrinsic error threshold of the other model, the surface code.
We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise. Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes, including surface codes, non-Abelian quantum doubles, and string-net codes. In each case, we prove that for noise strengths up to some explicit constant value, any initially encoded logical information can be recovered to high precision, and that the noise-corrupted state exhibits key hallmarks of mixed-state topological order: long-range entanglement and emergent higher-form symmetries. We also describe how these methods can be adapted to higher dimensions and correlated noise models.
Sensitivity to noise makes most of the current quantum computing schemes prone to error and nonscalable, allowing only for small proof-of-principle devices. Topologically-protected quantum computing aims at solving this problem by encoding quantum bits and gates in topological properties of the hardware medium that are immune to noise that does not impact the entire system at once. There are different approaches to achieve topological stability or active error correction, ranging from quasiparticle braidings to spin models and topological colour codes. The stability of these proposals against noise can be quantified by their error threshold. This figure of merit can be computed by mapping the problem onto complex statistical-mechanical spin-glass models with local disorder on nontrival lattices that can have many-body interactions and are sometimes described by lattice gauge theories. The error threshold for a given source of error then represents the point in the temperature-disorder phase diagram where a stable symmetry-broken phase vanishes. An overview of the techniques used to estimate the error thresholds is given, as well as a summary of recent results on the stability of different topologically-protected quantum computing schemes to different error sources.