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.18231 · IEEE International Symposium on Information Theory (ISIT)

Iterative Decoding of Stabilizer Codes under Radiation-Induced Correlated Noise

Anuj K. Nayak, Paul G. Baity, Peter J. Love, Nicholas Jeon, Byung-Jun Yoon, Adolfy Hoisie, Lav R. Varshney

quant-phcs.ITeess.SPSubmitted Mar 18, 2026• Announced Mar 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Fault-tolerant quantum computation demands extremely low logical error rates, yet superconducting qubit arrays are subject to radiation-induced correlated noise arising from cosmic-ray muon-generated quasiparticles. The quasiparticle density is unknown and time-varying, resulting in a mismatch between the true noise statistics and the priors assumed by standard decoders, and consequently, degraded logical performance. We formalize joint noise sensing and decoding using syndrome measurements by modeling the QP density as a latent variable, which governs correlation in physical errors and syndrome measurements. Starting from a variational expectation--maximization approach, we derive an iterative algorithm that alternates between QP density estimation and syndrome-based decoding under the updated noise model. Simulations of surface-code and bivariate bicycle quantum memory under radiation-induced correlated noise demonstrate a measurable reduction in logical error probability relative to baseline decoding with a uniform prior. Beyond improved decoding performance, the inferred QP density provides diagnostic information relevant to device characterization, shielding, and chip design. These results indicate that integrating physical noise estimation into decoding can mitigate correlated noise effects and relax effective error-rate requirements for fault-tolerant quantum computation.

Comments
14 pages, 14 figures, 2 tables, 2 algorithms

Related papers

Radiation‐Induced Fault Detection in Superconducting Quantum Devices

Marzio Vallero, Gioele Casagranda, Flavio Vella +1 more

ABSTRACT The quest for universal superconducting quantum computing is hindered by noise and errors. It has been proven that Quantum Error Correction (QEC) codes will lay at the foundation of fault‐tolerant quantum computing. However, cosmic‐ray‐induced correlated errors, the most detrimental events that can impact superconducting quantum computers, are yet to be efficiently tackled. In order to reach fault tolerance, we must also develop radiation aware methods to complement QEC. In this paper, the first algorithm to effectively exploit syndrome information for the efficient detection of radiation events in superconducting quantum devices at runtime is proposed. A thorough analysis of simulated Rotated Surface codes injecting over 11 million physics‐modeled radiation‐induced faults is performed. The properties of the X and Z check bases, the impact of code distance, and the decoder's time to solution constraints are considered. The technique detects of injected faults, regardless of the impact's position. Moreover, both the radiation impact center and the area affected are accurately identified, with an overhead lower than the decoding time. Additionally, the fault identification information is used to propose a radiation fault correction technique that improves of up to the output correctness compared to existing decoders.

arXiv:2506.16834•Advanced Quantum Technologies•Apr 1, 2026•2 citations

Noise characterisation of fault-tolerant quantum computers

Evan T. Hockings

Noise is the fundamental challenge to quantum computation. Large-scale quantum computers will overcome this challenge with fault-tolerant architectures that leverage quantum error correction. This thesis introduces and investigates a scalable noise characterisation protocol suited to this key context. First, we introduce this protocol by building upon averaged circuit eigenvalue sampling (ACES), a framework for noise characterisation experiments that simultaneously estimates the Pauli error probabilities of all gates in a Clifford circuit and captures averaged spatial correlations between gates implemented simultaneously in the layers of the circuit. We demonstrate the scalability and performance of our protocol through circuit-level numerical simulations of the entire noise characterisation procedure. Then we demonstrate in circuit-level numerical simulation that this protocol is practically capable of calibrating a fast correlated matching decoder, enabling noise-aware decoding. We find that noise-aware decoding increases the error suppression factor of the code, leading to reductions in the logical error rate that increase exponentially with the code distance. Finally, we present several results obtained from experimentally implementing this protocol. We use the noise characterisation results to design an improved syndrome extraction circuit for a heavy hexagon memory that is adapted to the noise characteristics of the quantum device. The model error of our noise characterisation results suggests that the circuit-level Pauli noise model estimated by ACES can describe the essential features of quantum noise. We also operate a heavy hexagon memory and use noise estimates to predict performance and inform decoding. These results demonstrate that Pauli noise estimates can calibrate decoders to enable noise-aware decoding and inform the co-design of quantum error correcting codes, decoders, fault-tolerant circuits, and quantum devices.

•Jan 1, 2025•0 citations

Identifying Logical Operations from Syndrome Histories for qLDPC Codes

Yizhuo Tan, Shifan Xu, Yongshan Ding +1 more

Syndrome histories are normally used to detect and correct errors in fault-tolerant quantum computation, but they can also reveal information about the logical operations executed during computation. We study logical-operation identification using syndrome histories alone or together with other classical measurement outcomes. We develop an exact inference method and a scalable approximation that account for unknown circuit faults and ideal measurement randomness. We evaluate automorphisms, logical Pauli measurements, T injections, and logical circuits combining these instructions on \([[18,4,2]]\) and \([[72,12,6]]\) bivariate bicycle (BB) codes under multiple noise models and error rates. A single logical instruction can be identified with over 94\% accuracy under circuit-level noise with error rates between \(10^ {-5} \) and \(10^{-3}\). We also achieve over 99\% accuracy for automorphism-based logical circuits and 78.32\% for logical circuits combining all three instructions. We further analyze identification ambiguities arising from insufficient or indistinguishable measurement information, fault timing, and approximation inference. Together, these results extend the role of syndromes beyond error decoding to identifying executed logical operations and circuits during fault-tolerant quantum computation. They also suggest that access to syndrome histories and related classical measurement outcomes may unintentionally reveal information about the executed computation.

quant-pharXiv:2610.40052•Oct 30, 2026•0 citations

Robust quantum information processing: decoding, lattice surgery, and quantum associative neural networks

Lukas Bödeker

Scalable quantum computation requires protocols that protect quantum information from noise while remaining compatible with realistic hardware constraints. This thesis develops and analyzes methods for diagnosing, optimizing, and extending such protocols in active quantum error correction and related open-system memory models. First, neural-network and graph-matching-based decoders are studied for stabilizer codes under circuit-level noise. We show that machine-learning-based decoders can learn fault-tolerant decoding strategies, and interpretability methods are introduced to analyze their individual decisions. The resulting attribution patterns identify physically meaningful syndrome signatures, monitor the emergence of fault-tolerant behavior during training, and reveal architectural failure modes. Further, a syndrome-correlation-based noise-inference method is extended to high-weight error signatures and applied to repeated stabilizer-measurement data from a surface-17 superconducting-qubit experiment. Based on the inference, we adapt a graph-matching-based decoder to the observed noise environment. In addition, a correlated matching decoder is introduced, in which information from one syndrome sector is used to modify the decoding graph of the complementary sector. As a next step, lattice surgery is studied as a primitive for creating entanglement between encoded surface-code qubits in planar superconducting architectures. Numerical simulations for two distance-three surface-code patches identify optimized schedules that reduce the anticipated logical failure probability by about 50%. Adaptive stabilizer-measurement schedules and reduced-connectivity constructions are analyzed, showing how lattice-surgery performance depends jointly on circuit design, decoding information, classical feedback latency, and hardware connectivity. We present experimental results for lattice-surgery-based entanglement creation with two repetition codes; these results indicate that the encoded bit-flip error-corrected protocol outperforms the corresponding physical-qubit-based entanglement creation protocol. Finally, an open quantum Hopfield model is analyzed as an autonomous associative memory. Further, a method is developed to characterize how many distinct stationary memory states can be supported in this open quantum system. This method is then used to calculate the maximal storage capacity of the considered open quantum Hopfield model. Together, these results show how learned decoding, experimental noise inference, hardware-aware logical operations, and open-system memory dynamics can be used to control quantum information in noisy devices.

•Jan 1, 2026•0 citations

Neural Decoders Reduce Logical Error Rates in Surface Code Quantum Systems

Lukas Schneider, Haruki Tanaka

Fault-tolerant quantum computation critically depends on the ability to detect and correct physical qubit errors faster than they accumulate. The surface code (SC) has emerged as the most experimentally promising quantum error correction (QEC) framework due to its high threshold and local stabilizer structure, yet its practical performance is bottlenecked by decoder efficiency. Traditional decoding approaches such as minimum-weight perfect matching (MWPM) achieve near-optimal accuracy under independent noise but struggle with correlated errors, circuit-level noise, and real-time latency constraints. This paper investigates how neural network (NN)-based decoders reduce logical error rates in SC quantum systems by learning complex syndrome-to-correction mappings from data. We propose a hybrid convolutional-recurrent neural architecture that processes stabilizer measurement syndromes across both spatial and temporal dimensions, enabling the decoder to capture correlated error patterns inherent in realistic hardware. Systematic simulations under depolarizing, biased, and circuit-level noise models demonstrate that the proposed neural decoder achieves a logical error rate reduction of up to 41.3% compared to MWPM at a physical error rate of p = 0.008, while maintaining sub-millisecond decoding latency compatible with superconducting qubit cycle times. These results establish that data-driven neural decoders represent a scalable and hardware-compatible pathway toward achieving the logical error rates required for practical fault-tolerant quantum computing.

Frontiers in Applied Physics and Mathematics•Mar 25, 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
Fault-tolerant quantum computation demands extremely low logical error rates, yet superconducting qubit arrays are subject to radiation-induced correlated noise arising from cosmic-ray muon-generated quasiparticles. The quasiparticle density is unknown and time-varying, resulting in a mismatch between the true noise statistics and the priors assumed by standard decoders, and consequently, degraded logical performance. We formalize joint noise sensing and decoding using syndrome measurements by modeling the QP density as a latent variable, which governs correlation in physical errors and syndrome measurements. Starting from a variational expectation--maximization approach, we derive an iterative algorithm that alternates between QP density estimation and syndrome-based decoding under the updated noise model. Simulations of surface-code and bivariate bicycle quantum memory under radiation-induced correlated noise demonstrate a measurable reduction in logical error probability relative to baseline decoding with a uniform prior. Beyond improved decoding performance, the inferred QP density provides diagnostic information relevant to device characterization, shielding, and chip design. These results indicate that integrating physical noise estimation into decoding can mitigate correlated noise effects and relax effective error-rate requirements for fault-tolerant quantum computation.
ABSTRACT The quest for universal superconducting quantum computing is hindered by noise and errors. It has been proven that Quantum Error Correction (QEC) codes will lay at the foundation of fault‐tolerant quantum computing. However, cosmic‐ray‐induced correlated errors, the most detrimental events that can impact superconducting quantum computers, are yet to be efficiently tackled. In order to reach fault tolerance, we must also develop radiation aware methods to complement QEC. In this paper, the first algorithm to effectively exploit syndrome information for the efficient detection of radiation events in superconducting quantum devices at runtime is proposed. A thorough analysis of simulated Rotated Surface codes injecting over 11 million physics‐modeled radiation‐induced faults is performed. The properties of the X and Z check bases, the impact of code distance, and the decoder's time to solution constraints are considered. The technique detects of injected faults, regardless of the impact's position. Moreover, both the radiation impact center and the area affected are accurately identified, with an overhead lower than the decoding time. Additionally, the fault identification information is used to propose a radiation fault correction technique that improves of up to the output correctness compared to existing decoders.
Noise is the fundamental challenge to quantum computation. Large-scale quantum computers will overcome this challenge with fault-tolerant architectures that leverage quantum error correction. This thesis introduces and investigates a scalable noise characterisation protocol suited to this key context. First, we introduce this protocol by building upon averaged circuit eigenvalue sampling (ACES), a framework for noise characterisation experiments that simultaneously estimates the Pauli error probabilities of all gates in a Clifford circuit and captures averaged spatial correlations between gates implemented simultaneously in the layers of the circuit. We demonstrate the scalability and performance of our protocol through circuit-level numerical simulations of the entire noise characterisation procedure. Then we demonstrate in circuit-level numerical simulation that this protocol is practically capable of calibrating a fast correlated matching decoder, enabling noise-aware decoding. We find that noise-aware decoding increases the error suppression factor of the code, leading to reductions in the logical error rate that increase exponentially with the code distance. Finally, we present several results obtained from experimentally implementing this protocol. We use the noise characterisation results to design an improved syndrome extraction circuit for a heavy hexagon memory that is adapted to the noise characteristics of the quantum device. The model error of our noise characterisation results suggests that the circuit-level Pauli noise model estimated by ACES can describe the essential features of quantum noise. We also operate a heavy hexagon memory and use noise estimates to predict performance and inform decoding. These results demonstrate that Pauli noise estimates can calibrate decoders to enable noise-aware decoding and inform the co-design of quantum error correcting codes, decoders, fault-tolerant circuits, and quantum devices.
Syndrome histories are normally used to detect and correct errors in fault-tolerant quantum computation, but they can also reveal information about the logical operations executed during computation. We study logical-operation identification using syndrome histories alone or together with other classical measurement outcomes. We develop an exact inference method and a scalable approximation that account for unknown circuit faults and ideal measurement randomness. We evaluate automorphisms, logical Pauli measurements, T injections, and logical circuits combining these instructions on [[18,4,2]][[18,4,2]][[18,4,2]] and [[72,12,6]][[72,12,6]][[72,12,6]] bivariate bicycle (BB) codes under multiple noise models and error rates. A single logical instruction can be identified with over 94\% accuracy under circuit-level noise with error rates between 10−510^ {-5} 10−5 and 10−310^{-3}10−3. We also achieve over 99\% accuracy for automorphism-based logical circuits and 78.32\% for logical circuits combining all three instructions. We further analyze identification ambiguities arising from insufficient or indistinguishable measurement information, fault timing, and approximation inference. Together, these results extend the role of syndromes beyond error decoding to identifying executed logical operations and circuits during fault-tolerant quantum computation. They also suggest that access to syndrome histories and related classical measurement outcomes may unintentionally reveal information about the executed computation.
Scalable quantum computation requires protocols that protect quantum information from noise while remaining compatible with realistic hardware constraints. This thesis develops and analyzes methods for diagnosing, optimizing, and extending such protocols in active quantum error correction and related open-system memory models. First, neural-network and graph-matching-based decoders are studied for stabilizer codes under circuit-level noise. We show that machine-learning-based decoders can learn fault-tolerant decoding strategies, and interpretability methods are introduced to analyze their individual decisions. The resulting attribution patterns identify physically meaningful syndrome signatures, monitor the emergence of fault-tolerant behavior during training, and reveal architectural failure modes. Further, a syndrome-correlation-based noise-inference method is extended to high-weight error signatures and applied to repeated stabilizer-measurement data from a surface-17 superconducting-qubit experiment. Based on the inference, we adapt a graph-matching-based decoder to the observed noise environment. In addition, a correlated matching decoder is introduced, in which information from one syndrome sector is used to modify the decoding graph of the complementary sector. As a next step, lattice surgery is studied as a primitive for creating entanglement between encoded surface-code qubits in planar superconducting architectures. Numerical simulations for two distance-three surface-code patches identify optimized schedules that reduce the anticipated logical failure probability by about 50%. Adaptive stabilizer-measurement schedules and reduced-connectivity constructions are analyzed, showing how lattice-surgery performance depends jointly on circuit design, decoding information, classical feedback latency, and hardware connectivity. We present experimental results for lattice-surgery-based entanglement creation with two repetition codes; these results indicate that the encoded bit-flip error-corrected protocol outperforms the corresponding physical-qubit-based entanglement creation protocol. Finally, an open quantum Hopfield model is analyzed as an autonomous associative memory. Further, a method is developed to characterize how many distinct stationary memory states can be supported in this open quantum system. This method is then used to calculate the maximal storage capacity of the considered open quantum Hopfield model. Together, these results show how learned decoding, experimental noise inference, hardware-aware logical operations, and open-system memory dynamics can be used to control quantum information in noisy devices.
Fault-tolerant quantum computation critically depends on the ability to detect and correct physical qubit errors faster than they accumulate. The surface code (SC) has emerged as the most experimentally promising quantum error correction (QEC) framework due to its high threshold and local stabilizer structure, yet its practical performance is bottlenecked by decoder efficiency. Traditional decoding approaches such as minimum-weight perfect matching (MWPM) achieve near-optimal accuracy under independent noise but struggle with correlated errors, circuit-level noise, and real-time latency constraints. This paper investigates how neural network (NN)-based decoders reduce logical error rates in SC quantum systems by learning complex syndrome-to-correction mappings from data. We propose a hybrid convolutional-recurrent neural architecture that processes stabilizer measurement syndromes across both spatial and temporal dimensions, enabling the decoder to capture correlated error patterns inherent in realistic hardware. Systematic simulations under depolarizing, biased, and circuit-level noise models demonstrate that the proposed neural decoder achieves a logical error rate reduction of up to 41.3% compared to MWPM at a physical error rate of p = 0.008, while maintaining sub-millisecond decoding latency compatible with superconducting qubit cycle times. These results establish that data-driven neural decoders represent a scalable and hardware-compatible pathway toward achieving the logical error rates required for practical fault-tolerant quantum computing.
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.