Bayesian Optimization Priors for Efficient Variational Quantum Algorithms
Farshud Sorourifar, Diana Chamaki, Norm M. Tubman, Joel A. Paulson,, David E. Bernal Neira

TL;DR
This paper introduces Bayesian optimization priors tailored for variational quantum algorithms to improve shot efficiency and reduce quantum hardware costs, demonstrating superior performance in chemistry simulations.
Contribution
It proposes two novel Bayesian optimization modifications: a periodicity prior and a topological prior, enhancing shot efficiency in VQAs.
Findings
The proposed priors outperform standard BO in VQAs.
Significant reduction in quantum shots needed for accurate results.
Improved efficiency in quantum chemistry simulations.
Abstract
Quantum computers currently rely on a hybrid quantum-classical approach known as Variational Quantum Algorithms (VQAs) to solve problems. Still, there are several challenges with VQAs on the classical computing side: it corresponds to a black-box optimization problem that is generally non-convex, the observations from the quantum hardware are noisy, and the quantum computing time is expensive. The first point is inherent to the problem structure; as a result, it requires the classical part of VQAs to be solved using global optimization strategies. However, there is a trade-off between cost and accuracy; typically, quantum computers return a set of bit strings, where each bitstring is referred to as a shot. The probabilistic nature of quantum computing (QC) necessitates many shots to measure the circuit accurately. Since QC time is charged per shot, reducing the number of shots yields…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
