Stochastic gradient line Bayesian optimization for efficient noise-robust optimization of parameterized quantum circuits
Shiro Tamiya,Hayata Yamasaki +1 more
TL;DR: In this article , a stochastic gradient line Bayesian optimization (SGLBO) algorithm is proposed to reduce the measurement-shot cost by estimating an appropriate direction of updating circuit parameters based on SGD and further utilizing bayesian optimization to estimate the optimal step size for each iteration in SGD.
read more
Abstract: Optimizing parameterized quantum circuits is a key routine in using near-term quantum devices. However, the existing algorithms for such optimization require an excessive number of quantum-measurement shots for estimating expectation values of observables and repeating many iterations, whose cost has been a critical obstacle for practical use. We develop an efficient alternative optimization algorithm, stochastic gradient line Bayesian optimization (SGLBO), to address this problem. SGLBO reduces the measurement-shot cost by estimating an appropriate direction of updating circuit parameters based on stochastic gradient descent (SGD) and further utilizing Bayesian optimization (BO) to estimate the optimal step size for each iteration in SGD. In addition, we formulate an adaptive measurement-shot strategy and introduce a technique of suffix averaging to reduce the effect of statistical and hardware noise. Our numerical simulation demonstrates that the SGLBO augmented with these techniques can drastically reduce the measurement-shot cost, improve the accuracy, and make the optimization noise-robust.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
TL;DR: In this paper , an efficient, low-depth variational quantum algorithm with few parameters can reproduce important qualitative features of medium-size instances of the Fermi-Hubbard model.
Latency considerations for stochastic optimizers in variational quantum algorithms
TL;DR: Stochastic optimization algorithms that yield stochastic processes em-ulating the dynamics of classical deterministic algorithms results in methods with theoretically superior worst-case iteration complexities, at the expense of greater per-iteration sample (shot) complexities.
High-Dimensional Multi-fidelity Bayesian Optimization for Quantum Control
Marjuka Ferdousi Lazin,Christian R. Shelton,Simon Sandhofer,Bryan M. Wong +3 more
- 06 Oct 2023
TL;DR: This work presents the first multi-fidelity Bayesian optimization approach for solving inverse problems in the quantum control of prototypical quantum systems, and demonstrates that BO is a promising approach to efficiently and autonomously design control fields in general quantum dynamical systems.
12
Error-mitigated Quantum Approximate Optimization via Learning-based Adaptive Optimization
26 Mar 2023
TL;DR: In this paper , double adaptive region Bayesian optimization (DARBO) is proposed for QAOA, which greatly outperforms conventional gradient-based and gradient-free optimizers in terms of speed, accuracy and stability.
Bayesian Optimization for QAOA
Simone Tibaldi,Davide Vodola,Edoardo Tignone,Elisa Ercolessi +3 more
TL;DR: Bayesian optimization for QAOA significantly reduces the number of calls to the quantum circuit, improving its performance and robustness against noise.
8
References
•Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
- 01 Jan 2015
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
138.5K
A Stochastic Approximation Method
Herbert Robbins,Sutton Monro +1 more
TL;DR: In this article, a method for making successive experiments at levels x1, x2, ··· in such a way that xn will tend to θ in probability is presented.
Gaussian processes in machine learning
TL;DR: In this paper, the authors give a basic introduction to Gaussian Process regression models and present the simple equations for incorporating training data and examine how to learn the hyperparameters using the marginal likelihood.
•Proceedings Article
Practical Bayesian Optimization of Machine Learning Algorithms
Jasper Snoek,Hugo Larochelle,Ryan P. Adams +2 more
- 03 Dec 2012
TL;DR: This work describes new algorithms that take into account the variable cost of learning algorithm experiments and that can leverage the presence of multiple cores for parallel experimentation and shows that these proposed algorithms improve on previous automatic procedures and can reach or surpass human expert-level optimization for many algorithms.
Quantum Computing in the NISQ era and beyond
TL;DR: Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future as mentioned in this paper, which will be useful tools for exploring many-body quantum physics, and may have other useful applications.