Prior-Informed Adaptive Shifts for Sequential Minimal Optimization in Variational Quantum Eigensolvers

• URL: http://arxiv.org/abs/2608.21616v1
• Date: Fri, 21 Aug 2026 20:31:01 GMT
• Title: Prior-Informed Adaptive Shifts for Sequential Minimal Optimization in Variational Quantum Eigensolvers
• Abstract summary: We develop a new theory for determining optimal measurement locations.<n>We show that incorporating prior information about the minimizer is beneficial.<n>We propose Prior-informed Adaptive Shifts (PAS), a method that automatically adjusts measurement locations during optimization.
• Score: 8.530320876090661
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sequential minimal optimization methods, such as the Rotosolve and the Nakanishi-Fujii-Todo algorithm (NFT), are widely used for Variational Quantum Eigensolvers (VQEs). These methods optimize one parameter direction at a time, requiring measurements at only a few locations along that direction. In the presence of measurement shot noise, however, their performance depends critically on the choice of measurement locations, and recent studies suggest that equidistant measurements are optimal. However, we often observe that equidistant measurements are not always optimal in practice. We argue that this discrepancy between theory and practice arises from the fact that two assumptions underlying previous analyses do not generally hold: (1) the absence of prior knowledge about the energy minimizer, and (2) the use of the uncertainty of the estimated energy as a proxy for optimization performance. In this paper, we develop a new theory for determining optimal measurement locations. First, we show that incorporating prior information about the minimizer is beneficial. Early in optimization, when little is known about the pivot, i.e., the current minimizer, equidistant measurements are indeed near-optimal, but as the prior belief sharpens the optimal locations move away from equidistant. Second, rather than analyzing the uncertainty of the estimated minimum energy, we study the uncertainty of the estimator of the minimizer itself, which leads to substantially different strategies. Based on this analysis, we propose Prior-informed Adaptive Shifts (PAS), a method that automatically adjusts measurement locations during optimization. Numerical experiments across different shot counts and problems validate our theoretical findings and demonstrate that PAS adaptively recovers whichever fixed shift is best in each regime without it being specified in advance.

Related papers

• Bias Analysis and Regularization of Sequential Minimal Optimization in Variational Quantum Eigensolvers [8.530320876090661]
  We analyze the origin and accumulation of bias during the SMO-VQE process.<n>We show that the bias can be accurately estimated without additional measurements.<n>We propose a simple regularization method that implements error accumulation while maintaining unbiased energy estimation.
  arXiv  Detail & Related papers  (2026-05-15T10:07:21Z)
• Minimax Optimal Two-Stage Algorithm For Moment Estimation Under Covariate Shift [10.35788775775647]
  We investigate the minimax lower bound of the problem when the source and target distributions are known.<n>Specifically, it first trains an optimal estimator for the function under the source distribution, and then uses a likelihood ratio reweighting procedure to calibrate the moment estimator.<n>To solve this problem, we propose a truncated version of the estimator that ensures double robustness and provide the corresponding upper bound.
  arXiv  Detail & Related papers  (2025-06-30T01:32:36Z)
• Experimental optimal discrimination of $N$ states of a qubit with fixed rates of inconclusive outcomes [0.5452584641316628]
  In a general optimized measurement scheme, the error rate is minimized under the constraint of a fixed rate of inconclusive outcomes (FRIO) Here, we experimentally demonstrate the optimal FRIO discrimination between $N=2,3,5,$ and $7$ equally likely symmetric states of a qubit encoded in photonic path modes.
  arXiv  Detail & Related papers  (2024-11-21T19:09:58Z)
• QestOptPOVM: An iterative algorithm to find optimal measurements for quantum parameter estimation [17.305295658536828]
  We introduce an algorithm, termed QestPOVM, designed to directly identify optimal positive operator-Opt measure (POVM) Through rigorous testing on several examples for multiple copies of qubit states (up to six copies), we demonstrate the efficiency and accuracy of our proposed algorithm. Our algorithm functions as a tool for elucidating the explicit forms of optimal POVMs, thereby enhancing our understanding of quantum parameter estimation methodologies.
  arXiv  Detail & Related papers  (2024-03-29T11:46:09Z)
• Only Classical Parameterised States have Optimal Measurements under Least Squares Loss [0.0]
  We introduce a framework that allows one to conclusively establish if a measurement is optimal in the non-asymptotic regime. We prove a no-go theorem that shows that only classical states admit optimal measurements under the most common choice of error measurement: least squares.
  arXiv  Detail & Related papers  (2022-05-27T17:59:53Z)
• A Dimensionality Reduction Method for Finding Least Favorable Priors with a Focus on Bregman Divergence [108.28566246421742]
  This paper develops a dimensionality reduction method that allows us to move the optimization to a finite-dimensional setting with an explicit bound on the dimension. In order to make progress on the problem, we restrict ourselves to Bayesian risks induced by a relatively large class of loss functions, namely Bregman divergences.
  arXiv  Detail & Related papers  (2022-02-23T16:22:28Z)
• Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator [75.05106948314956]
  We show that an increasing large momentum parameter for the first-order moment is sufficient for adaptive scaling.<n>We also give insights for increasing the momentum in a stagewise manner in accordance with stagewise decreasing step size.
  arXiv  Detail & Related papers  (2021-04-30T08:50:24Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Balancing Rates and Variance via Adaptive Batch-Size for Stochastic Optimization Problems [120.21685755278509]
  In this work, we seek to balance the fact that attenuating step-size is required for exact convergence with the fact that constant step-size learns faster in time up to an error. Rather than fixing the minibatch the step-size at the outset, we propose to allow parameters to evolve adaptively.
  arXiv  Detail & Related papers  (2020-07-02T16:02:02Z)
• Convergence of adaptive algorithms for weakly convex constrained optimization [59.36386973876765]
  We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope. Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
  arXiv  Detail & Related papers  (2020-06-11T17:43:19Z)
• Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization [71.03797261151605]
  Adaptivity is an important yet under-studied property in modern optimization theory. Our algorithm is proved to achieve the best-available convergence for non-PL objectives simultaneously while outperforming existing algorithms for PL objectives.
  arXiv  Detail & Related papers  (2020-02-13T05:42:27Z)

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.