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:2306.04351 · Physical Review A

Error mitigation of BQP computations using measurement-based verification

Joseph P. Harris, Elham Kashefi

Published Feb 4, 2025• 5 citations
arXivHTMLPDF

Abstract

We present a modular error mitigation protocol for running bounded-error quantum polynomial time (BQP) computations on a quantum computer with time-dependent noise. Utilizing existing tools from quantum verification and measurement-based quantum computation, our protocol interleaves standard computation rounds alongside test rounds for noise sampling and inherits an exponential bound (in the number of circuit runs) on the probability that a returned classical output is correct. We introduce a postselection technique called to address time-dependent noise and reduce overhead. The result is an error mitigation protocol which requires minimal noise assumptions, making it straightforwardly implementable on existing, noisy intermediate-scale quantum devices. We perform a demonstration of the protocol using classical noisy simulation, presenting a universal measurement pattern which directly maps to (and can be tiled on) the heavy-hex layout of current IBM hardware.

DOI
10.1103/physreva.111.022602

Related papers

Mitigating errors by quantum verification and postselection

Rawad Mezher, James K. Mills, Elham Kashefi

Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing demonstration of quantum advantage. Indeed, in many cases it has been shown that noise renders quantum circuits efficiently classically simulable, thereby destroying any quantum advantage potentially offered by an ideal (noiseless) implementation of these circuits. Although the technique of quantum error correction (QEC) allows correcting these errors very accurately, QEC usually requires a large overhead of physical qubits which is not reachable with currently available quantum hardware. This has been the motivation behind the field of quantum error mitigation, which aims at developing techniques to correct an important part of the errors in quantum circuits, while also being compatible with current and near-term quantum hardware. In this work, we present a technique for quantum error mitigation which is based on a technique from quantum verification, the so-called accreditation protocol, together with postselection. Our technique allows for correcting the expectation value of an observable $O$, which is the output of multiple runs of noisy quantum circuits, where the noise in these circuits is at the level of preparations, gates, and measurements. We discuss the sample complexity of our procedure and provide rigorous guarantees of errors being mitigated under some realistic assumptions on the noise. Our technique is tailored to time-dependent behaviors, as we allow for the output states to be different between different runs of the accreditation protocol. We validate our findings by running our technique on currently available quantum hardware.

arXiv:2109.14329•Physical Review A•May 27, 2022•14 citations

Classical Noise Inversion for Error-Propagatable Circuits with Minimal Overhead under General Gate-Dependent Noise

Dayue Qin, Li, Ying, You Zhou

Quantum error mitigation (QEM) is critical for extracting reliable computations from noisy quantum processors, proving itself essential not only in the near term but also as a valuable supplement to fully fault-tolerant systems in the future. Despite the necessity, practical QEM deployment still confronts challenges, including the excessive cost of sampling quantum circuits and reliance on unrealistic assumptions such as gate-independent noise. In this paper, we propose Classical Noise Inversion (CNI), which shifts the QEM from sampling diverse quantum circuits to repeated single-circuit measurement, a drastic cost reduction given that the former incurs far heavier time overhead than the latter on realistic quantum hardware. We target general noise models and establish critical conditions for their classical tractability, under which CNI remains effective. For noise models that violate the condition, we propose partial CNI, which mitigates the classically tractable factor of noise via CNI and mitigates the other part via probabilistic error cancellation tailored to gate-dependent noise. To minimize the sampling overhead, we introduce noise compression, which groups noise components with equivalent effects on measurement outcomes, thereby attaining theoretically optimal error-mitigation overhead. The proposed protocols are particularly efficient for error-propagatable circuits, including adaptive universal quantum computing represented by Clifford+T fault-tolerant circuits, and generalized measurement represented by classical shadows. To demonstrate the practical merits of CNI, we integrate it with thrifty classical shadow, and use analysis and numerical simulations to show its advantages in both efficiency and accuracy over existing approaches.

arXiv:2510.20686•Oct 23, 2025•2 citations

Verifying BQP Computations on Noisy Devices with Minimal Overhead

Dominik Leichtle, Luka Music, Elham Kashefi +1 more

With the development of delegated quantum computation, clients will want to ensure confidentiality of their data and algorithms and the integrity of their computations.While protocols for blind and verifiable quantum computation exist, they suffer from high overheads and from oversensitivity: when running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations.We introduce the first blind and verifiable protocol for delegating bounded-error quantum polynomial (BQP) computations to a powerful server, with repetition as the only overhead.It is composable and statistically secure with exponentially low bounds and can tolerate a constant amount of global noise.

arXiv:2109.04042•PRX Quantum•Oct 4, 2021•53 citations

Efficiently improving the performance of noisy quantum computers

Samuele Ferracin, Akel Hashim, Jean-Loup Ville +7 more

Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named ``Noiseless Output Extrapolation" and ``Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to 86% improvement in variation distance over the unmitigated outputs. Our experiments demonstrate the effectiveness of our protocols, as well as their practicality for current hardware platforms.

arXiv:2201.10672•Quantum•Jul 15, 2024•72 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•402 citations

Reducing Quantum Error Mitigation Bias Using Verifiable Benchmark Circuits

Joseph Harris, Kevin Lively, Peter Schuhmacher

We present a simple, malleable and low-overhead approach for improving generic biased quantum error mitigation (QEM) methods, achieving up to 15% fidelity improvements over standard QEM on 100-qubit circuits with up to 2000 entangling gates. We do so by constructing verifiable benchmark circuits which mirror the application circuit's native-gate structure and thus noise profile. These circuits can be used to benchmark and mitigate the bias of the underlying error mitigation method, requiring only the application circuit and hardware native gate set. We present two methods for generating benchmark circuits; one is agnostic to the target hardware at the expense of a small overhead of single-qubit gates, while the other is specific to the IBM superconducting hardware and has no gate overhead. As a corollary, we introduce benchmarked-noise zero-noise extrapolation (bnZNE) as a simple adaptation of zero-noise extrapolation (ZNE), one of the most popular error mitigation methods. We consider as an example the bias-mitigated ZNE and bnZNE of Trotterized Hamiltonian simulations, observing that our approaches outperform standard ZNE using both small-scale classical simulations and 100-qubit utility-scale experiments on the IBM superconducting hardware. We consider the measurement of both single-site observables as well as two-site correlations along a one-dimensional qubit chain. We also provide a software package for implementing the error mitigation techniques used in this research.

quant-pharXiv:2603.10224•Mar 12, 2026•1 citation
We present a modular error mitigation protocol for running bounded-error quantum polynomial time (BQP) computations on a quantum computer with time-dependent noise. Utilizing existing tools from quantum verification and measurement-based quantum computation, our protocol interleaves standard computation rounds alongside test rounds for noise sampling and inherits an exponential bound (in the number of circuit runs) on the probability that a returned classical output is correct. We introduce a postselection technique called to address time-dependent noise and reduce overhead. The result is an error mitigation protocol which requires minimal noise assumptions, making it straightforwardly implementable on existing, noisy intermediate-scale quantum devices. We perform a demonstration of the protocol using classical noisy simulation, presenting a universal measurement pattern which directly maps to (and can be tiled on) the heavy-hex layout of current IBM hardware.
Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing demonstration of quantum advantage. Indeed, in many cases it has been shown that noise renders quantum circuits efficiently classically simulable, thereby destroying any quantum advantage potentially offered by an ideal (noiseless) implementation of these circuits. Although the technique of quantum error correction (QEC) allows correcting these errors very accurately, QEC usually requires a large overhead of physical qubits which is not reachable with currently available quantum hardware. This has been the motivation behind the field of quantum error mitigation, which aims at developing techniques to correct an important part of the errors in quantum circuits, while also being compatible with current and near-term quantum hardware. In this work, we present a technique for quantum error mitigation which is based on a technique from quantum verification, the so-called accreditation protocol, together with postselection. Our technique allows for correcting the expectation value of an observable OOO, which is the output of multiple runs of noisy quantum circuits, where the noise in these circuits is at the level of preparations, gates, and measurements. We discuss the sample complexity of our procedure and provide rigorous guarantees of errors being mitigated under some realistic assumptions on the noise. Our technique is tailored to time-dependent behaviors, as we allow for the output states to be different between different runs of the accreditation protocol. We validate our findings by running our technique on currently available quantum hardware.
Quantum error mitigation (QEM) is critical for extracting reliable computations from noisy quantum processors, proving itself essential not only in the near term but also as a valuable supplement to fully fault-tolerant systems in the future. Despite the necessity, practical QEM deployment still confronts challenges, including the excessive cost of sampling quantum circuits and reliance on unrealistic assumptions such as gate-independent noise. In this paper, we propose Classical Noise Inversion (CNI), which shifts the QEM from sampling diverse quantum circuits to repeated single-circuit measurement, a drastic cost reduction given that the former incurs far heavier time overhead than the latter on realistic quantum hardware. We target general noise models and establish critical conditions for their classical tractability, under which CNI remains effective. For noise models that violate the condition, we propose partial CNI, which mitigates the classically tractable factor of noise via CNI and mitigates the other part via probabilistic error cancellation tailored to gate-dependent noise. To minimize the sampling overhead, we introduce noise compression, which groups noise components with equivalent effects on measurement outcomes, thereby attaining theoretically optimal error-mitigation overhead. The proposed protocols are particularly efficient for error-propagatable circuits, including adaptive universal quantum computing represented by Clifford+T fault-tolerant circuits, and generalized measurement represented by classical shadows. To demonstrate the practical merits of CNI, we integrate it with thrifty classical shadow, and use analysis and numerical simulations to show its advantages in both efficiency and accuracy over existing approaches.
With the development of delegated quantum computation, clients will want to ensure confidentiality of their data and algorithms and the integrity of their computations.While protocols for blind and verifiable quantum computation exist, they suffer from high overheads and from oversensitivity: when running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations.We introduce the first blind and verifiable protocol for delegating bounded-error quantum polynomial (BQP) computations to a powerful server, with repetition as the only overhead.It is composable and statistically secure with exponentially low bounds and can tolerate a constant amount of global noise.
Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named ``Noiseless Output Extrapolation" and ``Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to 86% improvement in variation distance over the unmitigated outputs. Our experiments demonstrate the effectiveness of our protocols, as well as their practicality for current hardware platforms.
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.
We present a simple, malleable and low-overhead approach for improving generic biased quantum error mitigation (QEM) methods, achieving up to 15% fidelity improvements over standard QEM on 100-qubit circuits with up to 2000 entangling gates. We do so by constructing verifiable benchmark circuits which mirror the application circuit's native-gate structure and thus noise profile. These circuits can be used to benchmark and mitigate the bias of the underlying error mitigation method, requiring only the application circuit and hardware native gate set. We present two methods for generating benchmark circuits; one is agnostic to the target hardware at the expense of a small overhead of single-qubit gates, while the other is specific to the IBM superconducting hardware and has no gate overhead. As a corollary, we introduce benchmarked-noise zero-noise extrapolation (bnZNE) as a simple adaptation of zero-noise extrapolation (ZNE), one of the most popular error mitigation methods. We consider as an example the bias-mitigated ZNE and bnZNE of Trotterized Hamiltonian simulations, observing that our approaches outperform standard ZNE using both small-scale classical simulations and 100-qubit utility-scale experiments on the IBM superconducting hardware. We consider the measurement of both single-site observables as well as two-site correlations along a one-dimensional qubit chain. We also provide a software package for implementing the error mitigation techniques used in this research.