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:2010.02243 · Physical Review Research

Optimal noise estimation from syndrome statistics of quantum codes

Thomas Wagner, Hermann Kampermann, Dagmar Bruß, Martin Kliesch

Published Mar 31, 2021• 18 citations
arXivHTMLPDF

Abstract

Quantum error correction allows to actively correct errors occurring in a quantum computation when the noise is weak enough.To make this error correction competitive information about the specific noise is required.Traditionally, this information is obtained by benchmarking the device before operation.We address the question of what can be learned from only the measurements done during decoding.Such estimation of noise models was proposed for surface codes, exploiting their special structure, and in the limit of low error rates, also for other codes.However, so far it has been unclear under what general conditions noise models can be estimated from the syndrome measurements.In this work, we derive a general condition for identifiability of the error rates.For general stabilizer codes, we prove identifiability under the assumption that the rates are small enough.Without this assumption, we prove a result for perfect codes.Finally, we propose a practical estimation method with linear runtime for concatenated codes.We demonstrate that it outperforms other recently proposed methods and that the estimation is optimal in the sense that it reaches the Cramér-Rao bound.Our method paves the way for practical calibration of error corrected quantum devices during operation.

DOI
10.1103/physrevresearch.3.013292

Related papers

Pauli channels can be estimated from syndrome measurements in quantum error correction

Thomas Wagner, Hermann Kampermann, Dagmar Bruß +1 more

The performance of quantum error correction can be significantly improved if detailed information about the noise is available, allowing to optimize both codes and decoders. It has been proposed to estimate error rates from the syndrome measurements done anyway during quantum error correction. While these measurements preserve the encoded quantum state, it is currently not clear how much information about the noise can be extracted in this way. So far, apart from the limit of vanishing error rates, rigorous results have only been established for some specific codes. In this work, we rigorously resolve the question for arbitrary stabilizer codes. The main result is that a stabilizer code can be used to estimate Pauli channels with correlations across a number of qubits given by the pure distance. This result does not rely on the limit of vanishing error rates, and applies even if high weight errors occur frequently. Moreover, it also allows for measurement errors within the framework of quantum data-syndrome codes. Our proof combines Boolean Fourier analysis, combinatorics and elementary algebraic geometry. It is our hope that this work opens up interesting applications, such as the online adaptation of a decoder to time-varying noise.

arXiv:2107.14252•Quantum•Sep 19, 2022•38 citations

Correcting a noisy quantum computer using a quantum computer

Pan Zhang

Quantum computers require error correction to achieve universal quantum computing. However, current decoding of quantum error-correcting codes relies on classical computation, which is slower than quantum operations in superconducting qubits. This discrepancy makes the practical implementation of real-time quantum error correction challenging. In this work, we propose a decoding scheme that leverages the operations of the quantum circuit itself. Given a noisy quantum circuit $A$, we train a decoding quantum circuit $B$ using syndrome measurements to identify the logical operators needed to correct errors in circuit $A$. The trained quantum circuit $B$ can be deployed on quantum devices, such as superconducting qubits, to perform real-time decoding and error correction. Our approach is applicable to general quantum codes with multiple logical qubits and operates efficiently under various noise conditions, and the decoding speed matches the speed of the quantum circuits being corrected. We have conducted numerical experiments using surface codes up to distance 7 under circuit-level noise, demonstrating performance on par with the classical minimum-weight perfect matching algorithm. Interestingly, our method reveals that the traditionally classical task of decoding error-correcting codes can be accomplished without classical devices or measurements. This insight paves the way for the development of self-correcting quantum computers.

arXiv:2506.08331•Jun 10, 2025•3 citations

What Must a Quantum-Memory Decoder Know About Temporally Correlated Noise?

Danesh Morales-Hashemi, Graeme Smith, Ningping Cao

What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent $X$ rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching $1/2$ relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below $1/2$, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's $X$ distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.

quant-pharXiv:2610.03545•Oct 5, 2026•0 citations

Estimating decoding graphs and hypergraphs of memory quantum error-correction experiments

Evangelia Takou, Kenneth R. Brown

Characterizing the error sources of quantum devices is essential for building reliable large-scale quantum architectures and tailoring error correction codes to the noise profile of the devices. Tomography techniques can provide detailed information on the noise or quality of quantum states but are typically both computationally and experimentally intensive with respect to the system's size. For QEC experiments, however, the information captured by a detector error model is sufficient for extracting the success rate of the experiment, as well as some information about the underlying noise. In this work, we estimate Pauli noise on detector error models, including hypergraphs, using only the syndrome statistics. We apply this method to well-known codes such as the repetition, surface, and 2D color codes. Under bare-ancilla syndrome extraction, two-point correlations are enough to reconstruct the detector error model for repetition or surface codes. For color codes or repetition codes under Steane-style syndrome extraction, we show how to extend the estimation method to multi-point correlators and extract the error rates of the hypergraphs. Finally, we find an increase in logical error suppression when we calibrate the decoder to noise fluctuations typically present in experiments.

arXiv:2504.20212•Physical Review A•Nov 7, 2025•16 citations

Syndrome resampling enhances quantum error correction thresholds

Luis Colmenarez, Áron Márton, Markus Müller

Quantum error correction (QEC) enables fault-tolerant quantum computation but requires operating quantum hardware at physical error rates below code-dependent thresholds, which remains challenging for current devices. We introduce syndrome resampling, a general method that increases QEC thresholds of any decoder and suppresses logical errors without additional hardware, decoding modifications, or code-specific assumptions beyond syndrome statistics. The method exploits the fact that syndromes with low probability are likely to lead to logical failure, therefore biasing syndrome averages towards most likely syndromes effectively increases logical fidelities. We establish a direct connection between the Rényi coherent information (RCI) and powers of the syndrome probability distribution, showing that resampling syndromes according to these powers combined with maximum likelihood decoding (MLD) realizes a family of optimal thresholds associated with phase transitions in the RCI. Numerical simulations of surface codes demonstrate that syndrome resampling substantially increases thresholds for both optimal and suboptimal decoders and reduces logical error rates by up to four orders of magnitude in experimentally relevant regimes. We further show that syndrome resampling can be effectively implemented from finite data and combined with decoding-based post-selection to achieve additional gains. Finally, applying the method to existing experimental QEC data yields up to two orders of magnitude reduction in logical error rates without requiring additional measurements. Our results provide a practical and decoder-agnostic route to improved logical fidelities in near-term QEC experiments.

quant-pharXiv:2605.06101•Physical Review Letters•May 8, 2026•2 citations

Learning Logical Pauli Noise in Quantum Error Correction

Thomas Wagner, Hermann Kampermann, Dagmar Bruß +1 more

The characterization of quantum devices is crucial for their practical implementation but can be costly in experimental effort and classical postprocessing. Therefore, it is desirable to measure only the information that is relevant for specific applications and develop protocols that require little additional effort. In this Letter, we focus on the characterization of quantum computers in the context of stabilizer quantum error correction. For arbitrary stabilizer codes, subsystem codes, and data syndrome codes, we prove that the logical error channel induced by Pauli noise can be estimated from syndrome data under minimal conditions. More precisely, for any such code, we show that the estimation is possible as long as the code can correct the noise.

arXiv:2209.09267•Physical Review Letters•May 15, 2023•28 citations
Quantum error correction allows to actively correct errors occurring in a quantum computation when the noise is weak enough.To make this error correction competitive information about the specific noise is required.Traditionally, this information is obtained by benchmarking the device before operation.We address the question of what can be learned from only the measurements done during decoding.Such estimation of noise models was proposed for surface codes, exploiting their special structure, and in the limit of low error rates, also for other codes.However, so far it has been unclear under what general conditions noise models can be estimated from the syndrome measurements.In this work, we derive a general condition for identifiability of the error rates.For general stabilizer codes, we prove identifiability under the assumption that the rates are small enough.Without this assumption, we prove a result for perfect codes.Finally, we propose a practical estimation method with linear runtime for concatenated codes.We demonstrate that it outperforms other recently proposed methods and that the estimation is optimal in the sense that it reaches the Cramér-Rao bound.Our method paves the way for practical calibration of error corrected quantum devices during operation.
The performance of quantum error correction can be significantly improved if detailed information about the noise is available, allowing to optimize both codes and decoders. It has been proposed to estimate error rates from the syndrome measurements done anyway during quantum error correction. While these measurements preserve the encoded quantum state, it is currently not clear how much information about the noise can be extracted in this way. So far, apart from the limit of vanishing error rates, rigorous results have only been established for some specific codes. In this work, we rigorously resolve the question for arbitrary stabilizer codes. The main result is that a stabilizer code can be used to estimate Pauli channels with correlations across a number of qubits given by the pure distance. This result does not rely on the limit of vanishing error rates, and applies even if high weight errors occur frequently. Moreover, it also allows for measurement errors within the framework of quantum data-syndrome codes. Our proof combines Boolean Fourier analysis, combinatorics and elementary algebraic geometry. It is our hope that this work opens up interesting applications, such as the online adaptation of a decoder to time-varying noise.
Quantum computers require error correction to achieve universal quantum computing. However, current decoding of quantum error-correcting codes relies on classical computation, which is slower than quantum operations in superconducting qubits. This discrepancy makes the practical implementation of real-time quantum error correction challenging. In this work, we propose a decoding scheme that leverages the operations of the quantum circuit itself. Given a noisy quantum circuit AAA, we train a decoding quantum circuit BBB using syndrome measurements to identify the logical operators needed to correct errors in circuit AAA. The trained quantum circuit BBB can be deployed on quantum devices, such as superconducting qubits, to perform real-time decoding and error correction. Our approach is applicable to general quantum codes with multiple logical qubits and operates efficiently under various noise conditions, and the decoding speed matches the speed of the quantum circuits being corrected. We have conducted numerical experiments using surface codes up to distance 7 under circuit-level noise, demonstrating performance on par with the classical minimum-weight perfect matching algorithm. Interestingly, our method reveals that the traditionally classical task of decoding error-correcting codes can be accomplished without classical devices or measurements. This insight paves the way for the development of self-correcting quantum computers.
What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent XXX rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching 1/21/21/2 relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below 1/21/21/2, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's XXX distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.
Characterizing the error sources of quantum devices is essential for building reliable large-scale quantum architectures and tailoring error correction codes to the noise profile of the devices. Tomography techniques can provide detailed information on the noise or quality of quantum states but are typically both computationally and experimentally intensive with respect to the system's size. For QEC experiments, however, the information captured by a detector error model is sufficient for extracting the success rate of the experiment, as well as some information about the underlying noise. In this work, we estimate Pauli noise on detector error models, including hypergraphs, using only the syndrome statistics. We apply this method to well-known codes such as the repetition, surface, and 2D color codes. Under bare-ancilla syndrome extraction, two-point correlations are enough to reconstruct the detector error model for repetition or surface codes. For color codes or repetition codes under Steane-style syndrome extraction, we show how to extend the estimation method to multi-point correlators and extract the error rates of the hypergraphs. Finally, we find an increase in logical error suppression when we calibrate the decoder to noise fluctuations typically present in experiments.
Quantum error correction (QEC) enables fault-tolerant quantum computation but requires operating quantum hardware at physical error rates below code-dependent thresholds, which remains challenging for current devices. We introduce syndrome resampling, a general method that increases QEC thresholds of any decoder and suppresses logical errors without additional hardware, decoding modifications, or code-specific assumptions beyond syndrome statistics. The method exploits the fact that syndromes with low probability are likely to lead to logical failure, therefore biasing syndrome averages towards most likely syndromes effectively increases logical fidelities. We establish a direct connection between the Rényi coherent information (RCI) and powers of the syndrome probability distribution, showing that resampling syndromes according to these powers combined with maximum likelihood decoding (MLD) realizes a family of optimal thresholds associated with phase transitions in the RCI. Numerical simulations of surface codes demonstrate that syndrome resampling substantially increases thresholds for both optimal and suboptimal decoders and reduces logical error rates by up to four orders of magnitude in experimentally relevant regimes. We further show that syndrome resampling can be effectively implemented from finite data and combined with decoding-based post-selection to achieve additional gains. Finally, applying the method to existing experimental QEC data yields up to two orders of magnitude reduction in logical error rates without requiring additional measurements. Our results provide a practical and decoder-agnostic route to improved logical fidelities in near-term QEC experiments.
The characterization of quantum devices is crucial for their practical implementation but can be costly in experimental effort and classical postprocessing. Therefore, it is desirable to measure only the information that is relevant for specific applications and develop protocols that require little additional effort. In this Letter, we focus on the characterization of quantum computers in the context of stabilizer quantum error correction. For arbitrary stabilizer codes, subsystem codes, and data syndrome codes, we prove that the logical error channel induced by Pauli noise can be estimated from syndrome data under minimal conditions. More precisely, for any such code, we show that the estimation is possible as long as the code can correct the noise.