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

Mean-Matched Controls Fail to Preserve Logical Risk in Rotated Surface-Code Memories with Spatially Resolved Noise

Aditya Kumar Singh Pundir, Pallavi Singh, Ramji Gupta, Ramesh Kumar, Kamal Saini

Published Nov 11, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

Abstract Spatially concentrated noise is a central concern in modular quantum error correction, yet its effect is often estimated by replacing a heterogeneous device with a uniform effective error rate. We show that matching the expected number of physical faults does not preserve the logical failure probability in rotated surface-code memories. First, we reanalyse a published 2.6-million-shot proxy benchmark and identify six specific implementation issues that constrain its interpretation: an undocumented seam fraction of 0.5 instead of the configured 0.3, noise injection outside the repeated circuit body, an X error appended after measurement that cannot flip the recorded outcome, an unused p_ebit field, an algebraically generated decay curve presented as data, and a resource annotation not matching any circuit layout. Second, we perform 14.4 million additional sampled memory experiments across 72 conditions, covering code distances three to nine, both logical memory bases, spatially resolved seam noise, a channel-wise mean-matched control, and decoder mismatch. All numerical comparisons use recorded failure counts, with binomial confidence intervals and multiplicity-adjusted hypothesis tests. At code distance three, X-basis memory, and the largest tested noise severity, the geometric seam produces 977 failures while a channel-wise mean-matched homogeneous control produces 1430 failures in 200,000 shots, giving a risk ratio of 0.683 with a 95% confidence interval of 0.630 to 0.741 (Holm-adjusted p = 4.6 × 10⁻¹⁹). Only this d = 3 X-basis comparison is statistically decisive at the available shot count; the larger-distance observations are consistent with the same effect but are individually under-powered. Decoding the same geometric-noise samples with calibrated matching weights reduces failures from 2060 to 977 relative to baseline weights. Z-basis point estimates show the opposite geometry trend, although the selected largest-severity comparisons do not survive familywise adjustment. A simple repetition-code calculation explains why matching the mean physical error probability cannot generally preserve logical risk. The results establish a reproducible method for separating spatial exposure, temporal exposure, and decoder assumptions in seam-noise studies. They support geometry-aware modeling and calibrated decoding within the tested memory circuits; they do not implement a distributed gate, a Bell-pair channel, or classical feedforward, and they do not establish a distributed-gate threshold or hardware-level resource advantage.

DOI
10.21203/rs.3.rs-11279713/v1

Related papers

Representation Sensitivity in Rotated Surface-Code Decoding under Correlated Pauli Noise

Ba Thien Nguyen

Abstract We study decoder-representation sensitivity in simulated rotated surface-code Z-memory circuits with local spatially correlated XX pair events. At distance 3, ordinary minimum-weight perfect matching (MWPM) produced 4,610 versus 1,260 logical failures at p_corr = 10^-4 and 5,437 versus 2,239 at p_corr = 2 × 10^-4 on the same 500,000-shot samples using original-order versus canonical-sorted detector error models (DEMs). Across 50 additional seeded permutations per condition, failure counts varied widely. Canonical sorting tied for the minimum in this finite tested set; it is not claimed to be universally optimal. The ordering experiment reorders complete error instructions in a flattened DEM, preserving their probabilities and absolute detector and logical targets. PyMatching documents retaining the first-added logical-label set when parallel graph edges are merged; we therefore interpret the findings as a workflow-specific reproducibility result, not a newly discovered general software defect. At distances 5 and 7, correlation-aware MWPM had lower observed failure rates in all eight tested conditions, with six paired contrasts remaining significant after Bonferroni correction. An exact maximum-a-posteriori calculation gave a 0.2367% Bayes risk for the flattened-DEM distribution at p_corr = 10^-4; this is optimal for that modeled distribution only. This bounded classical simulation study proposes no new decoder, estimates no threshold, and provides no hardware evidence. Some historical source-to-result provenance remains incomplete, as disclosed in the manuscript. Code and evidence: https://github.com/tgiwn/QEC-surface-code-correlated-noise/tree/106d32e815c5f6009941afc36d3f65be7ecf35a3 Status: This is a preprint and has not undergone peer review.

•Oct 23, 2026•0 citations

Decoder Model Compatibility Provides Information beyond the Logical Gap under Drifting and Correlated Quantum Noise

Aaron C. Hoyt, Chunshu Wu, Shuwen Kan +8 more

Quantum error-correcting decoders provide both corrections and confidence estimates for the logical-error risk of individual measurement records. Such confidence can guide postselection, but it depends on the accuracy of the decoder noise model. When the physical device drifts away from that model, confidence measures such as the logical gap can become miscalibrated. We show that this mismatch can itself provide useful information. On IBM quantum hardware, syndrome statistics drift across consecutive acquisition windows, and the resulting detector histories differ substantially from those predicted by the stationary detector error model used for decoding. We observe a similar hardware-model mismatch in independent Google surface-code memory data. We exploit this effect by assigning additional rejection weight to detector histories that are unlikely under the assumed model. For minimum-weight perfect matching (MWPM), the minimum weight $W$ provides an inexpensive proxy for syndrome surprisal. On held-out IBM repetition-code memories, likelihood-aware postselection reduces the retained logical-error probability (LEP) by $10.6\%$ at $d=7$ and $28.8\%$ at $d=9$, both at $15\%$ rejection. On Google ten-round $d=5$ XZZX surface-code memory data, it reduces retained LEP by $75.4\%$ at $90\%$ rejection. Applied to Google's magic-state cultivation experiment with the Tesseract decoder, it reduces tomography infidelity by $34.7\%$ with $30\%$ additional grafting-stage rejection, or increases accepted yield by $30.4\%$ at a target fidelity of $97.0\%$. Burst-noise simulations show that the advantage persists as code distance and syndrome-extraction volume increase. The method reuses quantities already produced during logical-gap decoding and requires only an additional fitting step.

quant-pharXiv:2609.29018•Sep 25, 2026•0 citations

SAGE-QEC: Structure-Aware Gated Error Correction for Surface-Code Memories Under Structured Noise

Asia Alhammadi, Mohammed Al-Absi

Abstract Quantum error-correction decoders must convert noisy syndrome records into logical decisions while operating under strict latency and reliability constraints. Minimum-weight perfect matching (MWPM) remains a strong baseline for surface-code decoding because it is fast, interpretable, and exact for its graphlike optimization problem [1–8]. However, the graphlike independent-error approximation can become mismatched when syndrome records contain temporal drift, measurement corruption, crosstalk, bursts, or mixtures of mechanisms [9–18]. We introduce SAGE-QEC, a failure-aware selective decoder that retains nominal PyMatching as its default decision and learns when an observable syndrome structure warrants an alternative candidate. SAGE-QEC uses train-frozen structure thresholds, a candidate ranker, validation-only policy selection, and a paired blind evaluation. Across 45 simulator conditions, SAGE-QEC reduced the aggregate logical error rate from 27.1285% for PyMatching to 24.8320%, corresponding to an 8.47% relative reduction. The campaign used rotated surface-code memory circuits at distances 3, 5, and 7, nominal circuit parameters 0.002, 0.003, and 0.005, five seeds, and four test regimes withheld from training: Burst-3, Temporal Drift, Crosstalk, and Mixed Noise. The test set contained 81,000 paired shots. All twelve distance-by-regime aggregate comparisons favored SAGE-QEC in the executed campaign, with paired bootstrap intervals below zero for SAGE-QEC minus PyMatching. The result is evidence of a reproducible simulator-level improvement, not a claim of universal decoder superiority. SAGE-QEC currently uses logical-output proxy candidates rather than a complete physical correction search, and its intervention rate remains high under distribution shift. It has not yet been compared with a fully calibrated correlated-noise space-time PyMatching baseline or hardware calibration data. We therefore characterize SAGE-QEC as a strong qualification-stage prototype and release a complete audit protocol for the next industrial validation stage.

•Sep 9, 2026•0 citations

Learning to Correct Quantum Errors

Mayank Goswami, Shreeyam Bangera

Abstract Fault-tolerant quantum computers must continually decode noisy parity-check data, known as the syndrome, to determine whether an encoded logical qubit has been corrupted. The standard decoder, minimum-weight perfect matching (MWPM), assumes independent, graph-like errors and is sub-optimal under realistic circuit-level noise. We present a compact residual 3D convolutional neural network (0.5–0.6 million parameters) that reads the space-time syndrome of a rotated surface code as a volumetric image. Trained on Stim simulations at code distances d = 3 and d = 5 and evaluated on 3.6 million held-out shots, a three-seed ensemble outperforms correlated MWPM, the strongest baseline we test, at all 18 noise settings, with 6–46% fewer logical errors (paired McNemar p-value below 0.03 in every setting). On real Google Sycamore data (d = 3, five rounds), the network is pre-trained on the device's fitted error model and fine-tuned on half of the shots. It achieves a logical error rate of 13.03%, compared with 13.57% for correlated MWPM on the same held-out shots, and outperforms it on all eight cross-validation folds, although it does not match belief-matching or tensor-network decoders. Its outputs are well calibrated (ROC AUC = 0.998): discarding the 10% least-confident shots reduces errors tenfold. An ablation study identifies space-time locality as the essential inductive bias. All models train in 49 minutes on two freely available GPUs, and the data and code are publicly available.

•Nov 9, 2026•0 citations

Demonstration of Logical Error Suppression in a Surface Code Memory on a Cloud-Accessible IBM Superconducting Processor

Shuwen Kan, Aaron Hoyt, Sean Garner +8 more

Quantum error correction can suppress logical errors exponentially with code distance when physical noise is below threshold. Realizing this on hardware requires tight coordination among quantum gates, mid-circuit measurements, and qubit coherence. Device variation, noise asymmetry, and correlations across space and time complicate the translation of these capabilities into logical error suppression. Here, we study rotated surface-code memory on an IBM Nighthawk r2 processor. Performance varies across tested processor placements, which we attribute to differences in qubit quality. We optimize the code by combining short readout, fused measurement and reset, and an XX echo on data qubits during ancilla readout. Compared with standard readout without reset or echo, the optimized syndrome extraction circuit reduces the median per-round logical error rate by factors of 3.8 in the X basis and 1.4 in the Z basis. In memory experiments of up to 150 rounds, the distance advantage weakens, alongside long-lived correlations that may reflect a persistent error component. Under our optimization recipe, increasing the protected distance from 3 to 6 while holding the other distance fixed reduces the per-round logical error rate from 0.53% to 0.24% in Z memory and from 0.52% to 0.22% in X memory. The corresponding error-suppression factors under maximum-likelihood decoding are 1.68 and 1.85. These results connect circuit compilation and optimization to surface-code memory performance and limitations, and motivate QPU and QEC circuit codesign for fault-tolerant quantum computing primitives on current cloud hardware.

quant-pharXiv:2610.23840•Oct 19, 2026•2 citations

Modular Neural Decoder for Surface Code Memory and Logic on Superconducting Processors

Moritz Lange, Ole Fjeldså, Gustaf Jonasson Johansson +1 more

Neural decoders for quantum error correction have achieved high accuracy on surface code memory experiments, but practical fault-tolerant computation requires decoders that transfer across devices, noise conditions, and logical operations. We introduce a modular graph-recurrent decoder designed for this setting. Built from reusable local syndrome encoders, it is pretrained in simulation and fine-tuned to hardware using a common pipeline, with only lightweight spatial aggregation adapted between experiments. The decoder performs competitively on conventional memory benchmarks, outperforming minimum-weight perfect matching (MWPM) at distances 3 and 5 on an IBM Nighthawk-generation processor and closely approaching AlphaQubit on Google's below-threshold hardware data. We then test the framework in two settings beyond memory decoding on the same IBM device. First, in an $X$-type stability experiment, we continuously tune the effective measurement error rate using a variable pre-readout rotation and train a single decoder jointly across the resulting noise range. It matches or outperforms MWPM across the sweep without requiring a separately calibrated decoder for each setting. Second, we decode a $ZZ$-merge lattice-surgery experiment between two distance-3 surface-code patches, improving the decoded correlation between the merge outcome and the final $ZZ$ parity relative to MWPM on real hardware. Together, these experiments demonstrate neural decoding that is portable not only across hardware, but also across qualitatively different surface code observables and logical operations, using models trainable on single-GPU academic resources.

quant-pharXiv:2610.03869•Oct 6, 2026•2 citations
Abstract Spatially concentrated noise is a central concern in modular quantum error correction, yet its effect is often estimated by replacing a heterogeneous device with a uniform effective error rate. We show that matching the expected number of physical faults does not preserve the logical failure probability in rotated surface-code memories. First, we reanalyse a published 2.6-million-shot proxy benchmark and identify six specific implementation issues that constrain its interpretation: an undocumented seam fraction of 0.5 instead of the configured 0.3, noise injection outside the repeated circuit body, an X error appended after measurement that cannot flip the recorded outcome, an unused p_ebit field, an algebraically generated decay curve presented as data, and a resource annotation not matching any circuit layout. Second, we perform 14.4 million additional sampled memory experiments across 72 conditions, covering code distances three to nine, both logical memory bases, spatially resolved seam noise, a channel-wise mean-matched control, and decoder mismatch. All numerical comparisons use recorded failure counts, with binomial confidence intervals and multiplicity-adjusted hypothesis tests. At code distance three, X-basis memory, and the largest tested noise severity, the geometric seam produces 977 failures while a channel-wise mean-matched homogeneous control produces 1430 failures in 200,000 shots, giving a risk ratio of 0.683 with a 95% confidence interval of 0.630 to 0.741 (Holm-adjusted p = 4.6 × 10⁻¹⁹). Only this d = 3 X-basis comparison is statistically decisive at the available shot count; the larger-distance observations are consistent with the same effect but are individually under-powered. Decoding the same geometric-noise samples with calibrated matching weights reduces failures from 2060 to 977 relative to baseline weights. Z-basis point estimates show the opposite geometry trend, although the selected largest-severity comparisons do not survive familywise adjustment. A simple repetition-code calculation explains why matching the mean physical error probability cannot generally preserve logical risk. The results establish a reproducible method for separating spatial exposure, temporal exposure, and decoder assumptions in seam-noise studies. They support geometry-aware modeling and calibrated decoding within the tested memory circuits; they do not implement a distributed gate, a Bell-pair channel, or classical feedforward, and they do not establish a distributed-gate threshold or hardware-level resource advantage.
Abstract We study decoder-representation sensitivity in simulated rotated surface-code Z-memory circuits with local spatially correlated XX pair events. At distance 3, ordinary minimum-weight perfect matching (MWPM) produced 4,610 versus 1,260 logical failures at p_corr = 10^-4 and 5,437 versus 2,239 at p_corr = 2 × 10^-4 on the same 500,000-shot samples using original-order versus canonical-sorted detector error models (DEMs). Across 50 additional seeded permutations per condition, failure counts varied widely. Canonical sorting tied for the minimum in this finite tested set; it is not claimed to be universally optimal. The ordering experiment reorders complete error instructions in a flattened DEM, preserving their probabilities and absolute detector and logical targets. PyMatching documents retaining the first-added logical-label set when parallel graph edges are merged; we therefore interpret the findings as a workflow-specific reproducibility result, not a newly discovered general software defect. At distances 5 and 7, correlation-aware MWPM had lower observed failure rates in all eight tested conditions, with six paired contrasts remaining significant after Bonferroni correction. An exact maximum-a-posteriori calculation gave a 0.2367% Bayes risk for the flattened-DEM distribution at p_corr = 10^-4; this is optimal for that modeled distribution only. This bounded classical simulation study proposes no new decoder, estimates no threshold, and provides no hardware evidence. Some historical source-to-result provenance remains incomplete, as disclosed in the manuscript. Code and evidence: https://github.com/tgiwn/QEC-surface-code-correlated-noise/tree/106d32e815c5f6009941afc36d3f65be7ecf35a3 Status: This is a preprint and has not undergone peer review.
Quantum error-correcting decoders provide both corrections and confidence estimates for the logical-error risk of individual measurement records. Such confidence can guide postselection, but it depends on the accuracy of the decoder noise model. When the physical device drifts away from that model, confidence measures such as the logical gap can become miscalibrated. We show that this mismatch can itself provide useful information. On IBM quantum hardware, syndrome statistics drift across consecutive acquisition windows, and the resulting detector histories differ substantially from those predicted by the stationary detector error model used for decoding. We observe a similar hardware-model mismatch in independent Google surface-code memory data. We exploit this effect by assigning additional rejection weight to detector histories that are unlikely under the assumed model. For minimum-weight perfect matching (MWPM), the minimum weight WWW provides an inexpensive proxy for syndrome surprisal. On held-out IBM repetition-code memories, likelihood-aware postselection reduces the retained logical-error probability (LEP) by 10.6%10.6\%10.6% at d=7d=7d=7 and 28.8%28.8\%28.8% at d=9d=9d=9, both at 15%15\%15% rejection. On Google ten-round d=5d=5d=5 XZZX surface-code memory data, it reduces retained LEP by 75.4%75.4\%75.4% at 90%90\%90% rejection. Applied to Google's magic-state cultivation experiment with the Tesseract decoder, it reduces tomography infidelity by 34.7%34.7\%34.7% with 30%30\%30% additional grafting-stage rejection, or increases accepted yield by 30.4%30.4\%30.4% at a target fidelity of 97.0%97.0\%97.0%. Burst-noise simulations show that the advantage persists as code distance and syndrome-extraction volume increase. The method reuses quantities already produced during logical-gap decoding and requires only an additional fitting step.
Abstract Quantum error-correction decoders must convert noisy syndrome records into logical decisions while operating under strict latency and reliability constraints. Minimum-weight perfect matching (MWPM) remains a strong baseline for surface-code decoding because it is fast, interpretable, and exact for its graphlike optimization problem [1–8]. However, the graphlike independent-error approximation can become mismatched when syndrome records contain temporal drift, measurement corruption, crosstalk, bursts, or mixtures of mechanisms [9–18]. We introduce SAGE-QEC, a failure-aware selective decoder that retains nominal PyMatching as its default decision and learns when an observable syndrome structure warrants an alternative candidate. SAGE-QEC uses train-frozen structure thresholds, a candidate ranker, validation-only policy selection, and a paired blind evaluation. Across 45 simulator conditions, SAGE-QEC reduced the aggregate logical error rate from 27.1285% for PyMatching to 24.8320%, corresponding to an 8.47% relative reduction. The campaign used rotated surface-code memory circuits at distances 3, 5, and 7, nominal circuit parameters 0.002, 0.003, and 0.005, five seeds, and four test regimes withheld from training: Burst-3, Temporal Drift, Crosstalk, and Mixed Noise. The test set contained 81,000 paired shots. All twelve distance-by-regime aggregate comparisons favored SAGE-QEC in the executed campaign, with paired bootstrap intervals below zero for SAGE-QEC minus PyMatching. The result is evidence of a reproducible simulator-level improvement, not a claim of universal decoder superiority. SAGE-QEC currently uses logical-output proxy candidates rather than a complete physical correction search, and its intervention rate remains high under distribution shift. It has not yet been compared with a fully calibrated correlated-noise space-time PyMatching baseline or hardware calibration data. We therefore characterize SAGE-QEC as a strong qualification-stage prototype and release a complete audit protocol for the next industrial validation stage.
Abstract Fault-tolerant quantum computers must continually decode noisy parity-check data, known as the syndrome, to determine whether an encoded logical qubit has been corrupted. The standard decoder, minimum-weight perfect matching (MWPM), assumes independent, graph-like errors and is sub-optimal under realistic circuit-level noise. We present a compact residual 3D convolutional neural network (0.5–0.6 million parameters) that reads the space-time syndrome of a rotated surface code as a volumetric image. Trained on Stim simulations at code distances d = 3 and d = 5 and evaluated on 3.6 million held-out shots, a three-seed ensemble outperforms correlated MWPM, the strongest baseline we test, at all 18 noise settings, with 6–46% fewer logical errors (paired McNemar p-value below 0.03 in every setting). On real Google Sycamore data (d = 3, five rounds), the network is pre-trained on the device's fitted error model and fine-tuned on half of the shots. It achieves a logical error rate of 13.03%, compared with 13.57% for correlated MWPM on the same held-out shots, and outperforms it on all eight cross-validation folds, although it does not match belief-matching or tensor-network decoders. Its outputs are well calibrated (ROC AUC = 0.998): discarding the 10% least-confident shots reduces errors tenfold. An ablation study identifies space-time locality as the essential inductive bias. All models train in 49 minutes on two freely available GPUs, and the data and code are publicly available.
Quantum error correction can suppress logical errors exponentially with code distance when physical noise is below threshold. Realizing this on hardware requires tight coordination among quantum gates, mid-circuit measurements, and qubit coherence. Device variation, noise asymmetry, and correlations across space and time complicate the translation of these capabilities into logical error suppression. Here, we study rotated surface-code memory on an IBM Nighthawk r2 processor. Performance varies across tested processor placements, which we attribute to differences in qubit quality. We optimize the code by combining short readout, fused measurement and reset, and an XX echo on data qubits during ancilla readout. Compared with standard readout without reset or echo, the optimized syndrome extraction circuit reduces the median per-round logical error rate by factors of 3.8 in the X basis and 1.4 in the Z basis. In memory experiments of up to 150 rounds, the distance advantage weakens, alongside long-lived correlations that may reflect a persistent error component. Under our optimization recipe, increasing the protected distance from 3 to 6 while holding the other distance fixed reduces the per-round logical error rate from 0.53% to 0.24% in Z memory and from 0.52% to 0.22% in X memory. The corresponding error-suppression factors under maximum-likelihood decoding are 1.68 and 1.85. These results connect circuit compilation and optimization to surface-code memory performance and limitations, and motivate QPU and QEC circuit codesign for fault-tolerant quantum computing primitives on current cloud hardware.
Neural decoders for quantum error correction have achieved high accuracy on surface code memory experiments, but practical fault-tolerant computation requires decoders that transfer across devices, noise conditions, and logical operations. We introduce a modular graph-recurrent decoder designed for this setting. Built from reusable local syndrome encoders, it is pretrained in simulation and fine-tuned to hardware using a common pipeline, with only lightweight spatial aggregation adapted between experiments. The decoder performs competitively on conventional memory benchmarks, outperforming minimum-weight perfect matching (MWPM) at distances 3 and 5 on an IBM Nighthawk-generation processor and closely approaching AlphaQubit on Google's below-threshold hardware data. We then test the framework in two settings beyond memory decoding on the same IBM device. First, in an XXX-type stability experiment, we continuously tune the effective measurement error rate using a variable pre-readout rotation and train a single decoder jointly across the resulting noise range. It matches or outperforms MWPM across the sweep without requiring a separately calibrated decoder for each setting. Second, we decode a ZZZZZZ-merge lattice-surgery experiment between two distance-3 surface-code patches, improving the decoded correlation between the merge outcome and the final ZZZZZZ parity relative to MWPM on real hardware. Together, these experiments demonstrate neural decoding that is portable not only across hardware, but also across qualitatively different surface code observables and logical operations, using models trainable on single-GPU academic resources.