Enhancing Quantum Expectation Values via Exponential Error Suppression and CVaR Optimization

• URL: http://arxiv.org/abs/2501.18513v1
• Date: Thu, 30 Jan 2025 17:24:01 GMT
• Title: Enhancing Quantum Expectation Values via Exponential Error Suppression and CVaR Optimization
• Abstract summary: This paper presents a framework that combines Virtual Channel Purification (VCP) technique with Conditional Value-at-Risk (CVaR) optimization to improve expectation value estimations.<n>Our contributions are twofold: first, we derive conditions to compare CVaR values from different probability, offering insights into the reliability of quantum estimations under noise.
• Score: 2.526146573337397
• License: http://creativecommons.org/licenses/by/4.0/
• 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 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.

Related papers

• Quantum Codes for Generalized Amplitude-damping Noise [2.7568215535428937]
  Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing.<n>One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise.<n>Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength.<n>We introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-
  arXiv  Detail & Related papers  (2026-09-14T17:33:41Z)
• Efficient expectation value estimation for quantum circuits via extended stabilizer frameworks and adaptive variance estimation [8.759476252485507]
  We introduce an efficient simulation framework that integrates the sum-over-Clifford method with quasi-probability-based stabilizer simulation.<n>To optimize efficiency, we incorporate a circuit-adaptive reduction via variance estimation protocol.<n>We explicitly prove the sample-complexity reduction for random quantum circuits and T-doped Clifford circuits.
  arXiv  Detail & Related papers  (2026-09-13T03:08:19Z)
• Orders of magnitude runtime reduction in quantum error mitigation [0.0]
  We introduce a mitigation framework that combines virtual noise scaling with a layered mitigation architecture.<n>The proposed approach is compatible with dynamic circuits and can be seamlessly integrated with error detection and quantum error correction schemes.
  arXiv  Detail & Related papers  (2026-01-30T10:07:31Z)
• Error-mitigation aware benchmarking strategy for quantum optimization problems [3.026585988755882]
  entropy benchmarking does not account for finite-shot effects or for quantum error mitigation.<n>We develop a benchmarking framework that explicitly incorporates finite-shot statistics and the resource overhead induced by QEM.<n>Our framework quantifies quantum advantage through the confidence that an estimated energy lies within an interval defined by the best-known classical upper and lower bounds.
  arXiv  Detail & Related papers  (2026-01-26T16:55:47Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Variational noise mitigation in quantum circuits: the case of Quantum Fourier Transform [35.18016233072556]
  We perform numerical simulations for two qubits under both coherent and incoherent noise.<n>Our results show that the variational circuit can reproduce the QFT with higher fidelity in scenarios dominated by coherent noise.<n>This demonstrates the potential of the approach as an effective error-mitigation strategy for small- to medium-scale quantum systems.
  arXiv  Detail & Related papers  (2025-11-07T14:35:55Z)
• Exploiting biased noise in variational quantum models [0.0]
  Variational quantum algorithms (VQAs) are promising tools for demonstrating quantum utility on near-term quantum hardware.<n>We study the effect of quantum noise on the classical optimisation process.<n>We find that twirling, which is commonly used in standard error-mitigation strategies to symmetrise noise, actually degrades performance in the variational setting.
  arXiv  Detail & Related papers  (2025-10-28T04:14:20Z)
• Classical Noise Inversion: A Practical and Optimal framework for Robust Quantum Applications [5.425954380993698]
  Quantum error mitigation is a critical technology for extracting reliable computations from noisy quantum processors.<n>It is hampered by the expansive cost of sampling from quantum circuits and the reliance on unrealistic assumptions, such as gate-independent noise.<n>Here, we introduce Classical Noise Inversion (CNI), a framework that fundamentally bypasses these crucial limitations and is well-suited for various quantum applications.
  arXiv  Detail & Related papers  (2025-10-23T15:59:04Z)
• TensoMeta-VQC: A Tensor-Train-Guided Meta-Learning Framework for Robust and Scalable Variational Quantum Computing [60.996803677584424]
  TensoMeta-VQC is a novel tensor-train (TT)-guided meta-learning framework designed to improve the robustness and scalability of VQC significantly.<n>Our framework fully delegates the generation of quantum circuit parameters to a classical TT network, effectively decoupling optimization from quantum hardware.
  arXiv  Detail & Related papers  (2025-08-01T23:37:55Z)
• Resource-Efficient Hadamard Test Circuits for Nonlinear Dynamics on a Trapped-Ion Quantum Computer [1.2063443893298391]
  We propose a low-depth implementation of a class of Hadamard test circuits.<n>We develop a parameterized quantum ansatz specifically tailored for variational algorithms.<n>Our findings demonstrate a significant reduction in single- and two-qubit gate counts.
  arXiv  Detail & Related papers  (2025-07-25T13:16:54Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Noise-Robust Estimation of Quantum Observables in Noisy Hardware [0.0]
  Noise-Robust Estimation is a noise-agnostic framework that systematically reduces estimation bias. NRE exploits a bias-dispersion correlation uncovered in this work. We experimentally validate NRE on an IQM superconducting quantum processor.
  arXiv  Detail & Related papers  (2025-03-09T17:18:16Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation.<n>We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Quantifying the advantages of applying quantum approximate algorithms to portfolio optimisation [0.0]
  We present an end-to-end quantum approximate optimisation algorithm (QAOA) to solve the discrete global minimum variance portfolio model. This model finds a portfolio of risky assets with the lowest possible risk contingent on the number of traded assets being discrete.
  arXiv  Detail & Related papers  (2024-10-21T17:59:05Z)
• Optimal Quantum Purity Amplification [2.05170973574812]
  Quantum purity amplification (QPA) offers a novel approach to counteract the pervasive noise that degrades quantum states. We present the optimal QPA protocol for general quantum systems against global depolarizing noise. Our findings suggest that QPA could improve the performance of quantum information processing tasks.
  arXiv  Detail & Related papers  (2024-09-26T17:46:00Z)
• Distributionally Robust Variational Quantum Algorithms with Shifted Noise [9.705847892362165]
  We show how to optimize variational quantum algorithms (VQAs) to be robust against unknown shifted noise. This work is the first step towards improving the reliability of VQAs influenced by shifted noise.
  arXiv  Detail & Related papers  (2023-08-28T23:19:57Z)
• Adaptive mitigation of time-varying quantum noise [0.1227734309612871]
  Current quantum computers suffer from non-stationary noise channels with high error rates. We propose a Bayesian inference-based adaptive algorithm that can learn and mitigate quantum noise in response to changing channel conditions.
  arXiv  Detail & Related papers  (2023-08-16T01:33:07Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Robust and Adaptive Temporal-Difference Learning Using An Ensemble of Gaussian Processes [70.80716221080118]
  The paper takes a generative perspective on policy evaluation via temporal-difference (TD) learning. The OS-GPTD approach is developed to estimate the value function for a given policy by observing a sequence of state-reward pairs. To alleviate the limited expressiveness associated with a single fixed kernel, a weighted ensemble (E) of GP priors is employed to yield an alternative scheme.
  arXiv  Detail & Related papers  (2021-12-01T23:15:09Z)
• High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise [51.31435087414348]
  It is essential to theoretically guarantee that algorithms provide small objective residual with high probability. Existing methods for non-smooth convex optimization have complexity bounds with dependence on confidence level. We propose novel stepsize rules for two methods with gradient clipping.
  arXiv  Detail & Related papers  (2021-06-10T17:54:21Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Evaluating probabilistic classifiers: Reliability diagrams and score decompositions revisited [68.8204255655161]
  We introduce the CORP approach, which generates provably statistically Consistent, Optimally binned, and Reproducible reliability diagrams in an automated way. Corpor is based on non-parametric isotonic regression and implemented via the Pool-adjacent-violators (PAV) algorithm.
  arXiv  Detail & Related papers  (2020-08-07T08:22:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.