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

Reviews of Modern Physics

Error Bounds for Expectation Values

Norman W. Bazley, David W. Fox

Published Jul 1, 1963• 50 citations
Publisher
DOI
10.1103/revmodphys.35.712

Related papers

Upper and Lower Bounds to Expectation Values

Alexander Mazziotti, Robert G. Parr

The Journal of Chemical Physics•Feb 1, 1970•23 citations

Discussion on Upper and Lower Bounds for Expectation Values

A. Weinstein

Reviews of Modern Physics•Jul 1, 1963•1 citation

Enhancing Quantum Expectation Values Via Exponential Error Suppression and CVaR Optimization

Touheed Anwar Atif, Reuben Tate, Stephan Eidenbenz

Precise quantum expectation values are crucial for quantum algorithm development, but noise in real-world systems can degrade these estimations. While quantum error correction is resource-intensive, error mitigation strategies offer a practical alternative. This paper presents a framework that combines Virtual Channel Purification (VCP) technique with Conditional Value-at-Risk (CVaR) optimization to improve expectation value estimations in noisy quantum circuits. Our contributions are twofold: first, we derive conditions to compare CVaR values from different probability distributions, offering insights into the reliability of quantum estimations under noise. Second, we apply this framework to VCP, providing analytical bounds that establish its effectiveness in improving expectation values, both when the overhead VCP circuit is ideal (error-free) and when it adds additional noise. By introducing CVaR into the analysis of VCP, we offer a general noise-characterization method that guarantees improved expectation values for any quantum observable. We demonstrate the practical utility of our approach with numerical examples, highlighting how our bounds guide VCP implementation in noisy quantum systems.

arXiv:2501.18513•IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•0 citations

Model-free readout-error mitigation for quantum expectation values

E. van den Berg, Zlatko Minev, Kristan Temme

Measurements on current quantum processors are subject to hardware imperfections that lead to readout errors. These errors manifest themselves as a bias in quantum expectation values. Here, we consider a very simple method that forces the bias in the expectation value to appear as a multiplicative factor that can be measured directly and removed at the cost of an increase in the sampling complexity for the observable. This method was previously discussed by Karalekas et al. [Quantum Sci. Technol. 5, 024003 (2020)] for the product of single-qubit readout-error models. Here, we formally analyze the method and show that it can be applied to general noise models. In particular, we show the method does not need to assume any specific form of the noise model and requires only that the noise is ``weak'' to avoid excessive sampling overhead. We prove bounds relating the error in the expectation value to the sample complexity.

arXiv:2012.09738•Physical Review A•Mar 30, 2022•220 citations

On a formula for expectation values

T. S. Shankara

Lettere al nuovo cimento della societa italiana di fisica/Lettere al nuovo cimento•Nov 1, 1970•1 citation

Quantum Multiple Hypothesis Testing Based on a Sequential Discarding Scheme

Jordi Pérez-Guijarro, Alba Pagés-Zamora, J.R. Fonollosa

We consider the quantum multiple hypothesis testing problem, focusing on the case of hypothesis represented by pure states. A sequential adaptive algorithm is derived and analyzed first. This strategy exhibits a decay rate in the error probability with respect to the expected value of measurements greater than the optimal decay rate of the fixed-length methods. A more elaborated scheme is developed next, by serially concatenating multiple implementations of the first scheme. In this case each stage considers asa priorihypothesis probability thea posterioriprobability of the previous stage. We show that, by means of a fixed number of concatenations, the expected value of measurements to be performed decreases considerably. We also analyze one strategy based on an asymptotically large concatenation of the initial scheme, demonstrating that the expected number of measurements in this case is upper bounded by a constant, even in the case of zero average error probability. A lower bound for the expected number of measurements in the zero error probability setting is also derived.

IEEE Access•Jan 1, 2022•1 citation
Precise quantum expectation values are crucial for quantum algorithm development, but noise in real-world systems can degrade these estimations. While quantum error correction is resource-intensive, error mitigation strategies offer a practical alternative. This paper presents a framework that combines Virtual Channel Purification (VCP) technique with Conditional Value-at-Risk (CVaR) optimization to improve expectation value estimations in noisy quantum circuits. Our contributions are twofold: first, we derive conditions to compare CVaR values from different probability distributions, offering insights into the reliability of quantum estimations under noise. Second, we apply this framework to VCP, providing analytical bounds that establish its effectiveness in improving expectation values, both when the overhead VCP circuit is ideal (error-free) and when it adds additional noise. By introducing CVaR into the analysis of VCP, we offer a general noise-characterization method that guarantees improved expectation values for any quantum observable. We demonstrate the practical utility of our approach with numerical examples, highlighting how our bounds guide VCP implementation in noisy quantum systems.
Measurements on current quantum processors are subject to hardware imperfections that lead to readout errors. These errors manifest themselves as a bias in quantum expectation values. Here, we consider a very simple method that forces the bias in the expectation value to appear as a multiplicative factor that can be measured directly and removed at the cost of an increase in the sampling complexity for the observable. This method was previously discussed by Karalekas et al. [Quantum Sci. Technol. 5, 024003 (2020)] for the product of single-qubit readout-error models. Here, we formally analyze the method and show that it can be applied to general noise models. In particular, we show the method does not need to assume any specific form of the noise model and requires only that the noise is ``weak'' to avoid excessive sampling overhead. We prove bounds relating the error in the expectation value to the sample complexity.
We consider the quantum multiple hypothesis testing problem, focusing on the case of hypothesis represented by pure states. A sequential adaptive algorithm is derived and analyzed first. This strategy exhibits a decay rate in the error probability with respect to the expected value of measurements greater than the optimal decay rate of the fixed-length methods. A more elaborated scheme is developed next, by serially concatenating multiple implementations of the first scheme. In this case each stage considers asa priorihypothesis probability thea posterioriprobability of the previous stage. We show that, by means of a fixed number of concatenations, the expected value of measurements to be performed decreases considerably. We also analyze one strategy based on an asymptotically large concatenation of the initial scheme, demonstrating that the expected number of measurements in this case is upper bounded by a constant, even in the case of zero average error probability. A lower bound for the expected number of measurements in the zero error probability setting is also derived.