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:2312.14139 · PRX Quantum

Quasiprobabilistic Readout Correction of Midcircuit Measurements for Adaptive Feedback via Measurement Randomized Compiling

Akel Hashim, Arnaud Carignan-Dugas, Larry Chen, Christian Jünger, Neelay Fruitwala, Yilun Xu, Gang Huang, Joel J. Wallman, Irfan A. Siddiqi

Published Jan 10, 2025• 10 citations
arXivHTMLPDF

Abstract

Quantum measurements are a fundamental component of quantum computing. However, on present-day quantum computers, measurements can be more error prone than quantum gates and are susceptible to nonunital errors as well as nonlocal correlations due to measurement crosstalk. While readout errors can be mitigated in postprocessing, this is inefficient in the number of qubits due to a combinatorially large number of possible states that need to be characterized. In this work, we show that measurement errors can be tailored into a simple stochastic error model using randomized compiling, enabling the efficient mitigation of readout errors via quasiprobability distributions reconstructed from the measurement of a single preparation state in an exponentially large confusion matrix. We demonstrate the scalability and power of this approach by correcting readout errors without matrix inversion on a large number of different preparation states applied to a register of eight superconducting transmon qubits. Moreover, we show that this method can be extended to midcircuit measurements used for active feedback via quasiprobabilistic error cancellation, and we demonstrate the correction of measurement errors on an ancilla qubit used to detect and actively correct bit-flip errors on an entangled memory qubit. Our approach enables the correction of readout errors on large numbers of qubits and offers a strategy for correcting readout errors in adaptive circuits in which the results of midcircuit measurements are used to perform conditional operations on nonlocal qubits in real time.

DOI
10.1103/prxquantum.6.010307

Related papers

Perturbative readout-error mitigation for near-term quantum computers

Evan Peters, Andy C. Y. Li, Gabriel Perdue

Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. These errors can be mitigated by classical postprocessing given the access of an experimental response matrix that describes the error associated with the measurement of each computational basis state. However, the resources required to characterize a complete response matrix and to compute the corrected probability distribution scale exponentially with the number of qubits, $n$. In this work, we modify standard matrix inversion techniques using perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high-order bit-flip events is strongly suppressed. Given a characteristic error rate $q$, we discuss a method to recover the probability of the all-zeros bit string ${p}_{0}$ by sampling only a small subspace of the response matrix before inverting readout error, resulting in a relative speedup of $\text{poly}[{2}^{n}/(\begin{array}{c}n\\ w\end{array})]$, which we motivate using a simplified error model for which the approximation incurs only $O({q}^{w})$ error for some integer $w$. We then provide a generalized technique to efficiently recover full output distributions with $O({q}^{w})$ error in the perturbative limit. These approximate techniques for readout-error correction may greatly accelerate near-term quantum computing applications.

arXiv:2105.08161•Physical Review A•Jun 30, 2023•7 citations

Mitigating errors in state preparation and measurement with noncomputational states

Conrad J. Haupt, Almudena Carrera Vazquez, Laurin E. Fischer +2 more

Error mitigation has enabled quantum computing applications with more than a hundred qubits and deep circuits. Many error mitigation methods are noise-aware, relying on a faithful characterization of the noise channels of the hardware. However, fundamental limitations lead to unlearnable degrees of freedom of the underlying noise models when considering qubits. Here, we show how to leverage noncomputational states as an additional resource to learn state-preparation errors in superconducting qubits. This allows one to fully constrain the noise models. We can thus independently and accurately mitigate state-preparation errors, gate errors, and measurement errors. Our proposed method is also applicable to dynamic circuits with midcircuit measurements. This work opens the door to improved error mitigation for measurements, both at the end of the circuit and midcircuit.

arXiv:2506.09145•Physical Review Applied•Dec 8, 2025•0 citations

Extracting information from noisy quantum systems: Readout-error mitigation and adaptive measurement strategies

Adrian Skasberg Aasen

The field of quantum technologies has experienced explosive growth in the past decade. As hardware capabilities have advanced, quantum computing has exhibited a scaling trend analogous to Moore's law, often referred to as Rose's law, where the number of coherently controlled qubits roughly doubles every two years. Associated with such rapid growth is an equally growing need for benchmarking tools and error handling. While advancements in quantum hardware and software have mainly concentrated on enhancing gate fidelity and qubit connectivity, the progress in addressing readout errors has been relatively limited during the same period. This thesis tries to close this gap by advancing and developing new tools for information extraction in quantum systems. We do this in two different ways: In Part II, we focus on mitigating the effect of general readout errors in quantum systems. We developed a comprehensive protocol for readout-error-mitigated state tomography (REMST) and implemented it on a superconducting qubit system. The REMST protocol was designed to mitigate not only classical readout errors but also more challenging coherent and correlated readout errors. The protocol uses only a deterministic application of single-qubit readout, making it one of the most experimentally friendly approaches available. We developed a scalable version of the REMST protocol and showed numerically that it is suitable for systems with more than 100 qubits, matching the size of current state-of-the-art systems. The REMST protocol was applied to superconducting qubit experiments, where we saw an improvement in reconstruction accuracy by a factor of up to 30. In Part III, we move our focus to optimal measurement strategies. Adaptive measurement strategies promise a quadratic improvement in the statistical fluctuation of pure and close-to-pure state reconstruction by dynamically optimizing measurement settings during sampling. We investigated whether these adaptive measurement strategies were viable in realistic experimental settings. We demonstrated both analytically and in numerical simulations that going from ideal readout to noisy readout disproportionally deteriorates the quality of the adaptive measurement strategy, to a point where no asymptotic benefit exists for adaptive measurements. These results not only deepen our understanding of readout processes in superconducting qubits but also provide concrete implementations of more robust quantum measurement and tomography protocols, offering clearer insight into the interplay between readout noise and information extraction.

•Jan 1, 2026•0 citations

Mitigating measurement errors in multiqubit experiments

Sergey B. Bravyi, Sarah Sheldon, Abhinav Kandala +2 more

Reducing measurement errors in multiqubit quantum devices is critical for performing any quantum algorithm. Here we show how to mitigate measurement errors by a classical postprocessing of the measured outcomes. Our techniques apply to any experiment where measurement outcomes are used for computing expected values of observables. Two error-mitigation schemes are presented based on tensor product and correlated Markovian noise models. Error rates parametrizing these noise models can be extracted from the measurement calibration data using a simple formula. Error mitigation is achieved by applying the inverse noise matrix to a probability vector that represents the outcomes of a noisy measurement. The error-mitigation overhead, including the number of measurements and the cost of the classical postprocessing, is exponential in $\ensuremath{\epsilon}n$, where $\ensuremath{\epsilon}$ is the maximum error rate and $n$ is the number of qubits. We report experimental demonstration of our error-mitigation methods on IBM Quantum devices using stabilizer measurements for graph states with $n\ensuremath{\le}12$ qubits and entangled 20-qubit states generated by low-depth random Clifford circuits.

arXiv:2006.14044•Physical Review A•Apr 9, 2021•335 citations

Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quantum Processor

Akel Hashim, Ravi Naik, Alexis Morvan +11 more

The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error that has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors and therefore do not reliably predict the global performance of quantum algorithms, leaving us unprepared to validate the accuracy of future large-scale quantum computations. Randomized compiling is a protocol designed to overcome these performance limitations by converting coherent errors into stochastic noise, dramatically reducing unpredictable errors in quantum algorithms and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking. In this work, we demonstrate significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor. Additionally, we accurately predict algorithm performance using experimentally measured error rates. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors, paving the way forward for scalable quantum computing.

arXiv:2010.00215•Physical Review X•Nov 24, 2021•156 citations

Learning Midcircuit Measurement Backaction from Three Repeated Measurements

Chia-Tung Chu, Su-un Lee, Han Zheng +4 more

Accurate modeling of midcircuit measurements (MCMs) is essential for dynamic-circuit operations such as syndrome extraction, measurement-based reset, and the separation of state-preparation and measurement error. Unlike terminal measurement, a noisy MCM both produces a classical outcome and alters the incoming quantum state, thereby influencing subsequent circuit operations. This makes conventional confusion-matrix or fidelity-level characterization insufficient. Here, we introduce an efficient, self-consistent protocol for learning a single-qubit Z-twirled MCM instrument, retaining the readout-backaction correlations and excitation-decay asymmetry that are erased in Pauli-error descriptions. Remarkably, readout bit strings from only three repeated MCMs on a maximally mixed input determine all learnable parameters of the reduced instrument, up to a single unidentifiable gauge degree of freedom. Physicality constraints convert this nonidentifiability into narrow, gauge-aware error intervals. Implemented on IBM superconducting processors, the learned instrument improves Pauli-observable prediction by $\sim 100\times$ over a conventional confusion-matrix model and reveals a $T_1$-decay dominated backaction. Our protocol provides a compact characterization layer for state-preparation and measurement error separation, reset optimization, and noise-aware quantum error correction.

quant-pharXiv:2606.00433•Physical Review Letters•Jun 2, 2026•0 citations
Quantum measurements are a fundamental component of quantum computing. However, on present-day quantum computers, measurements can be more error prone than quantum gates and are susceptible to nonunital errors as well as nonlocal correlations due to measurement crosstalk. While readout errors can be mitigated in postprocessing, this is inefficient in the number of qubits due to a combinatorially large number of possible states that need to be characterized. In this work, we show that measurement errors can be tailored into a simple stochastic error model using randomized compiling, enabling the efficient mitigation of readout errors via quasiprobability distributions reconstructed from the measurement of a single preparation state in an exponentially large confusion matrix. We demonstrate the scalability and power of this approach by correcting readout errors without matrix inversion on a large number of different preparation states applied to a register of eight superconducting transmon qubits. Moreover, we show that this method can be extended to midcircuit measurements used for active feedback via quasiprobabilistic error cancellation, and we demonstrate the correction of measurement errors on an ancilla qubit used to detect and actively correct bit-flip errors on an entangled memory qubit. Our approach enables the correction of readout errors on large numbers of qubits and offers a strategy for correcting readout errors in adaptive circuits in which the results of midcircuit measurements are used to perform conditional operations on nonlocal qubits in real time.
Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. These errors can be mitigated by classical postprocessing given the access of an experimental response matrix that describes the error associated with the measurement of each computational basis state. However, the resources required to characterize a complete response matrix and to compute the corrected probability distribution scale exponentially with the number of qubits, nnn. In this work, we modify standard matrix inversion techniques using perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high-order bit-flip events is strongly suppressed. Given a characteristic error rate qqq, we discuss a method to recover the probability of the all-zeros bit string p0{p}_{0}p0​ by sampling only a small subspace of the response matrix before inverting readout error, resulting in a relative speedup of poly[2n/(nw)]\text{poly}[{2}^{n}/(\begin{array}{c}n\\ w\end{array})]poly[2n/(nw​)], which we motivate using a simplified error model for which the approximation incurs only O(qw)O({q}^{w})O(qw) error for some integer www. We then provide a generalized technique to efficiently recover full output distributions with O(qw)O({q}^{w})O(qw) error in the perturbative limit. These approximate techniques for readout-error correction may greatly accelerate near-term quantum computing applications.
Error mitigation has enabled quantum computing applications with more than a hundred qubits and deep circuits. Many error mitigation methods are noise-aware, relying on a faithful characterization of the noise channels of the hardware. However, fundamental limitations lead to unlearnable degrees of freedom of the underlying noise models when considering qubits. Here, we show how to leverage noncomputational states as an additional resource to learn state-preparation errors in superconducting qubits. This allows one to fully constrain the noise models. We can thus independently and accurately mitigate state-preparation errors, gate errors, and measurement errors. Our proposed method is also applicable to dynamic circuits with midcircuit measurements. This work opens the door to improved error mitigation for measurements, both at the end of the circuit and midcircuit.
The field of quantum technologies has experienced explosive growth in the past decade. As hardware capabilities have advanced, quantum computing has exhibited a scaling trend analogous to Moore's law, often referred to as Rose's law, where the number of coherently controlled qubits roughly doubles every two years. Associated with such rapid growth is an equally growing need for benchmarking tools and error handling. While advancements in quantum hardware and software have mainly concentrated on enhancing gate fidelity and qubit connectivity, the progress in addressing readout errors has been relatively limited during the same period. This thesis tries to close this gap by advancing and developing new tools for information extraction in quantum systems. We do this in two different ways: In Part II, we focus on mitigating the effect of general readout errors in quantum systems. We developed a comprehensive protocol for readout-error-mitigated state tomography (REMST) and implemented it on a superconducting qubit system. The REMST protocol was designed to mitigate not only classical readout errors but also more challenging coherent and correlated readout errors. The protocol uses only a deterministic application of single-qubit readout, making it one of the most experimentally friendly approaches available. We developed a scalable version of the REMST protocol and showed numerically that it is suitable for systems with more than 100 qubits, matching the size of current state-of-the-art systems. The REMST protocol was applied to superconducting qubit experiments, where we saw an improvement in reconstruction accuracy by a factor of up to 30. In Part III, we move our focus to optimal measurement strategies. Adaptive measurement strategies promise a quadratic improvement in the statistical fluctuation of pure and close-to-pure state reconstruction by dynamically optimizing measurement settings during sampling. We investigated whether these adaptive measurement strategies were viable in realistic experimental settings. We demonstrated both analytically and in numerical simulations that going from ideal readout to noisy readout disproportionally deteriorates the quality of the adaptive measurement strategy, to a point where no asymptotic benefit exists for adaptive measurements. These results not only deepen our understanding of readout processes in superconducting qubits but also provide concrete implementations of more robust quantum measurement and tomography protocols, offering clearer insight into the interplay between readout noise and information extraction.
Reducing measurement errors in multiqubit quantum devices is critical for performing any quantum algorithm. Here we show how to mitigate measurement errors by a classical postprocessing of the measured outcomes. Our techniques apply to any experiment where measurement outcomes are used for computing expected values of observables. Two error-mitigation schemes are presented based on tensor product and correlated Markovian noise models. Error rates parametrizing these noise models can be extracted from the measurement calibration data using a simple formula. Error mitigation is achieved by applying the inverse noise matrix to a probability vector that represents the outcomes of a noisy measurement. The error-mitigation overhead, including the number of measurements and the cost of the classical postprocessing, is exponential in $\ensuremath{\epsilon}n$, where $\ensuremath{\epsilon}$ is the maximum error rate and nnn is the number of qubits. We report experimental demonstration of our error-mitigation methods on IBM Quantum devices using stabilizer measurements for graph states with $n\ensuremath{\le}12$ qubits and entangled 20-qubit states generated by low-depth random Clifford circuits.
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error that has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors and therefore do not reliably predict the global performance of quantum algorithms, leaving us unprepared to validate the accuracy of future large-scale quantum computations. Randomized compiling is a protocol designed to overcome these performance limitations by converting coherent errors into stochastic noise, dramatically reducing unpredictable errors in quantum algorithms and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking. In this work, we demonstrate significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor. Additionally, we accurately predict algorithm performance using experimentally measured error rates. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors, paving the way forward for scalable quantum computing.
Accurate modeling of midcircuit measurements (MCMs) is essential for dynamic-circuit operations such as syndrome extraction, measurement-based reset, and the separation of state-preparation and measurement error. Unlike terminal measurement, a noisy MCM both produces a classical outcome and alters the incoming quantum state, thereby influencing subsequent circuit operations. This makes conventional confusion-matrix or fidelity-level characterization insufficient. Here, we introduce an efficient, self-consistent protocol for learning a single-qubit Z-twirled MCM instrument, retaining the readout-backaction correlations and excitation-decay asymmetry that are erased in Pauli-error descriptions. Remarkably, readout bit strings from only three repeated MCMs on a maximally mixed input determine all learnable parameters of the reduced instrument, up to a single unidentifiable gauge degree of freedom. Physicality constraints convert this nonidentifiability into narrow, gauge-aware error intervals. Implemented on IBM superconducting processors, the learned instrument improves Pauli-observable prediction by ∼100×\sim 100\times∼100× over a conventional confusion-matrix model and reveals a T1T_1T1​-decay dominated backaction. Our protocol provides a compact characterization layer for state-preparation and measurement error separation, reset optimization, and noise-aware quantum error correction.