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

Entropy threshold: A simple proxy for performance of quantum error correction

Diego Ruiz, Aleksander Kubica

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 1 citation
arXivHTMLPDF

Abstract

The rapidly growing landscape of quantum error-correction (QEC) protocols has produced a wealth of numerical data, but comparatively few heuristics for understanding and predicting their performance. Here, we develop a simple entropy-based proxy that predicts the thresholds of a variety of QEC protocols, ranging from the code-capacity setting of Clifford-deformed surface codes with biased Pauli or erasure noise to the circuit-level noise model of the surface or color codes with flag qubits. Our proxy estimates the threshold by locally comparing the noise entropy with the error information gained via stabilizer measurements (or spacetime detectors and flag outcomes in the circuit-level settings). Despite neglecting correlations between stabilizer outcomes and the contribution from code degeneracy, the proxy captures the main trends across diverse settings and yields threshold estimates in good agreement with numerical results. Our work develops much-needed phenomenology that enables simple back-of-the-envelope estimates of QEC performance, recovering and providing an explanation for the results of computationally intensive detailed simulations.

AI Summary

Estimating QEC thresholds usually requires decoding simulations across multiple code sizes. This paper proposes a local entropy-balance heuristic for estimating thresholds from the noise model and stabilizer-measurement circuit, without logical-error simulations. The starting point is the identity $H(L|S)=H(E)-H(S)-H(E|L,S)$, separating physical-error entropy, syndrome information, and degeneracy entropy. For maximum-likelihood decoding, $H(L|S)\leq H_2(p_L)+p_L\log_2(4^k-1)$ and $p_L\leq H(L|S)/2$ connect conditional entropy to logical failure. The estimator neglects degeneracy entropy and approximates syndrome bits as independent, then locates the physical error rate where local noise and syndrome entropies balance. Circuit-level applications replace stabilizer outcomes with spacetime detectors; erasure flags and analog measurement confidence modify the available information. Comparisons with decoding simulations cover surface, XZZX, and XY codes under biased Pauli noise; surface codes with perfect or imperfect erasure information; and surface- and color-code measurement circuits, including flags. The phenomenological surface-code estimate is $3.8\%$, versus $3.3\%$ from a statistical-mechanical calculation. The circuit-level estimate is $0.97\%$, versus $1.5$–$1.8\%$ for an optimal decoder. The heuristic also predicts threshold improvements from flags and soft measurements. The assumptions are examined through exactly computable small surface- and color-code examples, but no general accuracy guarantee is established. Low degeneracy fails for the Bacon–Shor examples. Soft-measurement estimates exceed simulated thresholds, with the discrepancy potentially attributable to either decoder suboptimality or neglected entropy terms.

Little sign of AI-generated textStrong assumptionsOverclaims

Error found: For circuit-level surface-code noise, the entropy proxy predicts 0.97% against a reported optimal-decoder threshold of 1.5–1.8%, a 35–46% underestimate that does not support the surrounding claim of 'strong agreement' in that setting.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
14 pages, 4 figures

Related papers

Accurate optimal quantum error correction thresholds from coherent information

Luis Colmenárez, Ze-Min Huang, Sebastian Diehl +1 more

Quantum error correcting (QEC) codes protect quantum information from decoherence as long as error rates fall below critical error thresholds. In general, obtaining thresholds implies simulating the QEC procedure using, in general, suboptimal decoding strategies. In a few cases and for sufficiently simple noise models, optimal decoding of QEC codes can be framed as a phase transition in disordered classical spin models. In both situations, accurate estimation of thresholds demands intensive computational resources. Here we use the coherent information of the mixed state of noisy QEC codes to accurately estimate the associated optimal QEC thresholds already from small-distance codes at moderate computational cost. We show the effectiveness and versatility of our method by applying it first to the topological surface and color code under bit-flip and depolarizing noise. We then extend the coherent information based methodology to phenomenological and quantum circuit level noise settings. For all examples considered, we obtain highly accurate estimates of optimal error thresholds from small, low-distance instances of the codes, in close agreement with threshold values reported in the literature. Our findings establish the coherent information as a reliable competitive tool for the calculation of optimal thresholds of state-of-the-art QEC codes under realistic noise models. Published by the American Physical Society 2024

arXiv:2312.06664•Physical Review Research•Oct 15, 2024•25 citations

Machine Learning Optimal Quantum Error Correction Thresholds

Dominik Seip, Luis Colmenarez, Markus Schmitt +1 more

As quantum computers remain susceptible to noise, QEC is essential for preserving logical information during computations. However, the performance of QEC codes breaks down beyond certain noise thresholds, revealing fundamental limits on their ability to protect quantum information. These limits can be characterized using information-theoretic measures such as the coherent information, which quantifies the maximum rate at which logical information can be reliably transmitted through a noisy quantum channel. In this work, we establish a direct connection between the CI and the binary cross-entropy loss used when training neural network decoders. Specifically, we show that the CI constitutes a sharp lower bound on the achievable loss for decoders that track logical operators across noisy channels. To this end, we develop a transformer-based neural network model based on maximum likelihood decoding. We train this network to estimate the CI and evaluate its performance on the surface code under three noise models: code capacity, phenomenological, and circuit-level noise. Our results demonstrate that the network accurately predicts CI and yields threshold estimates that closely match known theoretical limits. When used as a decoder, the network significantly outperforms the minimum weight perfect matching decoder in terms of logical error rate. We also introduce a novel soft post-selection scheme that independently treats uncertainty in both logical operators and relies on confidence-based filtering of the network's output. We prove that such post-selection strategies, based on the MLD cosets, are optimal, and demonstrate their scalability in terms of both logical error rate and abort probability. These findings establish transformer-based architectures as powerful tools for QEC and provide the first numerical evidence supporting the optimality and scalability of MLD-based post-selection.

quant-pharXiv:2606.22194•Jun 23, 2026•3 citations

Entropy-Based_Threshold_Estimation_for_Quantum_Error_Correction_A_Simple_and_Interpretable_Engineering_Framework

Koizumi Takao

This work proposes a simple and interpretable engineering framework for estimating operational thresholds in quantum error correction (QEC) systems. Rather than introducing new physical principles or modifying the formal structure of quantum mechanics, the framework reformulates existing concepts from quantum error correction, decoherence modeling, and information indicators into a compact phenomenological model suitable for device calibration and benchmarking. The central element of the approach is an entropy-related scalar indicator that acts as a proxy for accumulated error information. A simple threshold relation connects this indicator with code distance and the measured quantum bit error rate (QBER), allowing effective thresholds to be estimated using a fixed-parameter batch calibration method. The framework is intentionally designed as a lightweight engineering tool. It avoids adaptive learning, online control, and foundational claims regarding quantum measurement or wavefunction collapse. Instead, it focuses on practical usability, interpretability, and low computational cost. Proof-of-concept numerical demonstrations show that parameter estimation converges reliably and that the model provides stable threshold estimates from limited datasets. This approach may be useful for rapid calibration, exploratory benchmarking, and comparative analysis in near-term quantum error correction experiments.

•Jan 19, 2026•0 citations

Improving Threshold for Fault-Tolerant Color-Code Quantum Computing by Flagged Weight Optimization

Yugo Takada, Keisuke Fujii

Color codes are promising quantum error-correction (QEC) codes because they have an advantage over surface codes in that all Clifford gates can be implemented transversally. However, the thresholds of color codes under circuit-level noise are relatively low, mainly because measurements of their high-weight stabilizer generators cause an increase in the circuit depth and, thus, substantial errors are introduced. This makes color codes not the best candidate for fault-tolerant quantum computing. Here, we propose a method to suppress the impact of such errors by optimizing weights of decoders using conditional error probabilities conditioned on the measurement outcomes of flag qubits. In numerical simulations, we improve the threshold of the (4.8.8) color code under circuit-level noise from 0.14% to around 0.27%, which is calculated by using an integer programming decoder. Furthermore, in the (6.6.6) color code, we achieve a circuit-level threshold of around 0.36%, which is almost the same value as the highest value in the previous studies employing the same noise model. In both cases, the effective code distance is also improved compared to a conventional method that uses a single ancilla qubit for each stabilizer measurement. Thereby, the achieved logical error rates at low physical error rates are almost one order of magnitude lower than those of the conventional method with the same code distance. Even when compared to the single-ancilla method with a higher code distance, considering the increased number of qubits used in our method, we achieve lower logical error rates in most cases. This method can also be applied to other weight-based decoders, making the color codes more promising as candidates for the experimental implementation of QEC. Furthermore, one can utilize this approach to improve a threshold of wider classes of QEC codes, such as high-rate quantum low-density parity-check codes. Published by the American Physical Society 2024

arXiv:2402.13958•PRX Quantum•Sep 17, 2024•15 citations

Surface Code Error Correction with Crosstalk Noise

Zeyuan Zhou, Andrew Ji, Yongshan Ding

The design and performance analysis of quantum error correction (QEC) codes are often based on incoherent and independent noise models since it is easy to simulate. However, these models fail to capture realistic hardware noise sources, such as correlated errors (crosstalk), which can significantly impact QEC code performance, especially when they occur between data and ancillary qubits. In this paper, we systematically study various types of crosstalk noise and quantify their effects on surface codes through memory and stability experiments. Based on our findings, we introduce crosstalk-robust implementations of QEC via flag qubit designs and redundant stabilizer checks. We perform both numerical and analytical studies to demonstrate the efficacy of these strategies. In addition, we analyze logical crosstalk in an$[[n, k>1, d]]$code block and establish analytical conditions under which physical crosstalk does not lead to logical crosstalk. Together, our analytical and numerical results shed light on designing QEC codes that are robust against hardware realistic crosstalk noise, paving the way for reliable experimental realization of fault-tolerant quantum computing.

arXiv:2503.04642•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•20 citations

Q-Pandora Unboxed: Characterizing Resilience of Quantum Error Correction Codes Under Biased Noise

Avimita Chatterjee, Subrata Kumar Das, Swaroop Ghosh

Quantum error correction codes (QECCs) are essential for reliable quantum computing as they protect quantum states against noise and errors. Limited research has explored the resilience of QECCs to biased noise, critical for selecting optimal codes. We examine how different noise types impact QECCs, considering the varying susceptibility of quantum systems to specific errors. Our goal is to identify opportunities to minimize the resources—or overhead—needed for effective error correction. We conduct a detailed study on two QECCs—rotated and unrotated surface codes—under various noise models using simulations. Rotated surface codes generally perform better due to their simplicity and lower qubit overhead. They exceed the noise threshold of current quantum processors, making them more effective at lower error rates. This study highlights a hierarchy in surface code implementation based on resource demand, consistently observed across both code types. Our analysis ranks the code-capacity model as the most pessimistic and the circuit-level model as the most realistic, mapping error thresholds that show surface code advantages. Additionally, higher code distances improve performance without excessively increasing qubit overhead. Tailoring surface codes to align with the target logical error rate and the biased physical error profile is crucial for optimizing reliability and resource use.

arXiv:2308.02769•Applied Sciences•Apr 21, 2025•7 citations
The rapidly growing landscape of quantum error-correction (QEC) protocols has produced a wealth of numerical data, but comparatively few heuristics for understanding and predicting their performance. Here, we develop a simple entropy-based proxy that predicts the thresholds of a variety of QEC protocols, ranging from the code-capacity setting of Clifford-deformed surface codes with biased Pauli or erasure noise to the circuit-level noise model of the surface or color codes with flag qubits. Our proxy estimates the threshold by locally comparing the noise entropy with the error information gained via stabilizer measurements (or spacetime detectors and flag outcomes in the circuit-level settings). Despite neglecting correlations between stabilizer outcomes and the contribution from code degeneracy, the proxy captures the main trends across diverse settings and yields threshold estimates in good agreement with numerical results. Our work develops much-needed phenomenology that enables simple back-of-the-envelope estimates of QEC performance, recovering and providing an explanation for the results of computationally intensive detailed simulations.
Estimating QEC thresholds usually requires decoding simulations across multiple code sizes. This paper proposes a local entropy-balance heuristic for estimating thresholds from the noise model and stabilizer-measurement circuit, without logical-error simulations.
The starting point is the identity H(L∣S)=H(E)−H(S)−H(E∣L,S)H(L|S)=H(E)-H(S)-H(E|L,S)H(L∣S)=H(E)−H(S)−H(E∣L,S), separating physical-error entropy, syndrome information, and degeneracy entropy. For maximum-likelihood decoding, H(L∣S)≤H2(pL)+pLlog⁡2(4k−1)H(L|S)\leq H_2(p_L)+p_L\log_2(4^k-1)H(L∣S)≤H2​(pL​)+pL​log2​(4k−1) and pL≤H(L∣S)/2p_L\leq H(L|S)/2pL​≤H(L∣S)/2 connect conditional entropy to logical failure. The estimator neglects degeneracy entropy and approximates syndrome bits as independent, then locates the physical error rate where local noise and syndrome entropies balance. Circuit-level applications replace stabilizer outcomes with spacetime detectors; erasure flags and analog measurement confidence modify the available information.
Comparisons with decoding simulations cover surface, XZZX, and XY codes under biased Pauli noise; surface codes with perfect or imperfect erasure information; and surface- and color-code measurement circuits, including flags. The phenomenological surface-code estimate is 3.8%3.8\%3.8%, versus 3.3%3.3\%3.3% from a statistical-mechanical calculation. The circuit-level estimate is 0.97%0.97\%0.97%, versus 1.51.51.5–1.8%1.8\%1.8% for an optimal decoder. The heuristic also predicts threshold improvements from flags and soft measurements.
The assumptions are examined through exactly computable small surface- and color-code examples, but no general accuracy guarantee is established. Low degeneracy fails for the Bacon–Shor examples. Soft-measurement estimates exceed simulated thresholds, with the discrepancy potentially attributable to either decoder suboptimality or neglected entropy terms.
Quantum error correcting (QEC) codes protect quantum information from decoherence as long as error rates fall below critical error thresholds. In general, obtaining thresholds implies simulating the QEC procedure using, in general, suboptimal decoding strategies. In a few cases and for sufficiently simple noise models, optimal decoding of QEC codes can be framed as a phase transition in disordered classical spin models. In both situations, accurate estimation of thresholds demands intensive computational resources. Here we use the coherent information of the mixed state of noisy QEC codes to accurately estimate the associated optimal QEC thresholds already from small-distance codes at moderate computational cost. We show the effectiveness and versatility of our method by applying it first to the topological surface and color code under bit-flip and depolarizing noise. We then extend the coherent information based methodology to phenomenological and quantum circuit level noise settings. For all examples considered, we obtain highly accurate estimates of optimal error thresholds from small, low-distance instances of the codes, in close agreement with threshold values reported in the literature. Our findings establish the coherent information as a reliable competitive tool for the calculation of optimal thresholds of state-of-the-art QEC codes under realistic noise models. Published by the American Physical Society 2024
As quantum computers remain susceptible to noise, QEC is essential for preserving logical information during computations. However, the performance of QEC codes breaks down beyond certain noise thresholds, revealing fundamental limits on their ability to protect quantum information. These limits can be characterized using information-theoretic measures such as the coherent information, which quantifies the maximum rate at which logical information can be reliably transmitted through a noisy quantum channel. In this work, we establish a direct connection between the CI and the binary cross-entropy loss used when training neural network decoders. Specifically, we show that the CI constitutes a sharp lower bound on the achievable loss for decoders that track logical operators across noisy channels. To this end, we develop a transformer-based neural network model based on maximum likelihood decoding. We train this network to estimate the CI and evaluate its performance on the surface code under three noise models: code capacity, phenomenological, and circuit-level noise. Our results demonstrate that the network accurately predicts CI and yields threshold estimates that closely match known theoretical limits. When used as a decoder, the network significantly outperforms the minimum weight perfect matching decoder in terms of logical error rate. We also introduce a novel soft post-selection scheme that independently treats uncertainty in both logical operators and relies on confidence-based filtering of the network's output. We prove that such post-selection strategies, based on the MLD cosets, are optimal, and demonstrate their scalability in terms of both logical error rate and abort probability. These findings establish transformer-based architectures as powerful tools for QEC and provide the first numerical evidence supporting the optimality and scalability of MLD-based post-selection.
This work proposes a simple and interpretable engineering framework for estimating operational thresholds in quantum error correction (QEC) systems. Rather than introducing new physical principles or modifying the formal structure of quantum mechanics, the framework reformulates existing concepts from quantum error correction, decoherence modeling, and information indicators into a compact phenomenological model suitable for device calibration and benchmarking. The central element of the approach is an entropy-related scalar indicator that acts as a proxy for accumulated error information. A simple threshold relation connects this indicator with code distance and the measured quantum bit error rate (QBER), allowing effective thresholds to be estimated using a fixed-parameter batch calibration method. The framework is intentionally designed as a lightweight engineering tool. It avoids adaptive learning, online control, and foundational claims regarding quantum measurement or wavefunction collapse. Instead, it focuses on practical usability, interpretability, and low computational cost. Proof-of-concept numerical demonstrations show that parameter estimation converges reliably and that the model provides stable threshold estimates from limited datasets. This approach may be useful for rapid calibration, exploratory benchmarking, and comparative analysis in near-term quantum error correction experiments.
Color codes are promising quantum error-correction (QEC) codes because they have an advantage over surface codes in that all Clifford gates can be implemented transversally. However, the thresholds of color codes under circuit-level noise are relatively low, mainly because measurements of their high-weight stabilizer generators cause an increase in the circuit depth and, thus, substantial errors are introduced. This makes color codes not the best candidate for fault-tolerant quantum computing. Here, we propose a method to suppress the impact of such errors by optimizing weights of decoders using conditional error probabilities conditioned on the measurement outcomes of flag qubits. In numerical simulations, we improve the threshold of the (4.8.8) color code under circuit-level noise from 0.14% to around 0.27%, which is calculated by using an integer programming decoder. Furthermore, in the (6.6.6) color code, we achieve a circuit-level threshold of around 0.36%, which is almost the same value as the highest value in the previous studies employing the same noise model. In both cases, the effective code distance is also improved compared to a conventional method that uses a single ancilla qubit for each stabilizer measurement. Thereby, the achieved logical error rates at low physical error rates are almost one order of magnitude lower than those of the conventional method with the same code distance. Even when compared to the single-ancilla method with a higher code distance, considering the increased number of qubits used in our method, we achieve lower logical error rates in most cases. This method can also be applied to other weight-based decoders, making the color codes more promising as candidates for the experimental implementation of QEC. Furthermore, one can utilize this approach to improve a threshold of wider classes of QEC codes, such as high-rate quantum low-density parity-check codes. Published by the American Physical Society 2024
The design and performance analysis of quantum error correction (QEC) codes are often based on incoherent and independent noise models since it is easy to simulate. However, these models fail to capture realistic hardware noise sources, such as correlated errors (crosstalk), which can significantly impact QEC code performance, especially when they occur between data and ancillary qubits. In this paper, we systematically study various types of crosstalk noise and quantify their effects on surface codes through memory and stability experiments. Based on our findings, we introduce crosstalk-robust implementations of QEC via flag qubit designs and redundant stabilizer checks. We perform both numerical and analytical studies to demonstrate the efficacy of these strategies. In addition, we analyze logical crosstalk in an[[n,k>1,d]][[n, k>1, d]][[n,k>1,d]]code block and establish analytical conditions under which physical crosstalk does not lead to logical crosstalk. Together, our analytical and numerical results shed light on designing QEC codes that are robust against hardware realistic crosstalk noise, paving the way for reliable experimental realization of fault-tolerant quantum computing.
Quantum error correction codes (QECCs) are essential for reliable quantum computing as they protect quantum states against noise and errors. Limited research has explored the resilience of QECCs to biased noise, critical for selecting optimal codes. We examine how different noise types impact QECCs, considering the varying susceptibility of quantum systems to specific errors. Our goal is to identify opportunities to minimize the resources—or overhead—needed for effective error correction. We conduct a detailed study on two QECCs—rotated and unrotated surface codes—under various noise models using simulations. Rotated surface codes generally perform better due to their simplicity and lower qubit overhead. They exceed the noise threshold of current quantum processors, making them more effective at lower error rates. This study highlights a hierarchy in surface code implementation based on resource demand, consistently observed across both code types. Our analysis ranks the code-capacity model as the most pessimistic and the circuit-level model as the most realistic, mapping error thresholds that show surface code advantages. Additionally, higher code distances improve performance without excessively increasing qubit overhead. Tailoring surface codes to align with the target logical error rate and the biased physical error profile is crucial for optimizing reliability and resource use.