QuGStep: Refining Step Size Selection in Gradient Estimation for Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2503.14366v1
• Date: Tue, 18 Mar 2025 15:48:09 GMT
• Title: QuGStep: Refining Step Size Selection in Gradient Estimation for Variational Quantum Algorithms
• Authors: Senwei Liang, Linghua Zhu, Xiaosong Li, Chao Yang,
• Abstract summary: This paper proposes QuGStep, an algorithm that addresses the challenge of determining the appropriate step size for finite-difference gradient estimation under a shot budget.<n> Numerical experiments approximating the ground state energy of several molecules demonstrate that QuGStep can identify the appropriate step size for the given shot budget to obtain effective gradient estimation.
• Score: 5.946007090892021
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum algorithms (VQAs) offer a promising approach to solving computationally demanding problems by combining parameterized quantum circuits with classical optimization. Estimating probabilistic outcomes on quantum hardware requires repeated measurements (shots). However, in practice, the limited shot budget introduces significant noise in the evaluation of the objective function. Gradient estimation in VQAs often relies on the finite-difference, which evaluates the noisy objective function at perturbed circuit parameter values. The accuracy of this estimation is highly dependent on the choice of step size for these perturbations. An inappropriate step size can exacerbate the impact of noise, causing inaccurate gradient estimates and hindering the classical optimization in VQAs. This paper proposes QuGStep, an algorithm that addresses the challenge of determining the appropriate step size for finite-difference gradient estimation under a shot budget. QuGStep is grounded in a theorem that proves the optimal step size, which accounts for the shot budget, minimizes the error bound in gradient estimation using finite differences. Numerical experiments approximating the ground state energy of several molecules demonstrate that QuGStep can identify the appropriate step size for the given shot budget to obtain effective gradient estimation. Notably, the step size identified by QuGStep achieved convergence to the ground state energy with over 96% fewer shots compared to using a default step size. These findings highlight the potential of QuGStep to improve the practical deployment and scalability of quantum computing technologies.

Related papers

• Optimal Coherent Quantum Phase Estimation via Tapering [0.0]
  Quantum phase estimation is one of the fundamental primitives that underpins many quantum algorithms. We propose an improved version of the standard algorithm called the tapered quantum phase estimation algorithm. Our algorithm achieves the optimal query complexity without requiring the expensive coherent median technique.
  arXiv  Detail & Related papers  (2024-03-27T18:17:23Z)
• Variational quantum algorithm for enhanced continuous variable optical phase sensing [0.0]
  Variational quantum algorithms (VQAs) are hybrid quantum-classical approaches used for tackling a wide range of problems on noisy quantum devices. We implement a variational algorithm designed for optimized parameter estimation on a continuous variable platform based on squeezed light.
  arXiv  Detail & Related papers  (2023-12-21T14:11:05Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Fast gradient estimation for variational quantum algorithms [0.6445605125467572]
  We propose a new gradient estimation method to mitigate the measurement challenge. Within a Bayesian framework, we use prior information about the circuit to find an estimation strategy. We demonstrate that this approach can significantly outperform traditional gradient estimation methods.
  arXiv  Detail & Related papers  (2022-10-12T18:00:00Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• Iteration Complexity of Variational Quantum Algorithms [5.203200173190989]
  We argue that noise makes evaluations of the objective function via quantum circuits biased. We derive the missing guarantees and find that the rate of convergence is unaffected.
  arXiv  Detail & Related papers  (2022-09-21T19:18:41Z)
• Optimized numerical gradient and Hessian estimation for variational quantum algorithms [0.0]
  We show that tunable numerical estimators offer estimation errors that drop exponentially with the number of circuit qubits. We demonstrate that the scaled parameter-shift estimators beat the standard unscaled ones in estimation accuracy under any situation.
  arXiv  Detail & Related papers  (2022-06-25T12:58:44Z)
• 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)
• Differentiable Annealed Importance Sampling and the Perils of Gradient Noise [68.44523807580438]
  Annealed importance sampling (AIS) and related algorithms are highly effective tools for marginal likelihood estimation. Differentiability is a desirable property as it would admit the possibility of optimizing marginal likelihood as an objective. We propose a differentiable algorithm by abandoning Metropolis-Hastings steps, which further unlocks mini-batch computation.
  arXiv  Detail & Related papers  (2021-07-21T17:10:14Z)
• Zeroth-Order Hybrid Gradient Descent: Towards A Principled Black-Box Optimization Framework [100.36569795440889]
  This work is on the iteration of zero-th-order (ZO) optimization which does not require first-order information. We show that with a graceful design in coordinate importance sampling, the proposed ZO optimization method is efficient both in terms of complexity as well as as function query cost.
  arXiv  Detail & Related papers  (2020-12-21T17:29:58Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• 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)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.