Enhancing Quantum Expectation Values via Exponential Error Suppression and CVaR Optimization
Touheed Anwar Atif, Reuben Blake Tate, Stephan Eidenbenz

TL;DR
This paper introduces a combined framework of Virtual Channel Purification and CVaR optimization to enhance the accuracy of quantum expectation values in noisy systems, providing analytical bounds and practical guidance.
Contribution
It develops conditions for comparing CVaR values from different distributions and applies these to VCP, establishing bounds that improve expectation value estimations under noise.
Findings
CVaR comparison conditions for quantum estimations
Analytical bounds for VCP effectiveness in noisy environments
Numerical examples demonstrating improved expectation values
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
