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

Adaptive Control of Stochastic Error Accumulation in Fault-Tolerant Quantum Computation

Tirtha Haque

quant-phSubmitted Mar 16, 2026• Announced Mar 17, 2026• 0 citations
arXivHTMLPDF

Abstract

In realistic hardware for quantum computation that possesses fault-tolerance, non-stationary noise and stochastic drift lead to logical failure from the temporal accumulation of errors, not from independent events. Static decoding and fixed calibration techniques are structurally incompatible with this situation because they do not take into account temporal correlations between errors or control-induced back-action of errors. These effects motivate control policies that must track noise evolution across correction cycles, rather than respond to individual syndromes in isolation. We treat fault-tolerant quantum computation as a stochastic control problem, modelled using reduced quantum dynamics in which Pauli error processes are governed by latent noise parameters that vary temporally. From this perspective, logical failure arises through the accumulation of a hazard variable, and the corresponding control objective depends on the full history of observations. Operating under these conditions, a Chronological Deep Q-Network (Ch-DQN) maintains an internal belief state that tracks both noise evolution and accumulated hazard. During training, backward refinement of trajectories is used to sample slowly drifting modes of operation, while runtime inference remains strictly causal. A fractional meta-update stabilizes learning in the presence of non-stationary, control-coupled dynamics. Through multi-distance simulations that incorporate stochastic drift and feedback from decision-making, Ch-DQN suppresses hazard accumulation and extends logical survival time relative to static and recurrent baselines. Error correction in this regime is therefore no longer a static decoding task, but a control process whose success is determined over time by the underlying noise dynamics.

Comments
16 pages, 10 figures, submitted to Quantum Science and Technology

Related papers

Decoding under Backlog Constraints as a Sequential Control Problem: A Deep Reinforcement Learning Approach for Quantum Error Correction

Hiroshi Tanaka, Anwar Ali, Muhammad Imran

The practical realization of fault-tolerant quantum computing relies fundamentally on the rapid and accurate decoding of quantum error-correcting codes. However, existing analyses of decoding algorithms often treat the problem as a sequence of independent, state-less optimization tasks, typically optimizing for a scalar metric such as logical error rate or average latency. In reality, the decoding process in a continuously operating quantum computer is tightly constrained by the physical rate of syndrome extraction and the finite capacity of the classical processing buffer, creating a non-trivial backlog dynamic. In this work, we present a rigorous mathematical framework that formulates the quantum decoding problem under strict backlog constraints as a discrete-time Markov Decision Process (MDP). By augmenting the state space to include both the real-time syndrome weight and the instantaneous buffer backlog, we shift the paradigm from one-dimensional thresholding to a multi-dimensional sequential control problem. We demonstrate mathematically and empirically that when the queue dynamics are explicitly modeled, the optimal policy diverges significantly from simple syndrome-weight thresholds. Furthermore, we employ Deep Q-Networks (DQN) to discover non-linear policies that inherently balance the trade-off between logical error suppression and queue stability. Our control-theoretic analysis reveals that incorporating state-space representations of the backlog allows RL agents to robustly prevent buffer overflow while maintaining near-optimal logical fidelity. Through extensive simulation on surface codes under circuit-level noise, our DQN agent strictly outperforms naive two-dimensional grid-search baselines, achieving a zero overflow rate in critical regimes where traditional thresholding fails catastrophically.

•Jul 21, 2026•0 citations

Decoding under Backlog Constraints as a Sequential Control Problem: A Deep Reinforcement Learning Approach for Quantum Error Correction

Ali Anwar, Tanaka Hiroshi, Imran Muhammad

The practical realization of fault-tolerant quantum computing relies fundamentally on the rapid and accurate decoding of quantum error-correcting codes. However, existing analyses of decoding algorithms often treat the problem as a sequence of independent, state-less optimization tasks, typically optimizing for a scalar metric such as logical error rate or average latency. In reality, the decoding process in a continuously operating quantum computer is tightly constrained by the physical rate of syndrome extraction and the finite capacity of the classical processing buffer, creating a non-trivial backlog dynamic. In this work, we present a rigorous mathematical framework that formulates the quantum decoding problem under strict backlog constraints as a discrete-time Markov Decision Process (MDP). By augmenting the state space to include both the real-time syndrome weight and the instantaneous buffer backlog, we shift the paradigm from one-dimensional thresholding to a multi-dimensional sequential control problem. We demonstrate mathematically and empirically that when the queue dynamics are explicitly modeled, the optimal policy diverges significantly from simple syndrome-weight thresholds. Furthermore, we employ Deep Q-Networks (DQN) to discover non-linear policies that inherently balance the trade-off between logical error suppression and queue stability. Our control-theoretic analysis reveals that incorporating state-space representations of the backlog allows RL agents to robustly prevent buffer overflow while maintaining near-optimal logical fidelity. Through extensive simulation on surface codes under circuit-level noise, our DQN agent strictly outperforms naive two-dimensional grid-search baselines, achieving a zero overflow rate in critical regimes where traditional thresholding fails catastrophically.

•Jul 21, 2026•0 citations

Provably Efficient Self-Calibrating Quantum Fault Tolerance

Weiyuan Gong, Hong-Ye Hu

Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental fluctuations. As future fault-tolerant quantum computations are expected to run for days or even months, interrupting computation for repeated recalibration becomes fundamentally impractical. A promising alternative is to integrate calibration directly into computation by repurposing syndrome measurements as a calibration signal (Sivak et al, Nature 2026), but whether such self-calibration can be achieved with provable efficiency remains an open question. Here we establish a theoretical framework for such self-calibrating quantum fault tolerance. We prove that, for a broad class of control-induced errors, the detection rate defines a locally strongly convex surrogate objective for analog calibration with high probability. This geometric property enables a simple and efficient online optimization algorithm using only syndrome measurements collected during normal error correction. We prove convergence to an $\varepsilon$ detection rate within $O(1/\varepsilon^2)$ epochs for time-independent drifts and also establish guarantees for time-dependent drifts. We further show that the convergence rate is independent of the code distance for quantum low-density parity-check (LDPC) codes. Pulse-level simulations of neutral-atom arrays and large-scale circuit-level Clifford simulations confirm these theoretical predictions. Our results establish self-calibrating fault tolerance as a provably efficient paradigm in which the same syndrome measurements simultaneously protect logical information and stabilize the underlying hardware.

quant-pharXiv:2608.05686•Aug 7, 2026•4 citations

ADAPTIVE REINFORCEMENT LEARNING FOR QUANTUM ERROR CORRECTION UNDER NON-STATIONARY NOISE: A CONTINUAL/META-RL FRAMEWORK FOR DRIFT-ROBUST DECODING

P. Suresh Varma, M. V. Rama Sundari

Quantum error correction (QEC) decoders are usually trained and evaluated assuming stationary physical noise.Real superconducting and trapped-ion processors, however, exhibit noise that drifts over calibration cycles, shifts abruptly because of twolevel-system defects and cosmic-ray events, and varies across qubits.Static decoders, whether algorithmic (minimum-weight perfect matching, union-find) or learned (such as AlphaQubit), degrade when deployed noise diverges from the training distribution, and full retraining is costly and can cause catastrophic forgetting.This paper proposes Adaptive-RL-QEC, a research framework that formulates decoding and noise adaptation as a reinforcement learning problem over a non-stationary Markov decision process with an unobserved noise-regime variable.It couples a lightweight online noise-regime estimator with a continual/meta-reinforcement-learning decoding policy that adapts within a bounded number of syndrome rounds without catastrophic P.

INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY•Oct 5, 2026•0 citations

History-Conditioned Quantum Error Correction under Temporally Correlated Noise: Finite-Horizon Performance and Reproducible Simulations of a Three-Qubit Phase-Error Code

TrinityLabo

This preliminary research preprint presents a reproducible numerical study of history-conditioned quantum error correction under temporally correlated noise. We consider a three-qubit phase-error code subject to a synthetic Pauli noise model with a persistent hidden noise regime. A noisy classical monitor and the accumulated syndrome/measurement history are used to estimate that regime through standard Bayesian hidden-Markov filtering, and recovery operations are selected by a causal maximum-a-posteriori rule. The central question is whether accessible temporal information can extend the finite interval over which encoded quantum information remains reliable. In 100,000 matched synthetic trajectories, survival through 20 correction rounds increases from 0.74406 for a snapshot MAP decoder to 0.91455 for the history-conditioned decoder. Under a 90% no-logical-fault survival criterion, the empirical computational-memory window increases from 6 to 25 rounds, with a simultaneous 95% lower confidence band supporting 23 rounds for the history-conditioned policy. Control experiments show that the advantage disappears when temporal predictability is removed: when the hidden regime becomes independent from round to round, the history-conditioned and snapshot policies coincide. Additional monitor and model ablations demonstrate that the benefit depends on correction-relevant temporal correlations, informative side information, and adequate calibration. The work also formulates finite-horizon survival criteria and sufficient error-budget bounds without assuming independent logical faults, while explicitly separating classical filter stability from preservation of quantum information. This study does not claim a new Bayesian filtering method, superiority over existing temporal quantum-error-correction decoders, a scalable fault-tolerance threshold, or demonstrated room-temperature quantum-computing hardware. Rather, it provides a concrete operational specialization of the broader TrinityLabo history-first framework and a small, reproducible benchmark showing how temporal inference can condition quantum recovery under specified noise assumptions. Ambient-temperature operation remains a future experimental application requiring calibrated device-level noise models, fault-prone syndrome extraction, hardware latency analysis, and comparison against established temporal decoders.

•Sep 26, 2026•0 citations

Adaptive error management for fault-tolerant quantum computing across hardware-level suppression, system-level diagnosis, and real-time decoding

Marwa R. Donkol, Naima Kaabouch

Abstract Fault-tolerant quantum computing reached a milestone in December 2024 when Google’s Willow processor demonstrated below-threshold error correction on a superconducting chip, a result since reproduced on neutral-atom and alternative superconducting platforms. Yet the classical decoders needed to sustain this performance face a scaling challenge: noise becomes increasingly structured and correlated as systems grow, while decoders must respond within microsecond coherence windows. This survey asks whether error suppression, noise diagnosis, and decoding are better treated as one adaptive control problem than as three separate research programs. Drawing on a scoping review of 146 records, it organizes the field into a three-layer taxonomy. Layer 1 (Hardware-Level Suppression) integrates protection into the physical substrate; bosonic cat qubits exponentially suppress bit-flip errors, projecting up to 90% overhead reduction versus surface codes. Layer 2 (Diagnosis) employs probabilistic models and computational intelligence to characterize error sources; neuro-fuzzy architectures and the Bias–Entropy decomposition separate hardware drift from logical faults, subject to an identifiability limit that we characterize. Layer 3 (Real-time Decoding) targets the integration of machine learning within strict latency constraints. Hardware acceleration now approaches superconducting cycle times, which shifts the case for learned decoders from speed toward accuracy under correlated noise; recent advances favor hybrid, physics-informed architectures: Neural Belief Propagation resolves degeneracy issues in quantum low-density parity-check codes by embedding topological constraints directly into the network’s loss function. These results suggest a transition toward closed-loop AI architectures that treat error management as continuous control rather than static algorithm selection.

Discover Quantum Science•Nov 7, 2026•0 citations
In realistic hardware for quantum computation that possesses fault-tolerance, non-stationary noise and stochastic drift lead to logical failure from the temporal accumulation of errors, not from independent events. Static decoding and fixed calibration techniques are structurally incompatible with this situation because they do not take into account temporal correlations between errors or control-induced back-action of errors. These effects motivate control policies that must track noise evolution across correction cycles, rather than respond to individual syndromes in isolation.
We treat fault-tolerant quantum computation as a stochastic control problem, modelled using reduced quantum dynamics in which Pauli error processes are governed by latent noise parameters that vary temporally. From this perspective, logical failure arises through the accumulation of a hazard variable, and the corresponding control objective depends on the full history of observations.
Operating under these conditions, a Chronological Deep Q-Network (Ch-DQN) maintains an internal belief state that tracks both noise evolution and accumulated hazard. During training, backward refinement of trajectories is used to sample slowly drifting modes of operation, while runtime inference remains strictly causal. A fractional meta-update stabilizes learning in the presence of non-stationary, control-coupled dynamics.
Through multi-distance simulations that incorporate stochastic drift and feedback from decision-making, Ch-DQN suppresses hazard accumulation and extends logical survival time relative to static and recurrent baselines. Error correction in this regime is therefore no longer a static decoding task, but a control process whose success is determined over time by the underlying noise dynamics.
The practical realization of fault-tolerant quantum computing relies fundamentally on the rapid and accurate decoding of quantum error-correcting codes. However, existing analyses of decoding algorithms often treat the problem as a sequence of independent, state-less optimization tasks, typically optimizing for a scalar metric such as logical error rate or average latency. In reality, the decoding process in a continuously operating quantum computer is tightly constrained by the physical rate of syndrome extraction and the finite capacity of the classical processing buffer, creating a non-trivial backlog dynamic. In this work, we present a rigorous mathematical framework that formulates the quantum decoding problem under strict backlog constraints as a discrete-time Markov Decision Process (MDP). By augmenting the state space to include both the real-time syndrome weight and the instantaneous buffer backlog, we shift the paradigm from one-dimensional thresholding to a multi-dimensional sequential control problem. We demonstrate mathematically and empirically that when the queue dynamics are explicitly modeled, the optimal policy diverges significantly from simple syndrome-weight thresholds. Furthermore, we employ Deep Q-Networks (DQN) to discover non-linear policies that inherently balance the trade-off between logical error suppression and queue stability. Our control-theoretic analysis reveals that incorporating state-space representations of the backlog allows RL agents to robustly prevent buffer overflow while maintaining near-optimal logical fidelity. Through extensive simulation on surface codes under circuit-level noise, our DQN agent strictly outperforms naive two-dimensional grid-search baselines, achieving a zero overflow rate in critical regimes where traditional thresholding fails catastrophically.
The practical realization of fault-tolerant quantum computing relies fundamentally on the rapid and accurate decoding of quantum error-correcting codes. However, existing analyses of decoding algorithms often treat the problem as a sequence of independent, state-less optimization tasks, typically optimizing for a scalar metric such as logical error rate or average latency. In reality, the decoding process in a continuously operating quantum computer is tightly constrained by the physical rate of syndrome extraction and the finite capacity of the classical processing buffer, creating a non-trivial backlog dynamic. In this work, we present a rigorous mathematical framework that formulates the quantum decoding problem under strict backlog constraints as a discrete-time Markov Decision Process (MDP). By augmenting the state space to include both the real-time syndrome weight and the instantaneous buffer backlog, we shift the paradigm from one-dimensional thresholding to a multi-dimensional sequential control problem. We demonstrate mathematically and empirically that when the queue dynamics are explicitly modeled, the optimal policy diverges significantly from simple syndrome-weight thresholds. Furthermore, we employ Deep Q-Networks (DQN) to discover non-linear policies that inherently balance the trade-off between logical error suppression and queue stability. Our control-theoretic analysis reveals that incorporating state-space representations of the backlog allows RL agents to robustly prevent buffer overflow while maintaining near-optimal logical fidelity. Through extensive simulation on surface codes under circuit-level noise, our DQN agent strictly outperforms naive two-dimensional grid-search baselines, achieving a zero overflow rate in critical regimes where traditional thresholding fails catastrophically.
Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental fluctuations. As future fault-tolerant quantum computations are expected to run for days or even months, interrupting computation for repeated recalibration becomes fundamentally impractical. A promising alternative is to integrate calibration directly into computation by repurposing syndrome measurements as a calibration signal (Sivak et al, Nature 2026), but whether such self-calibration can be achieved with provable efficiency remains an open question. Here we establish a theoretical framework for such self-calibrating quantum fault tolerance. We prove that, for a broad class of control-induced errors, the detection rate defines a locally strongly convex surrogate objective for analog calibration with high probability. This geometric property enables a simple and efficient online optimization algorithm using only syndrome measurements collected during normal error correction. We prove convergence to an ε\varepsilonε detection rate within O(1/ε2)O(1/\varepsilon^2)O(1/ε2) epochs for time-independent drifts and also establish guarantees for time-dependent drifts. We further show that the convergence rate is independent of the code distance for quantum low-density parity-check (LDPC) codes. Pulse-level simulations of neutral-atom arrays and large-scale circuit-level Clifford simulations confirm these theoretical predictions. Our results establish self-calibrating fault tolerance as a provably efficient paradigm in which the same syndrome measurements simultaneously protect logical information and stabilize the underlying hardware.
Quantum error correction (QEC) decoders are usually trained and evaluated assuming stationary physical noise.Real superconducting and trapped-ion processors, however, exhibit noise that drifts over calibration cycles, shifts abruptly because of twolevel-system defects and cosmic-ray events, and varies across qubits.Static decoders, whether algorithmic (minimum-weight perfect matching, union-find) or learned (such as AlphaQubit), degrade when deployed noise diverges from the training distribution, and full retraining is costly and can cause catastrophic forgetting.This paper proposes Adaptive-RL-QEC, a research framework that formulates decoding and noise adaptation as a reinforcement learning problem over a non-stationary Markov decision process with an unobserved noise-regime variable.It couples a lightweight online noise-regime estimator with a continual/meta-reinforcement-learning decoding policy that adapts within a bounded number of syndrome rounds without catastrophic P.
This preliminary research preprint presents a reproducible numerical study of history-conditioned quantum error correction under temporally correlated noise. We consider a three-qubit phase-error code subject to a synthetic Pauli noise model with a persistent hidden noise regime. A noisy classical monitor and the accumulated syndrome/measurement history are used to estimate that regime through standard Bayesian hidden-Markov filtering, and recovery operations are selected by a causal maximum-a-posteriori rule. The central question is whether accessible temporal information can extend the finite interval over which encoded quantum information remains reliable. In 100,000 matched synthetic trajectories, survival through 20 correction rounds increases from 0.74406 for a snapshot MAP decoder to 0.91455 for the history-conditioned decoder. Under a 90% no-logical-fault survival criterion, the empirical computational-memory window increases from 6 to 25 rounds, with a simultaneous 95% lower confidence band supporting 23 rounds for the history-conditioned policy. Control experiments show that the advantage disappears when temporal predictability is removed: when the hidden regime becomes independent from round to round, the history-conditioned and snapshot policies coincide. Additional monitor and model ablations demonstrate that the benefit depends on correction-relevant temporal correlations, informative side information, and adequate calibration. The work also formulates finite-horizon survival criteria and sufficient error-budget bounds without assuming independent logical faults, while explicitly separating classical filter stability from preservation of quantum information. This study does not claim a new Bayesian filtering method, superiority over existing temporal quantum-error-correction decoders, a scalable fault-tolerance threshold, or demonstrated room-temperature quantum-computing hardware. Rather, it provides a concrete operational specialization of the broader TrinityLabo history-first framework and a small, reproducible benchmark showing how temporal inference can condition quantum recovery under specified noise assumptions. Ambient-temperature operation remains a future experimental application requiring calibrated device-level noise models, fault-prone syndrome extraction, hardware latency analysis, and comparison against established temporal decoders.
Abstract Fault-tolerant quantum computing reached a milestone in December 2024 when Google’s Willow processor demonstrated below-threshold error correction on a superconducting chip, a result since reproduced on neutral-atom and alternative superconducting platforms. Yet the classical decoders needed to sustain this performance face a scaling challenge: noise becomes increasingly structured and correlated as systems grow, while decoders must respond within microsecond coherence windows. This survey asks whether error suppression, noise diagnosis, and decoding are better treated as one adaptive control problem than as three separate research programs. Drawing on a scoping review of 146 records, it organizes the field into a three-layer taxonomy. Layer 1 (Hardware-Level Suppression) integrates protection into the physical substrate; bosonic cat qubits exponentially suppress bit-flip errors, projecting up to 90% overhead reduction versus surface codes. Layer 2 (Diagnosis) employs probabilistic models and computational intelligence to characterize error sources; neuro-fuzzy architectures and the Bias–Entropy decomposition separate hardware drift from logical faults, subject to an identifiability limit that we characterize. Layer 3 (Real-time Decoding) targets the integration of machine learning within strict latency constraints. Hardware acceleration now approaches superconducting cycle times, which shifts the case for learned decoders from speed toward accuracy under correlated noise; recent advances favor hybrid, physics-informed architectures: Neural Belief Propagation resolves degeneracy issues in quantum low-density parity-check codes by embedding topological constraints directly into the network’s loss function. These results suggest a transition toward closed-loop AI architectures that treat error management as continuous control rather than static algorithm selection.