Quantum Amplitude Estimation in Gradient-Based Stochastic Optimization

• URL: http://arxiv.org/abs/2607.00040v1
• Date: Mon, 29 Jun 2026 13:50:35 GMT
• Title: Quantum Amplitude Estimation in Gradient-Based Stochastic Optimization
• Abstract summary: We prove, both mathematically and through a simulation, how the Quantum Amplitude Estimation algorithm can obtain quadratic improvements with respect to the Monte Carlo method in gradient-based optimization.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper we prove, both mathematically and through a simulation, how the Quantum Amplitude Estimation algorithm can obtain quadratic improvements with respect to the Monte Carlo method in gradient-based stochastic optimization, highlighting the central role of the Quantum Phase Estimation concentration guarantee in achieving the predicted advantage.

Related papers

• Stochastic Pauli-path simulator for large-scale quantum optimization [57.179828941706006]
  Pauli-path simulators offer a promising route to large-scale classical simulation of quantum circuits in the low-magic regime.<n>Existing approaches either lack native support for gradient-based optimization or suffer from severe gradient bias.<n>Here we propose the Pauli-path simulator (SPPS), a computational framework for large-scale quantum optimization.
  arXiv  Detail & Related papers  (2026-07-20T10:43:44Z)
• On the Role of Batch Size in Stochastic Conditional Gradient Methods [51.97510367368799]
  We study the role of batch size in conditional gradient methods under a $$-Kurdyka-ojasiewicz ($$-KL) condition.<n>Our study reveals a regime-dependent behavior: increasing the batch size initially improves optimization accuracy but, beyond a critical threshold, the benefits and saturate can degrade performance under a fixed token budget.
  arXiv  Detail & Related papers  (2026-03-22T12:23:41Z)
• Efficient Stochastic Optimisation via Sequential Monte Carlo [0.5599792629509229]
  We develop sequential Monte Carlo samplers for optimisation of functions with intractable gradients.<n>Our approach replaces expensive inner sampling methods with efficient SMC approximations, which can result in significant computational gains.<n>We demonstrate the effectiveness of our approach on the reward-tuning of energy-based models within various settings.
  arXiv  Detail & Related papers  (2026-01-29T17:13:25Z)
• An em algorithm for quantum Boltzmann machines [40.40469032705598]
  We develop a quantum version of the em algorithm for training quantum Boltzmann machines.<n>We implement the algorithm on a semi-quantum restricted Boltzmann machine, where quantum effects are confined to the hidden layer.
  arXiv  Detail & Related papers  (2025-07-29T07:59:22Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Quantum speedup of non-linear Monte Carlo problems [3.534338813984755]
  We propose a quantum-inside-quantum Monte Carlo algorithm that achieves a speedup for a broad class of non-linear estimation problems.<n>A key innovation of our approach is a new sequence of multilevel Monte Carlo approximations specifically designed for quantum computing.
  arXiv  Detail & Related papers  (2025-02-07T17:13:27Z)
• Non-degenerate Marginal-Likelihood Calibration with Application to Quantum Characterization [0.0]
  We propose a novel marginalized likelihood strategy within the Kennedy-O'Hagan (KOH) Bayesian framework.<n>Our method defines an exact likelihood -- distinct from the original but preserving all relevant information.<n>It is applied to the characterization of a superconducting quantum device at Lawrence Livermore National Laboratory.
  arXiv  Detail & Related papers  (2023-08-24T04:39:18Z)
• One-step corrected projected stochastic gradient descent for statistical estimation [49.1574468325115]
  It is based on the projected gradient descent on the log-likelihood function corrected by a single step of the Fisher scoring algorithm. We show theoretically and by simulations that it is an interesting alternative to the usual gradient descent with averaging or the adaptative gradient descent.
  arXiv  Detail & Related papers  (2023-06-09T13:43:07Z)
• Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
  We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
  arXiv  Detail & Related papers  (2022-09-05T07:23:03Z)
• 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)
• Efficient qubit phase estimation using adaptive measurements [0.0]
  Estimating the quantum phase of a physical system is a central problem in quantum parameter estimation theory. Current methods to estimate quantum phases fail to reach the quantum Cram'er-Rao bound. We propose a new adaptive scheme based on covariant measurements to circumvent this problem.
  arXiv  Detail & Related papers  (2020-12-21T02:43:47Z)
• A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm [59.99439951055238]
  We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based. The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM) We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
  arXiv  Detail & Related papers  (2020-06-23T01:34:18Z)
• Quantum-Enhanced Simulation-Based Optimization [0.8057006406834467]
  Simulation-based optimization seeks to optimize an objective function that is computationally expensive to evaluate exactly. Quantum Amplitude Estimation (QAE) can achieve a quadratic speed-up over classical Monte Carlo simulation.
  arXiv  Detail & Related papers  (2020-05-21T17:02:59Z)

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.