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

Optimizing quantum error correction through error attribution

Yuguo Shao, Zi-Wen Liu

quant-phSubmitted Oct 2, 2026• Announced Oct 5, 2026• 2 citations
arXivHTMLPDF

Abstract

Logical error rate is a standard benchmark for quantum error correction, providing an aggregate measure of the overall effect of physical noise. In actual QEC architectures, errors at different circuit locations can have markedly different effects on logical failure even when their probabilities are equal. Here we introduce an error attribution scheme to quantitatively characterize the influence of individual circuit components on the logical error rate and use this refined information to guide targeted intervention and design for improved QEC performance. Our attribution estimator computes all component sensitivities jointly from the same Monte Carlo samples used to estimate the logical error rate. The resulting sensitivity maps identify hotspots where targeted noise reduction can most effectively improve logical performance. We test the scheme in circuit simulations of rotated surface code memories and high-rate lifted product codes: halving the noise strength on about 5\%-7\% of physical components selected by sensitivity reduces logical error rates by approximately 15\%-25\%, roughly twice the mean reduction from the same intervention on an equal number of randomly selected components. By connecting performance benchmarking to targeted optimization, our scheme provides a practical strategy for improving quantum error correction with limited resources.

AI Summary

Logical error rates aggregate the effects of physical noise but do not identify which circuit components should be improved under a limited calibration budget. This paper studies component-level attribution through sensitivities $S_c=\partial P_{\mathrm L}/\partial p_c$ and linearized marginal risks $p_cS_c$, for specified QEC circuits, noise models, and decoders. A likelihood-ratio estimator computes sensitivities by correlating logical-failure indicators with scores of sampled noise events. Under independent elementary noise components and a fixed decoder, the estimator is unbiased and obtains all sensitivities from the same Monte Carlo shots used to estimate $P_{\mathrm L}$, without additional decoder calls. Contributions can be aggregated across repeated uses of a qubit or coupling. Circuit-level simulations test sensitivity-ranked interventions against random component selection. For rotated surface-code memories at distances $3,5,7$, with $d$ extraction rounds and $p=0.001$, halving noise on approximately $5\%$–$7\%$ of components reduces logical error rates by $14.35\%$, $14.92\%$, and $17.57\%$, versus $7.34\%$, $7.84\%$, and $10.84\%$ for random selection. Three lifted-product codes with 150–300 data qubits at $p=0.002$ show $23\%$–$25\%$ reductions when improving $6.22\%$ of components, versus $12.5\%$–$13.7\%$ randomly. Independent intervention simulations and confidence intervals establish these comparisons. The demonstrations use stochastic depolarizing noise and idealized component-selective noise reductions. Achievable reductions, calibration costs, spatial and temporal noise correlations, and experimental validation remain future work; intervention priorities depend on the circuit, noise model, and decoder.

Little sign of AI-generated textUnclear noveltyMissing comparison

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

Related papers

Error Attribution as a Resource-Allocation Principle for Quantum Error Correction: Sensitivity-Guided Noise Reduction and Its Analytic Limits

Rowan Brad Quni-Gudzinas

Logical error rate is the standard benchmark for quantum error correction (QEC), but it is an aggregate quantity: it says nothing about which circuit components actually drive logical failure. Recent work introduced an error attribution scheme that computes per-component sensitivities $\partial P_L/\partial p_i$ of the logical error rate jointly from the same Monte Carlo samples used to estimate $P_L$, and showed that halving noise on the 5%–7% most sensitive components reduces logical error rates by roughly 15%–25%, about twice the improvement from randomly chosen components [1],[3]. This paper develops the quantitative structure underlying that result. We formalize the sensitivity map, derive the first-order intervention gain for targeted versus random noise-reduction budgets, and show analytically that the targeted-to-random advantage is $\rho = r/(fr + 1 - f)$, where $f$ is the hotspot fraction and $r$ the sensitivity contrast; for $f = 0.06$ and $r = 2.136$ this ratio is exactly $2$, matching the reported factor. We further show that the reported 15%–25% reductions exceed the first-order prediction of about 6% by an amplification factor of approximately $3.15$, which we attribute to nonlinear, multiplicative error propagation absent from independent-error models. We derive Monte Carlo sample-complexity requirements for the sensitivity estimator, situate attribution among channel-optimized, reinforcement-learning, and robustness-optimized QEC strategies, and identify failure modes: coherent noise, estimator variance at low $P_L$, sensitivity redistribution, and non-stationary drift. ## 1. Introduction Quantum error correction protects quantum information by encoding logical qubits redundantly and decoding measured syndromes, and its performance is almost universally reported as a single number: the logical error rate $P_L$, the probability that a logical operator flips during a memory experiment or computation cycle. This aggregate benchmark is necessary but i Full text and updates: papers.qnfo.org/papers/error-attribution-as-a-resource-allocation-principle-for-quantum-error-correctio/

•Oct 5, 2026•0 citations

Efficient Estimation of Logical Sensitivities Through Fault-Counting

Winston Fu, J. Wilson Staples, Jeff D. Thompson

Quantum error-correcting circuits are affected by multiple physical noise mechanisms, whose contributions to logical failure must be understood to evaluate code performance and guide improvements in hardware. The individual error budget contributions for an error type $i$ can be characterized by its logical sensitivity $ν_i = \frac{\partial p_L}{\partial p_i}$, which measures the response of the logical error rate $p_L$ to each physical noise parameter $p_i$. Normally, $ν_i$ is measured using linear fits such as finite differences, where $p_L$ is measured at two or more values of $p_i$ to calculate partial derivatives. In this paper, we develop a differentiable estimator to obtain all components of $\nabla_{\mathbf p}p_L$ simultaneously from a single Monte Carlo data set at one noise configuration, using information about the underlying fault configurations. In surface code simulations with circuit-level noise, the estimator agrees with conventional finite differences while requiring one to two orders of magnitude fewer shots to achieve the same variance. We apply this technique to quantify error budgets, resolve sensitivities at the individual qubit level, and infer effective code distance. Finally, we incorporate the sensitivities into Newton root finding to locate and trace threshold contours in multidimensional noise models. These results provide an efficient method for extracting and applying logical sensitivity information from standard quantum error correction simulations.

quant-pharXiv:2610.10531•Oct 8, 2026•0 citations

Fail fast: techniques to probe rare events in quantum error correction

Michael E. Beverland, Malcolm Carroll, Andrew W. Cross +1 more

The ultimate goal of quantum error correction is to create logical qubits with very low error rates (e.g. 1e-12) and assemble them into large-scale quantum computers capable of performing many (e.g. billions) of logical gates on many (e.g. thousands) of logical qubits. However, it is necessarily difficult to directly assess the performance of such high-quality logical qubits using standard Monte Carlo sampling because logical failure events become very rare. Building on existing approaches to this problem, we develop three complementary techniques to characterize the rare-event regime for general quantum low-density parity-check (qLDPC) codes under circuit noise. (I) We propose a well-motivated, low-parameter ansatz for the failure spectrum (the fraction of fault sets of each size that fail) that empirically fits all the QEC systems we studied and predicts logical error rates at all physical error rates. (II) We find min-weight logical operators of syndrome measurement circuits and exactly compute the number of min-weight failing configurations. (III) We generalize the splitting method to qLDPC codes using multi-seeded Metropolis sampling to improve convergence for systems with many inequivalent logical operators. We apply these tools to distance-6, -12, and -18 bivariate bicycle codes under circuit noise, observing strong low-error-rate performance with the recently proposed Relay decoder but also considerable scope for further improvement.

quant-pharXiv:2511.15177•Nov 20, 2025•32 citations

Rare Event Simulation of Quantum Error-Correcting Circuits

Carolyn Mayer, Anand Ganti, Uzoma Onunkwo +3 more

We describe a practical approach for accessing the logical failure rates of quantum error-correcting (QEC) circuits under low physical (component) failure rate regimes. Standard Monte Carlo is often the de facto approach for studying the failure rates of quantum circuits. However, in the study of fault-tolerant error-correcting circuits, the ability to extend this approach to low physical failure rates is limited. In particular, the use of Monte Carlo to access circuits that are relatively large or have high correcting power becomes more difficult as we lower the input failure rates of the individual components (gates) in the circuit. For these reasons, many simulations studying the circuit model go no lower than end-to-end logical failure rates in the 10 − 6 regime.In this report, we outline an approach that borrows from earlier work by Bravyi and Vargo \cite{bv13} to the more complex circuit noise model. Earlier works studied both the capacity and phenomenological noise models \cite{bv13,Beverland2019,bonilla2021xzzx}, but the work is insufficient for generating similar simulations in the circuit-noise model. To the best of our knowledge, our team is the first to develop a full prescription of the rare event simulation by splitting technique for the circuit-based noise model. We have also generated promising results that are confirmed by standard Monte Carlo simulation under an accessible regime. This work shows that we can access noise in the circuit-model prescription of quantum error-correcting code to failure rates below 10 − 20 regime.

arXiv:2509.13678•Quantum•Oct 15, 2026•18 citations

A Cross-Platform Analysis of Practical Quantum Error Correction Codes

Bryan Pan, Yufeng Xin

The theory of quantum error correction was established decades ago. Yet limitations in physical noise levels and available physical-qubit counts continue to hinder the development of scalable quantum computing systems. In this paper, we present analytical estimates of logical error rates for advanced QEC codes across leading hardware platforms and distributed quantum computing systems using a simple but unified framework. The analysis captures dominant contributors to logical error, including effective circuit volume and two-qubit gate overhead. The framework provides a fast and conservative estimate of logical error rates and identification of dominating factors in different hardware platforms, such as circuit volume, routing overhead, inter-QPU operations, or asymmetric noise protection. We show that several qualitative trends observed in larger-scale simulations can be reproduced and interpreted analytically within this framework. We further demonstrate that the framework can be used to find the sweet spot design region of distributed QEC, which is critical for the design of distributed quantum computing systems.

quant-pharXiv:2607.04082•Jul 7, 2026•0 citations

Quantum Error Correction on Error-mitigated Physical Qubits

Minjun Jeon, Zhenyu Cai

We present a general framework for applying linear quantum error mitigation (QEM) techniques directly to physical qubits within a logical qubit to suppress logical errors. By exploiting the linearity of quantum error correction (QEC), we demonstrate that any linear QEM method$\unicode{x2014}$including probabilistic error cancellation (PEC), zero-noise extrapolation (ZNE), and symmetry verification$\unicode{x2014}$can be integrated into the physical layer without requiring modifications to the subsequent QEC decoder. Applying this framework to memory experiments using PEC, we analytically prove and numerically verify that the leading-order contribution to the logical error can be removed, increasing the effective code distance by 2. Our simulations on repetition and rotated surface codes show that a distance-3 code with physical-level PEC achieves logical error rates lower than or similar to a distance-5 unmitigated code while using 40% and 64% fewer qubits, respectively. These results establish physical-level QEM as a widely compatible and resource-efficient strategy for enhancing logical performance in early fault-tolerant architectures.

quant-pharXiv:2601.18384•Jan 27, 2026•17 citations
Logical error rate is a standard benchmark for quantum error correction, providing an aggregate measure of the overall effect of physical noise. In actual QEC architectures, errors at different circuit locations can have markedly different effects on logical failure even when their probabilities are equal. Here we introduce an error attribution scheme to quantitatively characterize the influence of individual circuit components on the logical error rate and use this refined information to guide targeted intervention and design for improved QEC performance. Our attribution estimator computes all component sensitivities jointly from the same Monte Carlo samples used to estimate the logical error rate. The resulting sensitivity maps identify hotspots where targeted noise reduction can most effectively improve logical performance. We test the scheme in circuit simulations of rotated surface code memories and high-rate lifted product codes: halving the noise strength on about 5%-7% of physical components selected by sensitivity reduces logical error rates by approximately 15%-25%, roughly twice the mean reduction from the same intervention on an equal number of randomly selected components. By connecting performance benchmarking to targeted optimization, our scheme provides a practical strategy for improving quantum error correction with limited resources.
Logical error rates aggregate the effects of physical noise but do not identify which circuit components should be improved under a limited calibration budget. This paper studies component-level attribution through sensitivities Sc=∂PL/∂pcS_c=\partial P_{\mathrm L}/\partial p_cSc​=∂PL​/∂pc​ and linearized marginal risks pcScp_cS_cpc​Sc​, for specified QEC circuits, noise models, and decoders.
A likelihood-ratio estimator computes sensitivities by correlating logical-failure indicators with scores of sampled noise events. Under independent elementary noise components and a fixed decoder, the estimator is unbiased and obtains all sensitivities from the same Monte Carlo shots used to estimate PLP_{\mathrm L}PL​, without additional decoder calls. Contributions can be aggregated across repeated uses of a qubit or coupling.
Circuit-level simulations test sensitivity-ranked interventions against random component selection. For rotated surface-code memories at distances 3,5,73,5,73,5,7, with ddd extraction rounds and p=0.001p=0.001p=0.001, halving noise on approximately 5%5\%5%–7%7\%7% of components reduces logical error rates by 14.35%14.35\%14.35%, 14.92%14.92\%14.92%, and 17.57%17.57\%17.57%, versus 7.34%7.34\%7.34%, 7.84%7.84\%7.84%, and 10.84%10.84\%10.84% for random selection. Three lifted-product codes with 150–300 data qubits at p=0.002p=0.002p=0.002 show 23%23\%23%–25%25\%25% reductions when improving 6.22%6.22\%6.22% of components, versus 12.5%12.5\%12.5%–13.7%13.7\%13.7% randomly. Independent intervention simulations and confidence intervals establish these comparisons.
The demonstrations use stochastic depolarizing noise and idealized component-selective noise reductions. Achievable reductions, calibration costs, spatial and temporal noise correlations, and experimental validation remain future work; intervention priorities depend on the circuit, noise model, and decoder.
Logical error rate is the standard benchmark for quantum error correction (QEC), but it is an aggregate quantity: it says nothing about which circuit components actually drive logical failure. Recent work introduced an error attribution scheme that computes per-component sensitivities ∂PL/∂pi\partial P_L/\partial p_i∂PL​/∂pi​ of the logical error rate jointly from the same Monte Carlo samples used to estimate PLP_LPL​, and showed that halving noise on the 5%–7% most sensitive components reduces logical error rates by roughly 15%–25%, about twice the improvement from randomly chosen components [1],[3]. This paper develops the quantitative structure underlying that result. We formalize the sensitivity map, derive the first-order intervention gain for targeted versus random noise-reduction budgets, and show analytically that the targeted-to-random advantage is ρ=r/(fr+1−f)\rho = r/(fr + 1 - f)ρ=r/(fr+1−f), where fff is the hotspot fraction and rrr the sensitivity contrast; for f=0.06f = 0.06f=0.06 and r=2.136r = 2.136r=2.136 this ratio is exactly 222, matching the reported factor. We further show that the reported 15%–25% reductions exceed the first-order prediction of about 6% by an amplification factor of approximately 3.153.153.15, which we attribute to nonlinear, multiplicative error propagation absent from independent-error models. We derive Monte Carlo sample-complexity requirements for the sensitivity estimator, situate attribution among channel-optimized, reinforcement-learning, and robustness-optimized QEC strategies, and identify failure modes: coherent noise, estimator variance at low PLP_LPL​, sensitivity redistribution, and non-stationary drift. ## 1. Introduction Quantum error correction protects quantum information by encoding logical qubits redundantly and decoding measured syndromes, and its performance is almost universally reported as a single number: the logical error rate PLP_LPL​, the probability that a logical operator flips during a memory experiment or computation cycle. This aggregate benchmark is necessary but i Full text and updates: papers.qnfo.org/papers/error-attribution-as-a-resource-allocation-principle-for-quantum-error-correctio/
Quantum error-correcting circuits are affected by multiple physical noise mechanisms, whose contributions to logical failure must be understood to evaluate code performance and guide improvements in hardware. The individual error budget contributions for an error type iii can be characterized by its logical sensitivity νi=∂pL∂piν_i = \frac{\partial p_L}{\partial p_i}νi​=∂pi​∂pL​​, which measures the response of the logical error rate pLp_LpL​ to each physical noise parameter pip_ipi​. Normally, νiν_iνi​ is measured using linear fits such as finite differences, where pLp_LpL​ is measured at two or more values of pip_ipi​ to calculate partial derivatives. In this paper, we develop a differentiable estimator to obtain all components of ∇ppL\nabla_{\mathbf p}p_L∇p​pL​ simultaneously from a single Monte Carlo data set at one noise configuration, using information about the underlying fault configurations. In surface code simulations with circuit-level noise, the estimator agrees with conventional finite differences while requiring one to two orders of magnitude fewer shots to achieve the same variance. We apply this technique to quantify error budgets, resolve sensitivities at the individual qubit level, and infer effective code distance. Finally, we incorporate the sensitivities into Newton root finding to locate and trace threshold contours in multidimensional noise models. These results provide an efficient method for extracting and applying logical sensitivity information from standard quantum error correction simulations.
The ultimate goal of quantum error correction is to create logical qubits with very low error rates (e.g. 1e-12) and assemble them into large-scale quantum computers capable of performing many (e.g. billions) of logical gates on many (e.g. thousands) of logical qubits. However, it is necessarily difficult to directly assess the performance of such high-quality logical qubits using standard Monte Carlo sampling because logical failure events become very rare. Building on existing approaches to this problem, we develop three complementary techniques to characterize the rare-event regime for general quantum low-density parity-check (qLDPC) codes under circuit noise. (I) We propose a well-motivated, low-parameter ansatz for the failure spectrum (the fraction of fault sets of each size that fail) that empirically fits all the QEC systems we studied and predicts logical error rates at all physical error rates. (II) We find min-weight logical operators of syndrome measurement circuits and exactly compute the number of min-weight failing configurations. (III) We generalize the splitting method to qLDPC codes using multi-seeded Metropolis sampling to improve convergence for systems with many inequivalent logical operators. We apply these tools to distance-6, -12, and -18 bivariate bicycle codes under circuit noise, observing strong low-error-rate performance with the recently proposed Relay decoder but also considerable scope for further improvement.
We describe a practical approach for accessing the logical failure rates of quantum error-correcting (QEC) circuits under low physical (component) failure rate regimes. Standard Monte Carlo is often the de facto approach for studying the failure rates of quantum circuits. However, in the study of fault-tolerant error-correcting circuits, the ability to extend this approach to low physical failure rates is limited. In particular, the use of Monte Carlo to access circuits that are relatively large or have high correcting power becomes more difficult as we lower the input failure rates of the individual components (gates) in the circuit. For these reasons, many simulations studying the circuit model go no lower than end-to-end logical failure rates in the 10 − 6 regime.In this report, we outline an approach that borrows from earlier work by Bravyi and Vargo \cite{bv13} to the more complex circuit noise model. Earlier works studied both the capacity and phenomenological noise models \cite{bv13,Beverland2019,bonilla2021xzzx}, but the work is insufficient for generating similar simulations in the circuit-noise model. To the best of our knowledge, our team is the first to develop a full prescription of the rare event simulation by splitting technique for the circuit-based noise model. We have also generated promising results that are confirmed by standard Monte Carlo simulation under an accessible regime. This work shows that we can access noise in the circuit-model prescription of quantum error-correcting code to failure rates below 10 − 20 regime.
The theory of quantum error correction was established decades ago. Yet limitations in physical noise levels and available physical-qubit counts continue to hinder the development of scalable quantum computing systems. In this paper, we present analytical estimates of logical error rates for advanced QEC codes across leading hardware platforms and distributed quantum computing systems using a simple but unified framework. The analysis captures dominant contributors to logical error, including effective circuit volume and two-qubit gate overhead. The framework provides a fast and conservative estimate of logical error rates and identification of dominating factors in different hardware platforms, such as circuit volume, routing overhead, inter-QPU operations, or asymmetric noise protection. We show that several qualitative trends observed in larger-scale simulations can be reproduced and interpreted analytically within this framework. We further demonstrate that the framework can be used to find the sweet spot design region of distributed QEC, which is critical for the design of distributed quantum computing systems.
We present a general framework for applying linear quantum error mitigation (QEM) techniques directly to physical qubits within a logical qubit to suppress logical errors. By exploiting the linearity of quantum error correction (QEC), we demonstrate that any linear QEM method$\unicode{x2014}$including probabilistic error cancellation (PEC), zero-noise extrapolation (ZNE), and symmetry verification$\unicode{x2014}$can be integrated into the physical layer without requiring modifications to the subsequent QEC decoder. Applying this framework to memory experiments using PEC, we analytically prove and numerically verify that the leading-order contribution to the logical error can be removed, increasing the effective code distance by 2. Our simulations on repetition and rotated surface codes show that a distance-3 code with physical-level PEC achieves logical error rates lower than or similar to a distance-5 unmitigated code while using 40% and 64% fewer qubits, respectively. These results establish physical-level QEM as a widely compatible and resource-efficient strategy for enhancing logical performance in early fault-tolerant architectures.