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.12400

Measure Now, Mitigate Later: Virtual Error Cancellation for Logical Quantum Circuits

Oles Shtanko, Saswata Roy, Shashwat Kumar, Zlatko Minev

quant-phSubmitted Oct 8, 2026• Announced Oct 9, 2026• 1 citation
arXivHTMLPDF

Abstract

Early fault-tolerant quantum algorithms are a key step in scalable quantum computing, but are ultimately constrained by residual, uncorrectable logical errors. Logical quantum error mitigation can eliminate this bias, however its standard requirements include prior noise characterization, more complex experiments, and substantial sampling overhead. Although no mitigation technique can simultaneously overcome all three constraints, we demonstrate that the first two---noise learning and need for modified circuits---can be completely bypassed for logical circuits by leveraging only syndrome records. Specifically, we introduce virtual error cancellation: a method that, unlike previous bias-free approaches, operates entirely in classical post-processing on universal quantum circuits. We develop and numerically test end-to-end protocols that reduce the sampling overhead beyond fundamental limitations of existing syndrome-aware mitigation techniques, including syndrome-based postselection. In particular, we propose a scheme that pairs the low-latency decoder used in the experiment with a high-complexity decoder run in post-processing. In numerical simulations of a distance-7 rotated surface code, we show that our full-stack dual-decoder algorithm exhibits an error that diminishes as the number of samples increases, capable of reaching more than three orders of magnitude of suppression compared to the decoded logical error rate in an experimentally achievable setting. These results establish syndrome records as a resource for correcting universal computational estimates after quantum execution.

AI Summary

The paper asks whether residual logical errors can be canceled using only syndrome records and measurement outcomes from an otherwise unmodified fault-tolerant computation. It introduces virtual error cancellation (VEC), which learns parameters of a prescribed detector error model from recorded syndromes and assigns signed classical weights to shots. Exact cancellation of a conditional logical Pauli channel requires $\mathbb{E}[w]=1$ and $\mathbb{E}[wp_\alpha]=0$ for every nonidentity logical Pauli component. A constrained variance minimization gives the optimal sampling overhead $C^*_{\rm syn}=1+\bar{\mathbf p}^{\top}\Sigma^{-1}\bar{\mathbf p}$, assuming invertible posterior covariance $\Sigma$. A coarse-grained implementation partitions shots by agreement or directional disagreement between a fast real-time decoder and a more accurate offline decoder. Under informative-disagreement assumptions, its overhead is $1+O(p_L)$; favorable asymptotics approach $1+p_L$, versus benchmarks $1+2p_L$ for single-decoder syndrome-aware mitigation and $1+4p_L$ for standard logical PEC. The paper also describes layerwise composition and integration with non-Clifford teleportation gadgets. Code-capacity depolarizing-noise simulations use rotated surface codes of distances $3,5,7$, pairing MWPM with exact maximum-likelihood decoding. At distance $7$, the syndrome-resolved overhead slope reaches approximately $1.3$. With $10^7$ learning shots at physical error rate $0.005$, the modeled residual bias falls from $1.32\times10^{-6}$ to $7.95\times10^{-10}$; this excludes readout sampling noise. Stated limitations include the Pauli-noise assumption, computationally expensive posterior evaluation and microscopic noise learning, and the absence of circuit-level numerical benchmarks. Residual coherent errors and undetectable magic-state output errors are not generally canceled.

Little sign of AI-generated textOverclaimsStrong assumptions

Central claim may not hold: The numerical validation concerns individual surface-code patches under code-capacity noise, not complete universal circuits with noisy syndrome extraction and feedforward. The full-circuit extension does not establish the conditional cancellation or factorization needed for products of local weights to cancel errors across correlated decoding-window seams. Undetectable magic-state output errors are explicitly left uncanceled, so the proposed universal-circuit protocol can retain systematic bias as the sampling budget increases. The reported thousandfold suppression measures model-evaluated systematic bias with readout shot noise excluded, rather than demonstrated sampled computational accuracy. The printed depolarizing coset partition function omits the factor of three in each nonidentity Pauli weight, although whether this affects the implementation is unknown.

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

Related papers

Syndrome aware mitigation of logical errors

Dorit Aharonov, Yosi Atia, Eyal Bairey +6 more

Broad applications of quantum computers will require error correction (EC). However, hardware roadmaps indicate that physical qubit numbers will remain limited in the foreseeable future, leading to residual logical errors that constrain the size and accuracy of achievable computations. Recent work suggested logical error mitigation (LEM), which applies known error mitigation (EM) methods to logical errors, eliminating their effect at the cost of a runtime overhead. We introduce syndrome-aware logical error mitigation (SALEM), which mitigates logical errors conditioned on the error syndromes measured during error correction. The runtime overhead of SALEM is exponentially lower than that of LEM schemes which do not make use of syndrome data, enabling substantially larger circuit volumes that can be executed accurately. Compared to the routinely used combination of error correction and syndrome rejection (post-selection), SALEM increases the size of reliably executable computations by orders of magnitude. In the practical setting where space and time overheads are fixed and error reduction methods are compared by their resulting estimation errors, we observe a surprising phenomenon: SALEM, which tightly combines EC with EM, can outperform physical EM even above the standard fault-tolerance (pseudo) threshold. Thus, SALEM can make use of EC in regimes of physical error rates where EC is commonly deemed useless.

quant-pharXiv:2512.23810•Dec 31, 2025•14 citations

An Independent Reproduction and Stress Test of Logical Virtual Error Cancellation: Partial Replication of "Measure Now, Mitigate Later" (arXiv:2610.12400)

Amit Brahmbhatt

This report presents an independent, simulation-only reproduction of the logical virtual error cancellation (VEC) protocol of Shtanko, Roy, Kumar and Minev, "Measure Now, Mitigate Later: Virtual Error Cancellation for Logical Quantum Circuits" (arXiv:2610.12400). VEC reweights stored syndrome records by signed decoder-disagreement sector weights so that residual logical errors cancel in expectation. All results use an exact batched coset-probability evaluator for the code-capacity rotated surface code, validated against an independent library to ~10−15. No quantum hardware was used. Main results Paper element Our result Verdict Fig. 2, d = 3, 33 tie-invariant points maximum discrepancy 0.12% from digitized curves agrees (diagnostic) Fig. 2, d = 7, p = 0.05, 8 prespecified targets 7 of 8 match; wX = −0.4076 vs −0.42 partial Fig. 2e, d = 3 four-sector overhead 5.10–8.39 across tie rules; paper 5.76 convention-dependent Fig. 2e and Fig. 3c, p ≤ 0.01 rare sector forecast empty in 107 records (probability 0.94–0.999) forecast refusal; author convention required Fig. 3a noise learning, p = 0.005 median rate error 0.356% vs reported 0.33% consistent Fig. 3c residual bias, p = 0.022 budget scaling matches (exponent −0.47 vs −0.50); magnitude about 10× lower (3–5× lower under a post hoc population variant) outside band (conditional); remaining gap unexplained Extension: partition design distance-5 improvement failed distance-7 validation (median overhead ratio 1.13) closed, negative Findings beyond reproduction Support bound: the decoder-disagreement share obeys πdis ≤ 2pL, which explains why literal empirical calibration of the rare sectors is very likely undefined at the paper's lowest error rates. Unstated conventions: maximum-likelihood tie-breaking, empty-sector handling, and how the residual in Eq. S.270 is formed each change or may explain reported numbers. Section 2 of the report lists them with the specific questions for the authors. Sensitivity and trade-offs: the residual is highly sensitive to a coherent change in the rate inverse (14.5×). Calibrating on observed syndromes gives a 2–3× smaller learning-induced residual than population calibration (post hoc), but needs every sector populated. Cost of universality: for a single known observable, simpler corrections beat VEC; its advantage is correcting all observables at once. Method and transparency All confirmatory studies used protocols frozen before their outcomes were computed. Refusals, misses, a post hoc test that failed its frozen prediction, and errors corrected during the work are all reported. Files vec-report-v1.0.pdf — the report (31 pages). vec-replication-archive-v1.zip — credential-free source snapshots, frozen protocols, sufficient statistics and replay scripts. Large posterior tables are listed by SHA-256. SHA256SUMS.txt — checksum manifest for the archive contents. report-facts.json — full study-archive hashes, freeze records and environment details. The text is licensed CC-BY-4.0; the code in the archive is MIT-licensed.

•Oct 18, 2026•0 citations

Error Mitigation From a Single Unmodified Error-Corrected Circuit

Maor Shutman, Dorit Aharonov, Itai Arad +7 more

Recent work has shown that syndrome information obtained during error-corrected quantum computation can be utilized for logical error mitigation (LEM), yielding exponential reductions in runtime overhead compared to "external'' LEM methods, which do not make use of syndrome data. However, these syndrome-aware LEM methods (SALEM) generally require adaptive circuit operations based on real-time processing of syndromes. Here, we introduce syndrome-based offline logical error mitigation (SOLEM), a framework that utilizes syndrome data entirely in post-processing, without any modification to the given error-corrected circuit. In this sense, SOLEM is "built into'' error-corrected circuits, and is in fact simpler to implement than external LEM protocols. The basic idea of SOLEM is to use naturally occurring syndrome-conditioned logical error channels in place of deliberate circuit modifications. We develop unbiased and heuristic estimators within this framework, including offline logical versions of probabilistic error cancellation (PEC) and zero-noise extrapolation (ZNE), as well as a global-regression estimator. SOLEM's fully offline nature leads to three significant advantages. First, SOLEM can post-process syndromes with a more powerful decoder than the one used in real time. Second, multiple estimators can be constructed from the same measured data and optimized using empirical statistical errors and related performance metrics. Third, logical error characterization is needed only in post-processing, allowing characterization data to be collected during circuit execution and reducing sensitivity to hardware drift. Remarkably, SOLEM estimators can achieve these advantages while attaining a runtime overhead which is exponentially lower than that of external LEM and is comparable to that of corresponding SALEM estimators.

quant-pharXiv:2610.06792•Oct 6, 2026•1 citation

Error Mitigation of Fault-Tolerant Quantum Circuits with Soft Information

Zeyuan Zhou, Shaun Pexton, Aleksander Kubica +1 more

Quantum error mitigation (QEM) is typically viewed as a suite of practical techniques for today's noisy intermediate-scale quantum devices, with limited relevance once fault-tolerant quantum computers become available. In this work, we challenge this conventional wisdom by showing that QEM can continue to provide substantial benefits in the era of quantum error correction (QEC), and in an even more efficient manner than it does on current devices. We introduce a framework for logical-level QEM that leverages soft information naturally produced by QEC decoders, requiring no additional data, hardware modifications, or runtime overhead beyond what QEC protocols already provide. Within this framework, we develop and analyze three logical-level QEM techniques: post-selection and runtime abort policies, probabilistic error cancellation, and zero-noise extrapolation. Our techniques reduce logical error rates by more than 100x while discarding fewer than 0.1% of shots; they also provide in situ characterization of logical channels for QEM protocols. As a proof of principle, we benchmark our approach using a surface-code architecture and two state-of-the-art decoders based on tensor-network contraction and minimum-weight perfect matching. We evaluate logical-level QEM on random Clifford circuits and molecular simulation algorithms and find that, compared to previous approaches relying on QEC only or QEC combined with QEM, we can achieve up to 87.4% spacetime overhead savings. Our results demonstrate that logical-level QEM with QEC decoder soft information can reliably improve logical performance, underscoring the efficiency and usefulness of QEM techniques for fault-tolerant quantum computers.

quant-pharXiv:2512.09863•Dec 11, 2025•26 citations

Quantum advantages for syndrome-aware noisy logical observable estimation

Kento Tsubouchi, Hyukgun Kwon, Liang Jiang +1 more

Recent progress in fault-tolerant quantum computing suggests that leveraging error-syndrome information at the logical layer can substantially improve performance, including the estimation of logical observables from noisy states. In this work, based on quantum estimation theory, we develop an information-theoretic framework to quantify the utility of error syndromes for noisy logical observable estimation. We distinguish two operational regimes of such syndrome-aware protocols: classical protocols, in which the logical measurement basis is fixed and syndrome information is used only in classical post-processing, and quantum protocols, in which the logical quantum control can be tailored to depend on the observed error syndrome. For classical syndrome-aware protocols, we prove a universal limitation: on average, syndrome information can improve the effective logical error rate by at most a factor of two, implying at most a quadratic reduction in sampling overhead. In contrast, once syndrome-conditioned quantum control is permitted, we demonstrate that the effective logical error rate decays exponentially with the number of code blocks. These findings provide fundamental guidance for designing future fault-tolerant architectures that actively exploit syndrome records rather than discarding them after decoding.

quant-pharXiv:2603.05145•Mar 6, 2026•7 citations

Efficient learning of logical noise from syndrome data

Han Zheng, Chia-Tung Chu, Senrui Chen +4 more

Characterizing errors in quantum circuits is essential for device calibration, yet detecting rare error events requires a large number of samples. This challenge is particularly severe in calibrating fault-tolerant, error-corrected circuits, where logical error probabilities are suppressed to higher order relative to physical noise and are therefore difficult to calibrate through direct logical measurements. Recently, Wagner et al. [PRL 130, 200601 (2023)] showed that, for phenomenological Pauli noise models, the logical channel can instead be inferred from syndrome measurement data generated during error correction. Here, we extend this framework to realistic circuit-level noise models. From a unified code-theoretic perspective and spacetime code formalism, we derive necessary and sufficient conditions for learning the logical channel from syndrome data alone and explicitly characterize the learnable degrees of freedom of circuit-level Pauli faults. Using Fourier analysis and compressed sensing, we develop efficient estimators with provable guarantees on sample complexity and computational cost. We further present an end-to-end protocol and demonstrate its performance on several syndrome-extraction circuits, achieving orders-of-magnitude sample-complexity savings over direct logical benchmarking. Our results establish syndrome-based learning as a practical approach to characterizing the logical channel in fault-tolerant quantum devices.

quant-pharXiv:2601.22286•Feb 2, 2026•16 citations
Early fault-tolerant quantum algorithms are a key step in scalable quantum computing, but are ultimately constrained by residual, uncorrectable logical errors. Logical quantum error mitigation can eliminate this bias, however its standard requirements include prior noise characterization, more complex experiments, and substantial sampling overhead. Although no mitigation technique can simultaneously overcome all three constraints, we demonstrate that the first two---noise learning and need for modified circuits---can be completely bypassed for logical circuits by leveraging only syndrome records. Specifically, we introduce virtual error cancellation: a method that, unlike previous bias-free approaches, operates entirely in classical post-processing on universal quantum circuits. We develop and numerically test end-to-end protocols that reduce the sampling overhead beyond fundamental limitations of existing syndrome-aware mitigation techniques, including syndrome-based postselection. In particular, we propose a scheme that pairs the low-latency decoder used in the experiment with a high-complexity decoder run in post-processing. In numerical simulations of a distance-7 rotated surface code, we show that our full-stack dual-decoder algorithm exhibits an error that diminishes as the number of samples increases, capable of reaching more than three orders of magnitude of suppression compared to the decoded logical error rate in an experimentally achievable setting. These results establish syndrome records as a resource for correcting universal computational estimates after quantum execution.
The paper asks whether residual logical errors can be canceled using only syndrome records and measurement outcomes from an otherwise unmodified fault-tolerant computation. It introduces virtual error cancellation (VEC), which learns parameters of a prescribed detector error model from recorded syndromes and assigns signed classical weights to shots. Exact cancellation of a conditional logical Pauli channel requires E[w]=1\mathbb{E}[w]=1E[w]=1 and E[wpα]=0\mathbb{E}[wp_\alpha]=0E[wpα​]=0 for every nonidentity logical Pauli component.
A constrained variance minimization gives the optimal sampling overhead Csyn∗=1+pˉ⊤Σ−1pˉC^*_{\rm syn}=1+\bar{\mathbf p}^{\top}\Sigma^{-1}\bar{\mathbf p}Csyn∗​=1+pˉ​⊤Σ−1pˉ​, assuming invertible posterior covariance Σ\SigmaΣ. A coarse-grained implementation partitions shots by agreement or directional disagreement between a fast real-time decoder and a more accurate offline decoder. Under informative-disagreement assumptions, its overhead is 1+O(pL)1+O(p_L)1+O(pL​); favorable asymptotics approach 1+pL1+p_L1+pL​, versus benchmarks 1+2pL1+2p_L1+2pL​ for single-decoder syndrome-aware mitigation and 1+4pL1+4p_L1+4pL​ for standard logical PEC. The paper also describes layerwise composition and integration with non-Clifford teleportation gadgets.
Code-capacity depolarizing-noise simulations use rotated surface codes of distances 3,5,73,5,73,5,7, pairing MWPM with exact maximum-likelihood decoding. At distance 777, the syndrome-resolved overhead slope reaches approximately 1.31.31.3. With 10710^7107 learning shots at physical error rate 0.0050.0050.005, the modeled residual bias falls from 1.32×10−61.32\times10^{-6}1.32×10−6 to 7.95×10−107.95\times10^{-10}7.95×10−10; this excludes readout sampling noise.
Stated limitations include the Pauli-noise assumption, computationally expensive posterior evaluation and microscopic noise learning, and the absence of circuit-level numerical benchmarks. Residual coherent errors and undetectable magic-state output errors are not generally canceled.
Broad applications of quantum computers will require error correction (EC). However, hardware roadmaps indicate that physical qubit numbers will remain limited in the foreseeable future, leading to residual logical errors that constrain the size and accuracy of achievable computations. Recent work suggested logical error mitigation (LEM), which applies known error mitigation (EM) methods to logical errors, eliminating their effect at the cost of a runtime overhead. We introduce syndrome-aware logical error mitigation (SALEM), which mitigates logical errors conditioned on the error syndromes measured during error correction. The runtime overhead of SALEM is exponentially lower than that of LEM schemes which do not make use of syndrome data, enabling substantially larger circuit volumes that can be executed accurately. Compared to the routinely used combination of error correction and syndrome rejection (post-selection), SALEM increases the size of reliably executable computations by orders of magnitude. In the practical setting where space and time overheads are fixed and error reduction methods are compared by their resulting estimation errors, we observe a surprising phenomenon: SALEM, which tightly combines EC with EM, can outperform physical EM even above the standard fault-tolerance (pseudo) threshold. Thus, SALEM can make use of EC in regimes of physical error rates where EC is commonly deemed useless.
This report presents an independent, simulation-only reproduction of the logical virtual error cancellation (VEC) protocol of Shtanko, Roy, Kumar and Minev, "Measure Now, Mitigate Later: Virtual Error Cancellation for Logical Quantum Circuits" (arXiv:2610.12400). VEC reweights stored syndrome records by signed decoder-disagreement sector weights so that residual logical errors cancel in expectation. All results use an exact batched coset-probability evaluator for the code-capacity rotated surface code, validated against an independent library to ~10−15. No quantum hardware was used. Main results Paper element Our result Verdict Fig. 2, d = 3, 33 tie-invariant points maximum discrepancy 0.12% from digitized curves agrees (diagnostic) Fig. 2, d = 7, p = 0.05, 8 prespecified targets 7 of 8 match; wX = −0.4076 vs −0.42 partial Fig. 2e, d = 3 four-sector overhead 5.10–8.39 across tie rules; paper 5.76 convention-dependent Fig. 2e and Fig. 3c, p ≤ 0.01 rare sector forecast empty in 107 records (probability 0.94–0.999) forecast refusal; author convention required Fig. 3a noise learning, p = 0.005 median rate error 0.356% vs reported 0.33% consistent Fig. 3c residual bias, p = 0.022 budget scaling matches (exponent −0.47 vs −0.50); magnitude about 10× lower (3–5× lower under a post hoc population variant) outside band (conditional); remaining gap unexplained Extension: partition design distance-5 improvement failed distance-7 validation (median overhead ratio 1.13) closed, negative Findings beyond reproduction Support bound: the decoder-disagreement share obeys πdis ≤ 2pL, which explains why literal empirical calibration of the rare sectors is very likely undefined at the paper's lowest error rates. Unstated conventions: maximum-likelihood tie-breaking, empty-sector handling, and how the residual in Eq. S.270 is formed each change or may explain reported numbers. Section 2 of the report lists them with the specific questions for the authors. Sensitivity and trade-offs: the residual is highly sensitive to a coherent change in the rate inverse (14.5×). Calibrating on observed syndromes gives a 2–3× smaller learning-induced residual than population calibration (post hoc), but needs every sector populated. Cost of universality: for a single known observable, simpler corrections beat VEC; its advantage is correcting all observables at once. Method and transparency All confirmatory studies used protocols frozen before their outcomes were computed. Refusals, misses, a post hoc test that failed its frozen prediction, and errors corrected during the work are all reported. Files vec-report-v1.0.pdf — the report (31 pages). vec-replication-archive-v1.zip — credential-free source snapshots, frozen protocols, sufficient statistics and replay scripts. Large posterior tables are listed by SHA-256. SHA256SUMS.txt — checksum manifest for the archive contents. report-facts.json — full study-archive hashes, freeze records and environment details. The text is licensed CC-BY-4.0; the code in the archive is MIT-licensed.
Recent work has shown that syndrome information obtained during error-corrected quantum computation can be utilized for logical error mitigation (LEM), yielding exponential reductions in runtime overhead compared to "external'' LEM methods, which do not make use of syndrome data. However, these syndrome-aware LEM methods (SALEM) generally require adaptive circuit operations based on real-time processing of syndromes. Here, we introduce syndrome-based offline logical error mitigation (SOLEM), a framework that utilizes syndrome data entirely in post-processing, without any modification to the given error-corrected circuit. In this sense, SOLEM is "built into'' error-corrected circuits, and is in fact simpler to implement than external LEM protocols. The basic idea of SOLEM is to use naturally occurring syndrome-conditioned logical error channels in place of deliberate circuit modifications. We develop unbiased and heuristic estimators within this framework, including offline logical versions of probabilistic error cancellation (PEC) and zero-noise extrapolation (ZNE), as well as a global-regression estimator. SOLEM's fully offline nature leads to three significant advantages. First, SOLEM can post-process syndromes with a more powerful decoder than the one used in real time. Second, multiple estimators can be constructed from the same measured data and optimized using empirical statistical errors and related performance metrics. Third, logical error characterization is needed only in post-processing, allowing characterization data to be collected during circuit execution and reducing sensitivity to hardware drift. Remarkably, SOLEM estimators can achieve these advantages while attaining a runtime overhead which is exponentially lower than that of external LEM and is comparable to that of corresponding SALEM estimators.
Quantum error mitigation (QEM) is typically viewed as a suite of practical techniques for today's noisy intermediate-scale quantum devices, with limited relevance once fault-tolerant quantum computers become available. In this work, we challenge this conventional wisdom by showing that QEM can continue to provide substantial benefits in the era of quantum error correction (QEC), and in an even more efficient manner than it does on current devices. We introduce a framework for logical-level QEM that leverages soft information naturally produced by QEC decoders, requiring no additional data, hardware modifications, or runtime overhead beyond what QEC protocols already provide. Within this framework, we develop and analyze three logical-level QEM techniques: post-selection and runtime abort policies, probabilistic error cancellation, and zero-noise extrapolation. Our techniques reduce logical error rates by more than 100x while discarding fewer than 0.1% of shots; they also provide in situ characterization of logical channels for QEM protocols. As a proof of principle, we benchmark our approach using a surface-code architecture and two state-of-the-art decoders based on tensor-network contraction and minimum-weight perfect matching. We evaluate logical-level QEM on random Clifford circuits and molecular simulation algorithms and find that, compared to previous approaches relying on QEC only or QEC combined with QEM, we can achieve up to 87.4% spacetime overhead savings. Our results demonstrate that logical-level QEM with QEC decoder soft information can reliably improve logical performance, underscoring the efficiency and usefulness of QEM techniques for fault-tolerant quantum computers.
Recent progress in fault-tolerant quantum computing suggests that leveraging error-syndrome information at the logical layer can substantially improve performance, including the estimation of logical observables from noisy states. In this work, based on quantum estimation theory, we develop an information-theoretic framework to quantify the utility of error syndromes for noisy logical observable estimation. We distinguish two operational regimes of such syndrome-aware protocols: classical protocols, in which the logical measurement basis is fixed and syndrome information is used only in classical post-processing, and quantum protocols, in which the logical quantum control can be tailored to depend on the observed error syndrome. For classical syndrome-aware protocols, we prove a universal limitation: on average, syndrome information can improve the effective logical error rate by at most a factor of two, implying at most a quadratic reduction in sampling overhead. In contrast, once syndrome-conditioned quantum control is permitted, we demonstrate that the effective logical error rate decays exponentially with the number of code blocks. These findings provide fundamental guidance for designing future fault-tolerant architectures that actively exploit syndrome records rather than discarding them after decoding.
Characterizing errors in quantum circuits is essential for device calibration, yet detecting rare error events requires a large number of samples. This challenge is particularly severe in calibrating fault-tolerant, error-corrected circuits, where logical error probabilities are suppressed to higher order relative to physical noise and are therefore difficult to calibrate through direct logical measurements. Recently, Wagner et al. [PRL 130, 200601 (2023)] showed that, for phenomenological Pauli noise models, the logical channel can instead be inferred from syndrome measurement data generated during error correction. Here, we extend this framework to realistic circuit-level noise models. From a unified code-theoretic perspective and spacetime code formalism, we derive necessary and sufficient conditions for learning the logical channel from syndrome data alone and explicitly characterize the learnable degrees of freedom of circuit-level Pauli faults. Using Fourier analysis and compressed sensing, we develop efficient estimators with provable guarantees on sample complexity and computational cost. We further present an end-to-end protocol and demonstrate its performance on several syndrome-extraction circuits, achieving orders-of-magnitude sample-complexity savings over direct logical benchmarking. Our results establish syndrome-based learning as a practical approach to characterizing the logical channel in fault-tolerant quantum devices.