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:2501.13611 · International Symposium on Lattice Field Theory (LATTICE)

Quantum Error Correction and Z(2) Lattice Gauge Theories

Seyong Kim

Published Jan 30, 2025• 0 citations
arXivHTMLPDF

Abstract

$Z(2)$ lattice gauge theory plays an important role in the study of the threshold probability of Quantum Error Correction (QEC) for a quantum code. For certain QEC codes, such as the well-known Kitaev's toric/surface code, one can find a mapping of the QEC decoding problem onto a statistical mechanics model for a given noise model. The investigation of the threshold probability then corresponds to that of the phase diagram of the mapped statistical mechanics model. This can be studied by Monte Carlo simulation of the statistical mechanics model. In~\cite{Rispler}, we investigate the effects of realistic noise models on the toric/surface code in two dimensions together with syndrome measurement noise and introduce the random coupled-plaquette gauge model, 3-dimensional $Z(2) \times Z(2)$ lattice gauge theory. This new Z(2) gauge theory model captures main aspects of toric/surface code under depolarizing and syndrome noise. In these proceedings, we mainly focus on the aspects of Mont Carlo simulation and discuss preliminary results from Monte Carlo simulations of mapped classes of Z(2) lattice theories.

DOI
10.22323/1.466.0212

Related papers

Lattice gauge theory and topological quantum error correction with quantum deviations in the state preparation and error detection

Yuanchen Zhao, Dong E. Liu

Abstract Quantum deviations or coherent noise are a typical type of noise when implementing gate operations in quantum computers, and their impact on the performance of quantum error correction (QEC) is still elusive. Here, we consider the topological surface code, with both stochastic noise and coherent noise on the multi-qubit entanglement gates during stabilizer measurements in both initial state preparation and error detection. We map a multi-round error detection protocol to a three-dimensional statistical mechanical model consisting of Z_2 gauge interactions and related the error threshold to its phase transition point. Specifically, two error thresholds are identified distinguishing different error correction performances. Below a finite error threshold, in stark contrast to the case with only stochastic errors, unidentifiable measurement errors can cause the failure of QEC in the large code distance limit. This problem can only be fixed at the perfect initial state preparation point. For a finite or small code with distance d, we find that if the preparation error rate is below a crossover scale ~1/log(d), the logical errors can still be suppressed. We conclude that this type of unavoidable coherent noise has a significant impact on QEC performance, and becomes increasingly detrimental as the code distance increases.

•Mar 27, 2023•0 citations

Quantum Error Correction: Surface And Topological Codes

N Raji

Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.

•Mar 12, 2026•0 citations

Percolation Thresholds Unify Quantum Error Correction and Phase Transitions — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface-code error correction thresholds align with percolation-theoretic critical probabilities in 2D lattices, establishing a deep equivalence between quantum error correction and classical statistical-mechanics phase transitions. | MATH: The surface code threshold is governed by the bond-percolation threshold \( p_c \) on the square lattice, \( p_c = 1/2 \). For the Fibonacci Turaev–Viro code (non-Abelian anyons), thresholds map to golden-ratio-related critical exponents. The Kitaev toric code threshold satisfies \( p_{\text{th}} = p_c(\text{square}) = 0.5 \) for perfect syndrome measurement; with faulty measurements, the threshold drops to \( p_{\text{th}} \approx 0.109 \) (matching the 2D random-bond Ising model multicritical point). LDPC codes (Delfosse) exhibit thresholds tied to the percolation transition on expander graphs, where the critical density satisfies \( p_c \sim 1/d \) for degree-\( d \) graphs. | CONNECTION: The square-lattice percolation threshold \( p_c = Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Sep 23, 2026•0 citations

Qudit stabiliser codes for $\mathbb{Z}_N$ lattice gauge theories with matter

Luca Spagnoli, Alessandro Roggero, Nathan Wiebe

In this work we extend the connection between Quantum Error Correction (QEC) and Lattice Gauge Theories (LGTs) by showing that a $\mathbb{Z}_N$ gauge theory with prime dimension $N$ coupled to dynamical matter can be expressed as a qudit stabilizer code. Using the stabilizer formalism we show how to formulate an exact mapping of the encoded $\mathbb{Z}_N$ gauge theory onto two different bosonic models, uncovering a logical duality generated by error correction itself. From this perspective, quantum error correction provides a unifying language to expose dual descriptions of lattice gauge theories. In addition, we generalize earlier $\mathbb{Z}_2$ constructions on qubits to $\mathbb{Z}_N$ on $N$-level qudits and demonstrate how universal fault-tolerant gates can be implemented via state injection between compatible qudit codes.

quant-pharXiv:2602.20661•Feb 25, 2026•0 citations

Ising on the donut: Regimes of topological quantum error correction from statistical mechanics

Lucas H. English, Sam Roberts, Stephen D. Bartlett +2 more

Utility-scale quantum computers require quantum error correcting codes with large numbers of physical qubits to achieve sufficiently low logical error rates. The performance of quantum error correction (QEC) is generally predicted through large-scale numerical simulations, used to estimate thresholds, finite-size scaling, and exponential suppression of logical errors below threshold. The connection of QEC to models from statistical mechanics provides an alternative tool for analysing QEC performance. However, predicting the behaviour of these models also requires large-scale numerical simulations, as analytic solutions are not generally known. Here we exploit an exact mapping, from a toric code under bit-flip noise that is post-selected on being syndrome free to the exactly-solvable two-dimensional Ising model on a torus, to derive an analytic solution for the logical failure rate across its full domain of physical error rates. In particular, this mapping provides closed-form expressions for the logical failure rate in four distinct regimes: the path-counting, below-threshold (ordered), near-threshold (critical), and above-threshold (disordered) regimes. Our framework places a number of familiar and long-standing numerical observations on firm theoretical ground. It also motivates explicit ansatze for the conventional QEC setting of non-post-selected codes whose statistical mechanics mappings involve random-bond disorder. Specifically, we introduce an effective tension model for the below-threshold regime, and a new scaling ansatz for the near-threshold regime, derived from an analysis of the domain wall energy cost distributions. By bridging statistical mechanics theory and quantum error correction practice, our results offer a new toolkit for designing, benchmarking, and understanding topological codes beyond current computational limits.

quant-pharXiv:2512.10399•PRX Quantum•Dec 12, 2025•0 citations

Quantum Error Correction as Lattice Gauge Theory on the D4 Lattice — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum error correction (QEC) stabilizer codes, particularly CSS codes, map directly onto lattice gauge theory (LGT) with the B2 root system (D4 lattice) as the underlying geometric scaffold; gauge symmetry is not redundancy but an information-theoretic resource for fault tolerance. | MATH: Stabilizer group \( S \subset \mathcal{P}_n \) (Pauli group), CSS code condition \( H_X H_Z^T = 0 \) (mod 2); B2 root system: \( \{\pm e_1 \pm e_2, \pm e_1, \pm e_2\} \) → D4 lattice (checkerboard, kissing number 24); plaquette operators \( B_p = \prod_{\ell \in \partial p} \sigma_\ell^z \), vertex operators \( A_v = \prod_{\ell \ni v} \sigma_\ell^x \); toric code: \( |\psi\rangle = \sum_{g} |g\rangle \) with \( A_v|\psi\rangle = B_p|\psi\rangle = |\psi\rangle \). | CONNECTION: B2/D4 lattice is the root system of \( SO(8) \) — its Weyl group order 192, with Coxeter number 6. The ratio of distances between B2 root lengths (long:short = \( \sqrt{2}:1 \)) yields \( 1/\sqrt{2} \approx 0.707 \) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 3, 2026•0 citations
Z(2)Z(2)Z(2) lattice gauge theory plays an important role in the study of the threshold probability of Quantum Error Correction (QEC) for a quantum code. For certain QEC codes, such as the well-known Kitaev's toric/surface code, one can find a mapping of the QEC decoding problem onto a statistical mechanics model for a given noise model. The investigation of the threshold probability then corresponds to that of the phase diagram of the mapped statistical mechanics model. This can be studied by Monte Carlo simulation of the statistical mechanics model. In~\cite{Rispler}, we investigate the effects of realistic noise models on the toric/surface code in two dimensions together with syndrome measurement noise and introduce the random coupled-plaquette gauge model, 3-dimensional Z(2)×Z(2)Z(2) \times Z(2)Z(2)×Z(2) lattice gauge theory. This new Z(2) gauge theory model captures main aspects of toric/surface code under depolarizing and syndrome noise. In these proceedings, we mainly focus on the aspects of Mont Carlo simulation and discuss preliminary results from Monte Carlo simulations of mapped classes of Z(2) lattice theories.
Abstract Quantum deviations or coherent noise are a typical type of noise when implementing gate operations in quantum computers, and their impact on the performance of quantum error correction (QEC) is still elusive. Here, we consider the topological surface code, with both stochastic noise and coherent noise on the multi-qubit entanglement gates during stabilizer measurements in both initial state preparation and error detection. We map a multi-round error detection protocol to a three-dimensional statistical mechanical model consisting of Z_2 gauge interactions and related the error threshold to its phase transition point. Specifically, two error thresholds are identified distinguishing different error correction performances. Below a finite error threshold, in stark contrast to the case with only stochastic errors, unidentifiable measurement errors can cause the failure of QEC in the large code distance limit. This problem can only be fixed at the perfect initial state preparation point. For a finite or small code with distance d, we find that if the preparation error rate is below a crossover scale ~1/log(d), the logical errors can still be suppressed. We conclude that this type of unavoidable coherent noise has a significant impact on QEC performance, and becomes increasingly detrimental as the code distance increases.
Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.
FINDING: Surface-code error correction thresholds align with percolation-theoretic critical probabilities in 2D lattices, establishing a deep equivalence between quantum error correction and classical statistical-mechanics phase transitions. | MATH: The surface code threshold is governed by the bond-percolation threshold pc p_c pc​ on the square lattice, pc=1/2 p_c = 1/2 pc​=1/2. For the Fibonacci Turaev–Viro code (non-Abelian anyons), thresholds map to golden-ratio-related critical exponents. The Kitaev toric code threshold satisfies pth=pc(square)=0.5 p_{\text{th}} = p_c(\text{square}) = 0.5 pth​=pc​(square)=0.5 for perfect syndrome measurement; with faulty measurements, the threshold drops to pth≈0.109 p_{\text{th}} \approx 0.109 pth​≈0.109 (matching the 2D random-bond Ising model multicritical point). LDPC codes (Delfosse) exhibit thresholds tied to the percolation transition on expander graphs, where the critical density satisfies pc∼1/d p_c \sim 1/d pc​∼1/d for degree-d d d graphs. | CONNECTION: The square-lattice percolation threshold \( p_c = Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Qudit stabiliser codes for ZN\mathbb{Z}_NZN​ lattice gauge theories with matter
In this work we extend the connection between Quantum Error Correction (QEC) and Lattice Gauge Theories (LGTs) by showing that a ZN\mathbb{Z}_NZN​ gauge theory with prime dimension NNN coupled to dynamical matter can be expressed as a qudit stabilizer code. Using the stabilizer formalism we show how to formulate an exact mapping of the encoded ZN\mathbb{Z}_NZN​ gauge theory onto two different bosonic models, uncovering a logical duality generated by error correction itself. From this perspective, quantum error correction provides a unifying language to expose dual descriptions of lattice gauge theories. In addition, we generalize earlier Z2\mathbb{Z}_2Z2​ constructions on qubits to ZN\mathbb{Z}_NZN​ on NNN-level qudits and demonstrate how universal fault-tolerant gates can be implemented via state injection between compatible qudit codes.
Utility-scale quantum computers require quantum error correcting codes with large numbers of physical qubits to achieve sufficiently low logical error rates. The performance of quantum error correction (QEC) is generally predicted through large-scale numerical simulations, used to estimate thresholds, finite-size scaling, and exponential suppression of logical errors below threshold. The connection of QEC to models from statistical mechanics provides an alternative tool for analysing QEC performance. However, predicting the behaviour of these models also requires large-scale numerical simulations, as analytic solutions are not generally known. Here we exploit an exact mapping, from a toric code under bit-flip noise that is post-selected on being syndrome free to the exactly-solvable two-dimensional Ising model on a torus, to derive an analytic solution for the logical failure rate across its full domain of physical error rates. In particular, this mapping provides closed-form expressions for the logical failure rate in four distinct regimes: the path-counting, below-threshold (ordered), near-threshold (critical), and above-threshold (disordered) regimes. Our framework places a number of familiar and long-standing numerical observations on firm theoretical ground. It also motivates explicit ansatze for the conventional QEC setting of non-post-selected codes whose statistical mechanics mappings involve random-bond disorder. Specifically, we introduce an effective tension model for the below-threshold regime, and a new scaling ansatz for the near-threshold regime, derived from an analysis of the domain wall energy cost distributions. By bridging statistical mechanics theory and quantum error correction practice, our results offer a new toolkit for designing, benchmarking, and understanding topological codes beyond current computational limits.
FINDING: Quantum error correction (QEC) stabilizer codes, particularly CSS codes, map directly onto lattice gauge theory (LGT) with the B2 root system (D4 lattice) as the underlying geometric scaffold; gauge symmetry is not redundancy but an information-theoretic resource for fault tolerance. | MATH: Stabilizer group S⊂Pn S \subset \mathcal{P}_n S⊂Pn​ (Pauli group), CSS code condition HXHZT=0 H_X H_Z^T = 0 HX​HZT​=0 (mod 2); B2 root system: {±e1±e2,±e1,±e2} \{\pm e_1 \pm e_2, \pm e_1, \pm e_2\} {±e1​±e2​,±e1​,±e2​} → D4 lattice (checkerboard, kissing number 24); plaquette operators Bp=∏ℓ∈∂pσℓz B_p = \prod_{\ell \in \partial p} \sigma_\ell^z Bp​=∏ℓ∈∂p​σℓz​, vertex operators Av=∏ℓ∋vσℓx A_v = \prod_{\ell \ni v} \sigma_\ell^x Av​=∏ℓ∋v​σℓx​; toric code: ∣ψ⟩=∑g∣g⟩ |\psi\rangle = \sum_{g} |g\rangle ∣ψ⟩=∑g​∣g⟩ with Av∣ψ⟩=Bp∣ψ⟩=∣ψ⟩ A_v|\psi\rangle = B_p|\psi\rangle = |\psi\rangle Av​∣ψ⟩=Bp​∣ψ⟩=∣ψ⟩. | CONNECTION: B2/D4 lattice is the root system of SO(8) SO(8) SO(8) — its Weyl group order 192, with Coxeter number 6. The ratio of distances between B2 root lengths (long:short = 2:1 \sqrt{2}:1 2​:1) yields 1/2≈0.707 1/\sqrt{2} \approx 0.707 1/2​≈0.707 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com