QAdapt: Noise-Adaptive Neural Pre-Decoding for Surface-Code Quantum Error Correction

arXiv:2607.28422 · cs.LG, quant-ph · Submitted 2026-07-30 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.

Tom: I'm Tom.

Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.

Tom: We're looking at the paper: "QAdapt: Noise-Adaptive Neural Pre-Decoding for Surface-Code Quantum Error Correction".

Jane: Here's the gist of the paper. Fault-tolerant quantum computing relies on quantum error correction to suppress physical errors and preserve logical information at scale QAdapt captures local spatiotemporal correlations in syndrome data, sequentially adapts to evolving noise conditions while mitigating catastrophic forgetting, and forwards the residual syndrome to a conventional global decoder.

Tom: The Problem Addressed The challenge in fault-tolerant quantum computing is that performance is constrained not only by physical noise but also by the latency of classical decoders processing rapidly generated syndrome data This challenge is exacerbated by hardware noise that is strong, heterogeneous, and nonstationary, as well as by the simulation-to-hardware distribution shift that can substantially degrade fixed neural decoders Conventional global decoders must solve a global match problem over all active detector events, causing the backend decoding workload to grow with syndrome density QAdapt Framework and Adaptation QAdapt is a noise-adaptive neural pre-decoding framework for surface-code quantum error correction It captures local spatiotemporal correlations in syndrome data and sequentially adapts to evolving noise conditions while mitigating catastrophic forgetting The framework operates in an offline stage where HTNet learns local correction logits, and an online stage where PyMatching performs the final global decode QAdapt uses Elastic Weight Consolidation (EWC) to protect parameters important to earlier tasks during sequential learning Feature Extraction and Fusion The method employs a three-stage process for feature extraction, separating spatial, temporal, and joint correlations before learning how strongly each branch should contribute for each sample and feature channel The input detector tensor is processed through a 3-D convolutional stem to produce C = 112 channels Adaptive branch fusion computes per-sample, per-channel weights using a two-layer pointwise network to determine the contribution of the spatial, temporal, and joint branches Performance Evaluation and Results Across 110 synthetic out-of-distribution noise configurations for rotated surface-code memory circuits, QAdapt consistently reduces the logical error rate relative to the neural pre-decoding baseline On Google’s Willow benchmark data, without target-domain fine-tuning, it achieves reductions of up to 5.79% in logical error rate and 9.32% in backend decoding latency on the residual syndrome QAdapt wins in all retained configurations of both the full synthetic grid and the hardware-anchored highload subset QAdapt serves as an adaptive interface between a changing quantum-hardware layer and a stable classical decoding backend The results demonstrate that adaptive pre-decoding can simultaneously improve logical accuracy and reduce backend decoding latency under evolving hardware noise More broadly, QAdapt illustrates how adaptive classical processing can complement advances in qubit quality, control, and code design to support reliable FTQC systems Future work should move toward fully online adaptation driven by real-time noise estimation and drift detection The paper concludes that QAdapt can be integrated into existing QEC pipelines while retaining the global consistency of conventional decoding Page 1 --- QAdapt captures local spatiotemporal correlations in syndrome data, sequentially adapts to evolving noise conditions while mitigating catastrophic forgetting, and forwards the residual syndrome to a conventional global decoder Page 2 --- Decoders in an FTQC system must balance logical accuracy with throughput and response latency Neural pre-decoding offers a modular alternative QAdapt learns local spatiotemporal correlations in syndrome data and is sequentially adapted across physically meaningful noise regimes, with regularization designed to preserve knowledge acquired under previously encountered conditions Page 3 --- Repeated stabilizer measurements convert physical faults into detector events The input syndrome density as defined in Equation (1) directly measures the event load presented to a decoder at fixed code distance, logical basis, and number of rounds This workload comparison imposes three requirements for the design Page 4 --- QAdapt has an offline and an online stage (Figure 2) The offline stage generates a task sequence comprising base noise (T0), enhanced measurement noise (T1), enhanced CNOT noise (T2), enhanced idle noise (T3), and enhanced Z bias (T4) HTNet learns local correction logits, while Q-EWC regularizes sequential updates Page 5 --- The input syndrome density as defined in Equation (1) directly measures the event load presented to a decoder at fixed code distance, logical basis, and number of rounds The device-mapped high-noise training environment, denoted T0, is a 25-parameter circuit-level Pauli model derived from hardware preparation, measurement, idle, and CNOT error parameters Page 6 --- Under the fixed T0 noise environment, HTNet improves LER at both evaluated medium-to-large code distances (Table 2 and Figure 4) QAdapt achieves lower LER than Ising-fast in all 110 retained OOD configurations Page 7 --- The timing boundary is important A neural pre-decoder does not replace global decoding; it changes the instance that the global decoder must solve Lower mean LER occurs together with lower residual-syndrome PyMatching latency Page 8 --- QAdapt wins in all retained configurations of both the full synthetic grid and the hardware-anchored highload subset The zero-shot results on Google’s Willow benchmark data further demonstrate that these benefits can extend beyond the simulated noise distributions used for training Page 9 --- The aggregate advantage is not confined to low-density perturbations The Willow experiment tests a different direction of shift: an external hardware dataset whose matched detector load is lower than T0 Page 10 --- Density does not identify the underlying correlation structure, so matching density across environments does not establish distributional equivalence A complete follow-up should evaluate paired shots from the anonymized platform, report binomial confidence intervals and seed variation, compare EWC with replay and joint mixed-noise training, ablate each HTNet component, and time the deployed pipeline end to end Page 11 --- The third-party Willow data analysed in this study are available through the data release associated with Google Quantum AI and Collaborators

11: Data required for editorial assessment and peer review will be supplied confidentially to editors and reviewers upon request Page 2607.28422 --- The third-party Willow data analysed in this study are available through the data release associated with Google Quantum AI and Collaborators

11: Data required for editorial assessment and peer review will be supplied confidentially to editors and reviewers upon request Page 5 --- The device-mapped high-noise training environment, denoted T0, is a 25-parameter circuit-level Pauli model derived from hardware preparation, measurement, idle, and CNOT error parameters Page 10 --- Density does not identify the underlying correlation structure, so matching density across environments does not establish distributional equivalence Page 11 --- Data required for editorial assessment and peer review will be supplied confidentially to editors and reviewers upon request Page 2607.28422 --- The third-party Willow data analysed in this study are available through the data release associated with Google Quantum AI and Collaborators

11: Data required for editorial assessment and peer review will be supplied confidentially to editors and reviewers upon request Page 5 --- The device-mapped high-noise training environment, denoted T0, is a 25-parameter circuit-level Pauli model derived from hardware preparation, measurement, idle, and CNOT error parameters Page 2607.

Paper summary: Jane: We've gone over the mechanics of QAdapt, starting from how it captures local correlations in syndrome data and how it sequentially adapts while using Elastic Weight Consolidation to protect old knowledge. So what’s the bigger picture here?

Tom: The main message seems to be that you can use a neural pre-decoder as a modular alternative to a fixed global decoder, and this hybrid approach lowers the workload on the backend decoder while still keeping the global consistency of conventional decoding.

Lu: What they show is that adaptive pre-decoding can simultaneously improve logical accuracy and reduce backend decoding latency when dealing with evolving hardware noise.

Meng: For someone trying to deploy this in production, it means you get better performance metrics without having to completely overhaul your existing global decoder infrastructure right away, just by adding this learning layer on top.

Jane: It suggests that adaptive classical processing can be a tool that complements advances in qubit quality and control rather than being the sole solution for all hardware noise issues.

Tom: The paper concludes that QAdapt can be integrated into existing quantum error correction pipelines while still retaining the global consistency of conventional decoding, which is what makes it practical for now.

Lu: The future work they point to is moving toward fully online adaptation driven by real-time noise estimation and drift detection, which would make this even more dynamic.

Jane: So in short, QAdapt provides a way to make the classical side of quantum error correction smarter and more responsive to the physical environment than just using a static decoder.

Conclusion: Tom: So we've looked at how QAdapt works, from how it learns local patterns to how it feeds information to a global decoder.

Jane: Right, so what does this whole thing actually mean for fault-tolerant quantum computing?

Tom: It means they've built a way for the classical side of error correction to get smarter about the noisy hardware it's dealing with.

Lu: They showed that QAdapt captures those local spatiotemporal correlations in the syndrome data and adapts sequentially to changing noise conditions without forgetting what it learned before.

Meng: That sequential adaptation is key, because real quantum hardware doesn't just have one type of noise; it’s constantly shifting.

Jane: So, the authors are essentially creating a bridge between that messy physical world and the stable classical computer that does the final decoding.

Tom: Exactly. They use this neural pre-decoder to filter out most of the bad stuff before it even gets to the main decoder, which is what saves time and boosts accuracy.

Lu: The results on Google's Willow benchmark show that QAdapt consistently lowered logical error rates compared to their baseline, and they also cut down the backend decoding latency by up to nine point three percent.

Jane: That sounds pretty significant because latency is a big problem when you're running things in real-time, especially as you scale up these quantum systems.

Tom: It's not just about accuracy either; they showed this works without needing any special fine-tuning on the hardware data, just out of the box.

Meng: I gotta ask, how does it handle those distribution shifts when you move from one noise environment to another?

Lu: The paper points out that density alone doesn't tell you about the actual correlation structure between environments, so they suggest more work on matching across different noise types.

Jane: It sounds like the next big hurdle is making this adaptation fully automatic, responding to real-time changes instead of just following a pre-set schedule of noise levels.

Beijing Zhongke Qhub Technology Company Limited · Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University · Institute of Computing Technology, Chinese Academy of Sciences

cs.LG, quant-ph

Submitted: 2026-07-30

Updated: 2026-11-18

Comments: 16 pages, 11 figures, 4 tables, including appendices. Revised and expanded version

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 99/100

The gist: Fault-tolerant quantum computing relies on quantum error correction to suppress physical errors and preserve logical information at scale QAdapt captures local spatiotemporal correlations in syndrome…

Key concepts

Syndrome Data
These are the outputs from repeated stabilizer measurements in quantum error correction. They directly measure physical faults occurring in the qubits, providing a stream of data that needs to be decoded to determine the actual errors.
QAdapt Framework
This is a neural pre-decoding system with two stages: an offline stage where a neural network learns local correction suggestions, and an online stage where it adapts sequentially. It uses Elastic Weight Consolidation (EWC) to ensure the network remembers important knowledge from previous noise conditions.
Catastrophic Forgetting Mitigation
This technique is used within QAdapt's sequential learning process. It prevents the neural network from forgetting important error correction patterns learned under earlier, different noise conditions when it adapts to new, evolving noise regimes encountered during operation.

Terminology

Summary

Fault-tolerant quantum computing relies on quantum error correction to suppress physical errors and preserve logical information at scale QAdapt captures local spatiotemporal correlations in syndrome data, sequentially adapts to evolving noise conditions while mitigating catastrophic forgetting, and forwards the residual syndrome to a conventional global decoder. p. 0

The Problem Addressed

The challenge in fault-tolerant quantum computing is that performance is constrained not only by physical noise but also by the latency of classical decoders processing rapidly generated syndrome data This challenge is exacerbated by hardware noise that is strong, heterogeneous, and nonstationary, as well as by the simulation-to-hardware distribution shift that can substantially degrade fixed neural decoders Conventional global decoders must solve a global match problem over all active detector events, causing the backend decoding workload to grow with syndrome density

QAdapt Framework and Adaptation

QAdapt is a noise-adaptive neural pre-decoding framework for surface-code quantum error correction It captures local spatiotemporal correlations in syndrome data and sequentially adapts to evolving noise conditions while mitigating catastrophic forgetting The framework operates in an offline stage where HTNet learns local correction logits, and an online stage where PyMatching performs the final global decode QAdapt uses Elastic Weight Consolidation (EWC) to protect parameters important to earlier tasks during sequential learning

Feature Extraction and Fusion

The method employs a three-stage process for feature extraction, separating spatial, temporal, and joint correlations before learning how strongly each branch should contribute for each sample and feature channel The input detector tensor is processed through a 3-D convolutional stem to produce C = 112 channels Adaptive branch fusion computes per-sample, per-channel weights using a two-layer pointwise network to determine the contribution of the spatial, temporal, and joint branches

Performance Evaluation and Results

Across 110 synthetic out-of-distribution noise configurations for rotated surface-code memory circuits, QAdapt consistently reduces the logical error rate relative to the neural pre-decoding baseline On Google’s Willow benchmark data, without target-domain fine-tuning, it achieves reductions of up to 5.79% in logical error rate and 9. p. 032% in backend decoding latency on the residual syndrome QAdapt wins in all retained configurations of both the full synthetic grid and the hardware-anchored highload subset

Conclusion and Broader Impact

QAdapt serves as an adaptive interface between a changing quantum-hardware layer and a stable classical decoding backend The results demonstrate that adaptive pre-decoding can simultaneously improve logical accuracy and reduce backend decoding latency under evolving hardware noise More broadly, QAdapt illustrates how adaptive classical processing can complement advances in qubit quality, control, and code design to support reliable FTQC systems Future work should move toward fully online adaptation driven by real-time noise estimation and drift detection The paper concludes that QAdapt can be integrated into existing QEC pipelines while retaining the global consistency of conventional decoding

--- Page 1 ---

QAdapt captures local spatiotemporal correlations in syndrome data, sequentially adapts to evolving noise conditions while mitigating catastrophic forgetting, and forwards the residual syndrome to a conventional global decoder

--- Page 2 ---

Decoders in an FTQC system must balance logical accuracy with throughput and response latency Neural pre-decoding offers a modular alternative QAdapt learns local spatiotemporal correlations in syndrome data and is sequentially adapted across physically meaningful noise regimes, with regularization designed to preserve knowledge acquired under previously encountered conditions

--- Page 3 ---

Repeated stabilizer measurements convert physical faults into detector events The input syndrome density as defined in Equation (1) directly measures the event load presented to a decoder at fixed code distance, logical basis, and number of rounds This workload comparison imposes three requirements for the design

--- Page 4 ---

QAdapt has an offline and an online stage (Figure 2) The offline stage generates a task sequence comprising base noise (T0), enhanced measurement noise (T1), enhanced CNOT noise (T2), enhanced idle noise (T3), and enhanced Z bias (T4) HTNet learns local correction logits, while Q-EWC regularizes sequential updates

--- Page 5 ---

The input syndrome density as defined in Equation (1) directly measures the event load presented to a decoder at fixed code distance, logical basis, and number of rounds The device-mapped high-noise training environment, denoted T0, is a 25-parameter circuit-level Pauli model derived from hardware preparation, measurement, idle, and CNOT error parameters

--- Page 6 ---

Under the fixed T0 noise environment, HTNet improves LER at both evaluated medium-to-large code distances (Table 2 and Figure 4) QAdapt achieves lower LER than Ising-fast in all 110 retained OOD configurations

--- Page 7 ---

The timing boundary is important A neural pre-decoder does not replace global decoding; it changes the instance that the global decoder must solve Lower mean LER occurs together with lower residual-syndrome PyMatching latency

--- Page 8 ---

QAdapt wins in all retained configurations of both the full synthetic grid and the hardware-anchored highload subset The zero-shot results on Google’s Willow benchmark data further demonstrate that these benefits can extend beyond the simulated noise distributions used for training

--- Page 9 ---

The aggregate advantage is not confined to low-density perturbations The Willow experiment tests a different direction of shift: an external hardware dataset whose matched detector load is lower than T0

--- Page 10 ---

Density does not identify the underlying correlation structure, so matching density across environments does not establish distributional equivalence A complete follow-up should evaluate paired shots from the anonymized platform, report binomial confidence intervals and seed variation, compare EWC with replay and joint mixed-noise training, ablate each HTNet component, and time the deployed pipeline end to end

--- Page 11 ---

The third-party Willow data analysed in this study are available through the data release associated with Google Quantum AI and Collaborators [11] Data required for editorial assessment and peer review will be supplied confidentially to editors and reviewers upon request

--- Page 2607.28422 ---

The third-party Willow data analysed in this study are available through the data release associated with Google Quantum AI and Collaborators [11] Data required for editorial assessment and peer review will be supplied confidentially to editors and reviewers upon request

--- Page 5 ---

The device-mapped high-noise training environment, denoted T0, is a 25-parameter circuit-level Pauli model derived from hardware preparation, measurement, idle, and CNOT error parameters

--- Page 10 ---

Density does not identify the underlying correlation structure, so matching density across environments does not establish distributional equivalence

--- Page 11 ---

Data required for editorial assessment and peer review will be supplied confidentially to editors and reviewers upon request

--- Page 2607.28422 ---

The third-party Willow data analysed in this study are available through the data release associated with Google Quantum AI and Collaborators [11] Data required for editorial assessment and peer review will be supplied confidentially to editors and reviewers upon request

--- Page 5 ---

The device-mapped high-noise training environment, denoted T0, is a 25-parameter circuit-level Pauli model derived from hardware preparation, measurement, idle, and CNOT error parameters

--- Page 2607.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Noise-adaptive pre-decoding capability allows AI systems to sequentially adapt to evolving hardware noise conditions while mitigating catastrophic forgetting, preserving knowledge acquired under previously encountered noise regimes.

  2. Robustness under distribution shift enables AI systems to maintain performance on novel hardware noise configurations without requiring target-domain fine-tuning, as demonstrated by the ability of QAdapt to improve metrics without target-domain fine-tuning.

  3. The system can simultaneously improve logical accuracy and reduce backend decoding latency under evolving hardware noise by reducing the number and complexity of residual detector events, which lowers the workload of the backend decoder while retaining global consistency.

  4. The AI system can function as an adaptive interface between a changing quantum-hardware layer and a stable classical decoding backend, broadening the operating range of existing decoding pipelines without modifying the quantum code or replacing established decoders.

  5. The framework enables local corrections to resolve parallelizable local structure within its receptive field, while PyMatching handles error chains that remain ambiguous or extend beyond that field, ensuring a modular pipeline where the final logical decision therefore remains the output of a globally consistent matching problem.

Sources

Related papers