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:2611.10524

Delta-Corrected Shot Reduction for Bypassing Optimization Plateaus in Variational Quantum Eigensolvers

Jamie Evander Ghozaly, Pekik Nurwantoro, Gagus Ketut Sunnardianto, Yanoar Pribadi Sarwono, L. C. Kwek

Published Nov 7, 2026• 0 citations
arXivHTMLPDF

Abstract

The variational quantum eigensolver (VQE) remains a cornerstone hybrid quantum-classical algorithm for quantum simulation, yet its scalability is fundamentally constrained by heavy measurement overheads. While strategies such as variance-preserved shot reduction (VPSR) mitigates this cost, they suffer from convergence instability and optimization stagnation caused by finite-sample bias in limited pilot shots. To overcome this limitation, we introduce delta-corrected shot reduction (DCSR), an analytically enhanced shot allocation strategy that rigorously mitigates finite-sample instability. Utilizing the multivariate delta method, we derive explicit higher-order bias correction terms for the empirical reduction factor. Both theoretical analysis and numerical simulations reveal that incorporating higher-order statistical moments, such as skewness and kurtosis, provides the gradient resolution necessary to bypass noise-induced barren plateaus. DSCR significantly accelerates convergence compared to standard VPSR across diverse noise and resource regimes while matching or decreasing cumulative measurement costs, establishing a mathematically rigorous framework for variance-stabilized shot allocation on near-term hardware.

DOI
10.48550/arxiv.2611.10524

Related papers

Optimizing Shot Assignment in Variational Quantum Eigensolver Measurement

Linghua Zhu, Senwei Liang, Chao Yang +1 more

Variational quantum eigensolvers (VQEs) show promise for tackling complex quantum chemistry challenges and realizing quantum advantages. However, in VQE, the measurement step encounters difficulties due to errors in objective function evaluation, e.g., the energy of a quantum state. While increasing the number of measurement shots can mitigate measurement errors, this approach leads to higher costs. Strategies for shot assignment have been investigated, allowing for the allocation of varying shot numbers to different Hamiltonian terms and reducing measurement variance through term-specific insights. In this paper, we introduce a dynamic approach, the Variance-Preserved Shot Reduction (VPSR) method. This technique strives to minimize the total number of measurement shots while preserving the variance of measurements throughout the VQE process. Our numerical experiments on H 2 and LiH molecular ground states demonstrate the effectiveness of VPSR in achieving VQE convergence with a notably lower shot count.

arXiv:2307.06504•Journal of Chemical Theory and Computation•Mar 14, 2024•28 citations

Reliable Optimization Under Noise in Quantum Variational Algorithms

Vojtěch Novák, Silvie Illésová, Tomáš Bezděk +2 more

The optimization of Variational Quantum Eigensolver is severely challenged by finite-shot sampling noise, which distorts the cost landscape, creates false variational minima, and induces statistical bias called winner's curse. We investigate this phenomenon by benchmarking eight classical optimizers spanning gradient-based, gradient-free, and metaheuristic methods on quantum chemistry Hamiltonians H$_2$, H$_4$ chain, LiH (in both full and active spaces) using the truncated Variational Hamiltonian Ansatz. We analyze difficulties of gradient-based methods (e.g., SLSQP, BFGS) in noisy regimes, where they diverge or stagnate. We show that the bias of estimator can be corrected by tracking the \textit{population mean}, rather than the biased best individual when using population based optimizer. Our findings, which are shown to generalize to hardware-efficient circuits and condensed matter models, identify adaptive metaheuristics (specifically CMA-ES and iL-SHADE) as the most effective and resilient strategies. We conclude by presenting a set of practical guidelines for reliable VQE optimization under noise, centering on the co-design of physically motivated ansatz and the use of adaptive optimizers.

quant-pharXiv:2511.08289•Nov 12, 2025•13 citations

Measurement cost reduction in ADAPT-VQE via variance-based shot allocation and Pauli-measurement reuse

Azhar Ikhtiarudin, Gagus Ketut Sunnardianto, Fadjar Fathurrahman +2 more

Abstract The adaptive variational quantum eigensolver (ADAPT-VQE) is a promising approach for quantum simulation in the noisy intermediate-scale quantum era, offering advantages over traditional VQE methods by reducing circuit depth and mitigating challenges in classical optimisation. Although ADAPT-VQE can require fewer total measurements than fixed ansätze for matched precision, the combined cost of repeated energy and gradient evaluations still leads to a substantial measurement overhead in practice, motivating strategies to reduce it further. In this work, we study two complementary strategies to reduce this cost using only standard projective Pauli measurements. First, we apply variance-based shot allocation (variance-minimised shot assignment and variance-preserved shot reduction (VPSR)) to both Hamiltonian energy and operator-gradient measurements, extending techniques previously studied only for energy estimation in standard VQE. VPSR achieves shot reductions of up to 43% for H 2 and 51% for LiH relative to uniform allocation while maintaining chemical accuracy. Second, we introduce a Pauli-measurement reuse protocol that stores outcomes from VQE optimisation and reuses them for gradient evaluation in the next ADAPT iteration. Across six molecular benchmarks (4–14 qubits), measurement reuse yields only marginal savings confined to the smallest systems and is effectively negligible for larger sizes, pivot-based grouping alone provides the dominant reduction and should be considered the practical baseline. These results characterise the interplay between shot allocation, measurement grouping, and cross-iteration reuse, offering practical guidance on when each strategy is most beneficial.

arXiv:2507.16879•Physica Scripta•Jun 5, 2026•10 citations

From Barren Plateaus to SPSA Optimization in Variational Quantum Eigensolvers

Zhen Qin

The barren plateau (BP) phenomenon poses a fundamental challenge to the trainability of variational quantum eigensolvers (VQEs) by causing exponentially vanishing gradients as the system size increases. While extensive studies have investigated the geometric origins of BP, its impact on the optimization dynamics and complexity of practical algorithms under finite-shot measurements has received comparatively less attention. In this paper, we develop a theoretical framework that characterizes how the BP affects the optimization dynamics of the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm and quantifies the resulting iteration complexity and measurement budget. We derive non-asymptotic bias and variance bounds for the SPSA gradient estimator, introduce a signal-to-noise ratio (SNR) defined as the ratio of the gradient energy to the mean squared error of the estimator, and establish convergence guarantees for SPSA under finite-shot measurements. Our results show that, under the proposed parameter schedules, the number of iterations sufficient to guarantee a fixed relative first-order stationarity level scales polynomially with the inverse of the intrinsic gradient energy. Consequently, when this energy decays exponentially under BP, the resulting guaranteed iteration complexity and total measurement budget both grow exponentially with the number of qubits.

quant-pharXiv:2608.09810•Aug 11, 2026•0 citations

Energy landscape plummeting in variational quantum eigensolver: Subspace optimization, non-iterative corrections, and generator-informed initialization for improved quantum efficiency

Chayan Patra, Rahul Maitra

Variational Quantum Eigensolver (VQE) faces significant challenges due to hardware noise and the presence of barren plateaus and local traps in the optimization landscape. To mitigate the detrimental effects of these issues, we introduce a general formalism that optimizes hardware resource utilization and accuracy by projecting VQE optimizations onto a reduced-dimensional subspace, followed by a set of posteriori corrections. Our method partitions the ansatz into a lower dimensional principal subspace and a higher-dimensional auxiliary subspace based on a conjecture of temporal hierarchy present among the parameters during optimization. The adiabatic approximation exploits this hierarchy, restricting optimization to the lower dimensional principal subspace only. This is followed by an efficient higher dimensional auxiliary space reconstruction without the need to perform variational optimization. These reconstructed auxiliary parameters are subsequently included in the cost-function via a set of auxiliary subspace corrections (ASC), leading to a "plummeting effect" in the energy landscape toward a more optimal minimum without utilizing any additional quantum hardware resources. Numerical simulations show that, when integrated with any chemistry-inspired ansatz, our method can provide one to two orders of magnitude better estimation of the minima. In addition, based on the adiabatic approximation, we introduce a novel initialization strategy driven by unitary rotation generators for accelerated convergence of gradient-informed dynamic quantum algorithms. Our method shows heuristic evidence of alleviating the effects of local traps, facilitating convergence toward a more optimal minimum.

arXiv:2504.13097•The Journal of Chemical Physics•Jul 9, 2025•7 citations

Classical Regularization in Variational Quantum Eigensolvers

Yury Chernyak, Ijaz Ahamed Mohammad, Martin Plesch

While quantum computers are a very promising tool for the far future, in their current state of the art they remain limited both in size and quality. This has given rise to hybrid quantum-classical algorithms, where the quantum device performs only a small but vital part of the overall computation. Among these, variational quantum algorithms (VQAs), which combine a classical optimization procedure with quantum evaluation of a cost function, have emerged as particularly promising. However, barren plateaus and ill-conditioned optimization landscapes remain among the primary obstacles faced by VQAs, often leading to unstable convergence and high sensitivity to initialization. Motivated by this challenge, we investigate whether a purely classical remedy, standard L2 squared-norm regularization, can systematically stabilize hybrid quantum-classical optimization. Specifically, we augment the Variational Quantum Eigensolver (VQE) objective with a quadratic penalty proportional to the squared norm of the parameters, without modifying the quantum circuit or measurement process. Across all tested Hamiltonians, H2, LiH, and the Random Field Ising Model (RFIM), we observe improved performance over a broad window of the regularization strength. Our large-scale numerical results demonstrate that classical regularization provides a robust, system-independent mechanism for mitigating VQE instability, enhancing the reliability and reproducibility of variational quantum optimization without altering the underlying quantum circuit.

quant-pharXiv:2601.16679•Jan 26, 2026•0 citations
The variational quantum eigensolver (VQE) remains a cornerstone hybrid quantum-classical algorithm for quantum simulation, yet its scalability is fundamentally constrained by heavy measurement overheads. While strategies such as variance-preserved shot reduction (VPSR) mitigates this cost, they suffer from convergence instability and optimization stagnation caused by finite-sample bias in limited pilot shots. To overcome this limitation, we introduce delta-corrected shot reduction (DCSR), an analytically enhanced shot allocation strategy that rigorously mitigates finite-sample instability. Utilizing the multivariate delta method, we derive explicit higher-order bias correction terms for the empirical reduction factor. Both theoretical analysis and numerical simulations reveal that incorporating higher-order statistical moments, such as skewness and kurtosis, provides the gradient resolution necessary to bypass noise-induced barren plateaus. DSCR significantly accelerates convergence compared to standard VPSR across diverse noise and resource regimes while matching or decreasing cumulative measurement costs, establishing a mathematically rigorous framework for variance-stabilized shot allocation on near-term hardware.
Variational quantum eigensolvers (VQEs) show promise for tackling complex quantum chemistry challenges and realizing quantum advantages. However, in VQE, the measurement step encounters difficulties due to errors in objective function evaluation, e.g., the energy of a quantum state. While increasing the number of measurement shots can mitigate measurement errors, this approach leads to higher costs. Strategies for shot assignment have been investigated, allowing for the allocation of varying shot numbers to different Hamiltonian terms and reducing measurement variance through term-specific insights. In this paper, we introduce a dynamic approach, the Variance-Preserved Shot Reduction (VPSR) method. This technique strives to minimize the total number of measurement shots while preserving the variance of measurements throughout the VQE process. Our numerical experiments on H 2 and LiH molecular ground states demonstrate the effectiveness of VPSR in achieving VQE convergence with a notably lower shot count.
The optimization of Variational Quantum Eigensolver is severely challenged by finite-shot sampling noise, which distorts the cost landscape, creates false variational minima, and induces statistical bias called winner's curse. We investigate this phenomenon by benchmarking eight classical optimizers spanning gradient-based, gradient-free, and metaheuristic methods on quantum chemistry Hamiltonians H2_22​, H4_44​ chain, LiH (in both full and active spaces) using the truncated Variational Hamiltonian Ansatz. We analyze difficulties of gradient-based methods (e.g., SLSQP, BFGS) in noisy regimes, where they diverge or stagnate. We show that the bias of estimator can be corrected by tracking the \textit{population mean}, rather than the biased best individual when using population based optimizer. Our findings, which are shown to generalize to hardware-efficient circuits and condensed matter models, identify adaptive metaheuristics (specifically CMA-ES and iL-SHADE) as the most effective and resilient strategies. We conclude by presenting a set of practical guidelines for reliable VQE optimization under noise, centering on the co-design of physically motivated ansatz and the use of adaptive optimizers.
Abstract The adaptive variational quantum eigensolver (ADAPT-VQE) is a promising approach for quantum simulation in the noisy intermediate-scale quantum era, offering advantages over traditional VQE methods by reducing circuit depth and mitigating challenges in classical optimisation. Although ADAPT-VQE can require fewer total measurements than fixed ansätze for matched precision, the combined cost of repeated energy and gradient evaluations still leads to a substantial measurement overhead in practice, motivating strategies to reduce it further. In this work, we study two complementary strategies to reduce this cost using only standard projective Pauli measurements. First, we apply variance-based shot allocation (variance-minimised shot assignment and variance-preserved shot reduction (VPSR)) to both Hamiltonian energy and operator-gradient measurements, extending techniques previously studied only for energy estimation in standard VQE. VPSR achieves shot reductions of up to 43% for H 2 and 51% for LiH relative to uniform allocation while maintaining chemical accuracy. Second, we introduce a Pauli-measurement reuse protocol that stores outcomes from VQE optimisation and reuses them for gradient evaluation in the next ADAPT iteration. Across six molecular benchmarks (4–14 qubits), measurement reuse yields only marginal savings confined to the smallest systems and is effectively negligible for larger sizes, pivot-based grouping alone provides the dominant reduction and should be considered the practical baseline. These results characterise the interplay between shot allocation, measurement grouping, and cross-iteration reuse, offering practical guidance on when each strategy is most beneficial.
The barren plateau (BP) phenomenon poses a fundamental challenge to the trainability of variational quantum eigensolvers (VQEs) by causing exponentially vanishing gradients as the system size increases. While extensive studies have investigated the geometric origins of BP, its impact on the optimization dynamics and complexity of practical algorithms under finite-shot measurements has received comparatively less attention. In this paper, we develop a theoretical framework that characterizes how the BP affects the optimization dynamics of the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm and quantifies the resulting iteration complexity and measurement budget. We derive non-asymptotic bias and variance bounds for the SPSA gradient estimator, introduce a signal-to-noise ratio (SNR) defined as the ratio of the gradient energy to the mean squared error of the estimator, and establish convergence guarantees for SPSA under finite-shot measurements. Our results show that, under the proposed parameter schedules, the number of iterations sufficient to guarantee a fixed relative first-order stationarity level scales polynomially with the inverse of the intrinsic gradient energy. Consequently, when this energy decays exponentially under BP, the resulting guaranteed iteration complexity and total measurement budget both grow exponentially with the number of qubits.
Variational Quantum Eigensolver (VQE) faces significant challenges due to hardware noise and the presence of barren plateaus and local traps in the optimization landscape. To mitigate the detrimental effects of these issues, we introduce a general formalism that optimizes hardware resource utilization and accuracy by projecting VQE optimizations onto a reduced-dimensional subspace, followed by a set of posteriori corrections. Our method partitions the ansatz into a lower dimensional principal subspace and a higher-dimensional auxiliary subspace based on a conjecture of temporal hierarchy present among the parameters during optimization. The adiabatic approximation exploits this hierarchy, restricting optimization to the lower dimensional principal subspace only. This is followed by an efficient higher dimensional auxiliary space reconstruction without the need to perform variational optimization. These reconstructed auxiliary parameters are subsequently included in the cost-function via a set of auxiliary subspace corrections (ASC), leading to a "plummeting effect" in the energy landscape toward a more optimal minimum without utilizing any additional quantum hardware resources. Numerical simulations show that, when integrated with any chemistry-inspired ansatz, our method can provide one to two orders of magnitude better estimation of the minima. In addition, based on the adiabatic approximation, we introduce a novel initialization strategy driven by unitary rotation generators for accelerated convergence of gradient-informed dynamic quantum algorithms. Our method shows heuristic evidence of alleviating the effects of local traps, facilitating convergence toward a more optimal minimum.
While quantum computers are a very promising tool for the far future, in their current state of the art they remain limited both in size and quality. This has given rise to hybrid quantum-classical algorithms, where the quantum device performs only a small but vital part of the overall computation. Among these, variational quantum algorithms (VQAs), which combine a classical optimization procedure with quantum evaluation of a cost function, have emerged as particularly promising. However, barren plateaus and ill-conditioned optimization landscapes remain among the primary obstacles faced by VQAs, often leading to unstable convergence and high sensitivity to initialization. Motivated by this challenge, we investigate whether a purely classical remedy, standard L2 squared-norm regularization, can systematically stabilize hybrid quantum-classical optimization. Specifically, we augment the Variational Quantum Eigensolver (VQE) objective with a quadratic penalty proportional to the squared norm of the parameters, without modifying the quantum circuit or measurement process. Across all tested Hamiltonians, H2, LiH, and the Random Field Ising Model (RFIM), we observe improved performance over a broad window of the regularization strength. Our large-scale numerical results demonstrate that classical regularization provides a robust, system-independent mechanism for mitigating VQE instability, enhancing the reliability and reproducibility of variational quantum optimization without altering the underlying quantum circuit.