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

Quantum error correction, statistical physics and tensor networks

Joel Sandås, Gustaf Ström, Amanda Lödevik, Fredrik Ljungström

Published Jun 17, 2024• 0 citations
OpenAlex

Abstract

The aim of this bachelor’s thesis is to investigate the approach of using the Ising model on a Clifford-deformed surface code (CDSC). For this purpose an original CDSC, which has been given the name G81, has been constructed and analyzed using the Ising model. A partial analytical solution has been calculated for the G81 code using the Ising model at a specific point, which has been compared with numerical calculations obtained using a tensor network-based decoder. The tensor network-based decoder has been used on the G81 code to find properties dependent on the size of the code. The partial analytical solution did expectedly not correspond to the numerical calculations, which confirms that the solution is not fully complete. However, the numerical calculations obtained for the G81 code are similar to the analytical solution for the XZZX code in the special point, which opens for the questions if the two are equivalent. The threshold for the physical error probability for the G81 code is approximately p ≈ 0.3 for η = 30.

Related papers

Clifford-Deformed Surface Codes

Arpit Dua, Aleksander Kubica, Liang Jiang +2 more

Various realizations of Kitaev’s surface code perform surprisingly well for biased Pauli noise. Attracted by these potential gains, we study the performance of Clifford-deformed surface codes (CDSCs) obtained from the surface code by the application of single-qubit Clifford operators. We first analyze CDSCs on the 3×3 square lattice and find that, depending on the noise bias, their logical error rates can differ by orders of magnitude. To explain the observed behavior, we introduce the effective distance d′ , which reduces to the standard distance for unbiased noise. To study CDSC performance in the thermodynamic limit, we focus on random CDSCs. Using the statistical mechanical mapping for quantum codes, we uncover a phase diagram that describes random CDSC families with 50% threshold at infinite bias. In the high-threshold region, we further demonstrate that typical code realizations outperform the thresholds and subthreshold logical error rates, at finite bias, of the best-known translationally invariant codes. We demonstrate the practical relevance of these random CDSC families by constructing a translation-invariant CDSC belonging to a high-performance random CDSC family. We also show that our translation-invariant CDSC outperforms well-known translation-invariant CDSCs, such as the XZZX and XY codes. Published by the American Physical Society 2024

arXiv:2201.07802•PRX Quantum•Mar 19, 2024•59 citations

Tensor-Network Decoding Beyond 2D

Christophe Piveteau, Christopher T. Chubb, Joseph M. Renes

Decoding algorithms based on approximate tensor-network (TN) contraction have proven tremendously successful in decoding two-dimensional (2D) local quantum codes such as toric or surface codes and color codes, effectively achieving optimal decoding accuracy. In this work, we introduce several techniques to generalize TN decoding to higher dimensions so that it can be applied to three-dimensional (3D) codes as well as 2D codes with noisy syndrome measurements (phenomenological noise or circuit-level noise). The 3D case is significantly more challenging than 2D, as the involved approximate tensor contraction is dramatically less well behaved than its 2D counterpart. Nonetheless, we numerically demonstrate that the decoding accuracy of our approach outperforms state-of-the-art decoders on the 3D surface code, both in the point and loop sectors, as well as for depolarizing noise. Our techniques could prove useful in near-term experimental demonstrations of quantum error correction, when decoding is to be performed off line and accuracy is of the utmost importance. To this end, we show how TN decoding can be applied to circuit-level noise and demonstrate that it outperforms the matching decoder on the rotated surface code. Published by the American Physical Society 2024

arXiv:2310.10722•PRX Quantum•Oct 8, 2024•38 citations

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

Decoding the surface code using graph neural networks

Moritz Lange

Quantum error correction is essential to achieve fault-tolerant quantum computation in the presence of noisy qubits. Among the most promising approaches to quantum error correction is the surface code, thanks to a scalable two-dimensional architecture, only nearest-neighbor interactions, and a high error threshold. Decoding the surface code, i.e. finding the most likely error chain given a syndrome measurement outcome is a computationally complex task. Traditional decoders rely on classical algorithms, which, especially for larger systems, can be slow and may not always converge to the optimal solution. This thesis presents a novel approach to decoding the surface code using graph neural networks. By mapping the syndrome measurements to a graph and performing graph classification, we find that the graph neural networks can predict the most likely error configuration with high accuracy. Our results show that the GNN-based decoder outperforms the classic minimum weight perfect matching (MWPM) decoder in terms of accuracy. With a phenomenological noise model with depolarizing noise and perfect syndrome measurements, our networks beat MWPM up to code-size 15 across all relevant error rates. Furthermore, the GNN is capable of surpassing MWPM under circuit-level noise up to code size 7. We also show that training the network on repetition code data from a recent experiment [Google Quantum AI, Nature 614, 676 (2023)] produces per-step error rates comparable to those achieved with a matching decoder specifically adapted to the error rates of the physical qubits. This indicates that graph neural network decoders are capable of learning the underlying error distribution on the qubits. Our findings advance the field of quantum error correction and provide a promising new direction for the development of efficient decoding algorithms.

•Oct 17, 2023•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

Exact results on finite size corrections for surface codes tailored to biased noise

Yinzi Xiao, Basudha Srivastava, Mats Granath

The code-capacity threshold of a scalable quantum error correcting stabilizer code can be expressed as a thermodynamic phase transition of a corresponding random-bond Ising model. Here we study the XY and XZZX surface codes under phase-biased noise, px=py=pz/(2η) , with η≥1/2 , and total error rate p=px+py+pz . By appropriately formulating the boundary conditions, in the rotated code geometry, we find exact solutions at a special disordered point, p=1+η−12+η−1≳0.5 , for arbitrary odd code distance d , where the codes reduce to one-dimensional Ising models. The total logical failure rate is given by Pf=34−14e−2dZartanh(1/2η) , where dZ=d2 and d for the two codes respectively, is the effective code distance for pure phase-flip noise. As a consequence, for code distances d≪η , and error rates near the threshold, the XZZX code is effectively equivalent to the phase-flip correcting repetition code over d qubits. The large finite size corrections for dZ<η also make threshold extractions, from numerical calculations at moderate code distances, unreliable. We show that calculating thresholds based not only on the total logical failure rate, but also independently on the phase- and bit-flip logical failure rates, gives a more confident estimate. Using this method for the XZZX code with a tensor-network based decoder and code distances up to d≈100 , we find that the thresholds converge to a single value at moderate bias ( η=30,100 ), at an error rate above the hashing bound.

arXiv:2401.04008•Quantum•Sep 11, 2024•7 citations
The aim of this bachelor’s thesis is to investigate the approach of using the Ising model on a Clifford-deformed surface code (CDSC). For this purpose an original CDSC, which has been given the name G81, has been constructed and analyzed using the Ising model. A partial analytical solution has been calculated for the G81 code using the Ising model at a specific point, which has been compared with numerical calculations obtained using a tensor network-based decoder. The tensor network-based decoder has been used on the G81 code to find properties dependent on the size of the code. The partial analytical solution did expectedly not correspond to the numerical calculations, which confirms that the solution is not fully complete. However, the numerical calculations obtained for the G81 code are similar to the analytical solution for the XZZX code in the special point, which opens for the questions if the two are equivalent. The threshold for the physical error probability for the G81 code is approximately p ≈ 0.3 for η = 30.
Various realizations of Kitaev’s surface code perform surprisingly well for biased Pauli noise. Attracted by these potential gains, we study the performance of Clifford-deformed surface codes (CDSCs) obtained from the surface code by the application of single-qubit Clifford operators. We first analyze CDSCs on the 3×3 square lattice and find that, depending on the noise bias, their logical error rates can differ by orders of magnitude. To explain the observed behavior, we introduce the effective distance d′ , which reduces to the standard distance for unbiased noise. To study CDSC performance in the thermodynamic limit, we focus on random CDSCs. Using the statistical mechanical mapping for quantum codes, we uncover a phase diagram that describes random CDSC families with 50% threshold at infinite bias. In the high-threshold region, we further demonstrate that typical code realizations outperform the thresholds and subthreshold logical error rates, at finite bias, of the best-known translationally invariant codes. We demonstrate the practical relevance of these random CDSC families by constructing a translation-invariant CDSC belonging to a high-performance random CDSC family. We also show that our translation-invariant CDSC outperforms well-known translation-invariant CDSCs, such as the XZZX and XY codes. Published by the American Physical Society 2024
Decoding algorithms based on approximate tensor-network (TN) contraction have proven tremendously successful in decoding two-dimensional (2D) local quantum codes such as toric or surface codes and color codes, effectively achieving optimal decoding accuracy. In this work, we introduce several techniques to generalize TN decoding to higher dimensions so that it can be applied to three-dimensional (3D) codes as well as 2D codes with noisy syndrome measurements (phenomenological noise or circuit-level noise). The 3D case is significantly more challenging than 2D, as the involved approximate tensor contraction is dramatically less well behaved than its 2D counterpart. Nonetheless, we numerically demonstrate that the decoding accuracy of our approach outperforms state-of-the-art decoders on the 3D surface code, both in the point and loop sectors, as well as for depolarizing noise. Our techniques could prove useful in near-term experimental demonstrations of quantum error correction, when decoding is to be performed off line and accuracy is of the utmost importance. To this end, we show how TN decoding can be applied to circuit-level noise and demonstrate that it outperforms the matching decoder on the rotated surface code. Published by the American Physical Society 2024
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
Quantum error correction is essential to achieve fault-tolerant quantum computation in the presence of noisy qubits. Among the most promising approaches to quantum error correction is the surface code, thanks to a scalable two-dimensional architecture, only nearest-neighbor interactions, and a high error threshold. Decoding the surface code, i.e. finding the most likely error chain given a syndrome measurement outcome is a computationally complex task. Traditional decoders rely on classical algorithms, which, especially for larger systems, can be slow and may not always converge to the optimal solution. This thesis presents a novel approach to decoding the surface code using graph neural networks. By mapping the syndrome measurements to a graph and performing graph classification, we find that the graph neural networks can predict the most likely error configuration with high accuracy. Our results show that the GNN-based decoder outperforms the classic minimum weight perfect matching (MWPM) decoder in terms of accuracy. With a phenomenological noise model with depolarizing noise and perfect syndrome measurements, our networks beat MWPM up to code-size 15 across all relevant error rates. Furthermore, the GNN is capable of surpassing MWPM under circuit-level noise up to code size 7. We also show that training the network on repetition code data from a recent experiment [Google Quantum AI, Nature 614, 676 (2023)] produces per-step error rates comparable to those achieved with a matching decoder specifically adapted to the error rates of the physical qubits. This indicates that graph neural network decoders are capable of learning the underlying error distribution on the qubits. Our findings advance the field of quantum error correction and provide a promising new direction for the development of efficient decoding algorithms.
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.
The code-capacity threshold of a scalable quantum error correcting stabilizer code can be expressed as a thermodynamic phase transition of a corresponding random-bond Ising model. Here we study the XY and XZZX surface codes under phase-biased noise, px=py=pz/(2η) , with η≥1/2 , and total error rate p=px+py+pz . By appropriately formulating the boundary conditions, in the rotated code geometry, we find exact solutions at a special disordered point, p=1+η−12+η−1≳0.5 , for arbitrary odd code distance d , where the codes reduce to one-dimensional Ising models. The total logical failure rate is given by Pf=34−14e−2dZartanh(1/2η) , where dZ=d2 and d for the two codes respectively, is the effective code distance for pure phase-flip noise. As a consequence, for code distances d≪η , and error rates near the threshold, the XZZX code is effectively equivalent to the phase-flip correcting repetition code over d qubits. The large finite size corrections for dZ<η also make threshold extractions, from numerical calculations at moderate code distances, unreliable. We show that calculating thresholds based not only on the total logical failure rate, but also independently on the phase- and bit-flip logical failure rates, gives a more confident estimate. Using this method for the XZZX code with a tensor-network based decoder and code distances up to d≈100 , we find that the thresholds converge to a single value at moderate bias ( η=30,100 ), at an error rate above the hashing bound.