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

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

Rowan Brad Quni-Gudzinas

Published Oct 5, 2026• 0 citations
Publisher

Abstract

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/

DOI
10.5281/zenodo.23169726

Related papers

Optimizing quantum error correction through error attribution

Yuguo Shao, Zi-Wen Liu

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.

quant-pharXiv:2610.03399•Oct 5, 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•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

Analyzing Decoders for Quantum Error Correction

Abtin Molavi, Feras Saad, Aws Albarghouthi

Quantum error correction (QEC) enables reliable computation on noisy hardware by encoding logical information across many physical qubits and periodically measuring parities to detect errors. A decoder is the classical algorithm that uses these measurements to infer which error most likely occurred, so that the system can correct it. The decoder's accuracy-how rarely it makes the wrong guess-directly determines the scale of quantum computation that can be reliably executed. With a wealth of competing decoding algorithms, a QEC system designer needs reliable methods to evaluate them. Today, the dominant approach is to evaluate decoders using Monte Carlo simulation. However, simulation has several drawbacks such as requiring many samples to produce low variance estimates. In this work, we develop a new systematic analysis for evaluating decoders. We introduce a novel formal semantics of a core language for QEC programs that captures the de facto standard Stim circuit format, providing a principled theoretical foundation for the emerging space of fault-tolerant quantum systems design. Given a QEC program and a decoder, our verifier can quantify both the decoder accuracy and the decoder robustness to drift in physical error rate. Our approach has two key components: (i) a structured search over the space of possible errors; and (ii) a constrained polynomial optimization kernel. A thorough empirical evaluation of our approach suggests that it can outperform simulation, especially in low error rate regimes, and that it can be deployed to quantify decoder robustness over an interval of physical error rates.

cs.PLCross-listedarXiv:2603.20127•Mar 23, 2026•0 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•0 citations

Qubit Error Correction in Quantum Computing Simulations: Do Larger Repetition Codes Reduce Logical Errors?

Sanjeev Tamilselvan, Tanuj Ranjith

Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.

•Mar 31, 2026•0 citations
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/
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.
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.
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.
Quantum error correction (QEC) enables reliable computation on noisy hardware by encoding logical information across many physical qubits and periodically measuring parities to detect errors. A decoder is the classical algorithm that uses these measurements to infer which error most likely occurred, so that the system can correct it. The decoder's accuracy-how rarely it makes the wrong guess-directly determines the scale of quantum computation that can be reliably executed. With a wealth of competing decoding algorithms, a QEC system designer needs reliable methods to evaluate them. Today, the dominant approach is to evaluate decoders using Monte Carlo simulation. However, simulation has several drawbacks such as requiring many samples to produce low variance estimates. In this work, we develop a new systematic analysis for evaluating decoders. We introduce a novel formal semantics of a core language for QEC programs that captures the de facto standard Stim circuit format, providing a principled theoretical foundation for the emerging space of fault-tolerant quantum systems design. Given a QEC program and a decoder, our verifier can quantify both the decoder accuracy and the decoder robustness to drift in physical error rate. Our approach has two key components: (i) a structured search over the space of possible errors; and (ii) a constrained polynomial optimization kernel. A thorough empirical evaluation of our approach suggests that it can outperform simulation, especially in low error rate regimes, and that it can be deployed to quantify decoder robustness over an interval of physical error rates.
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.
Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.