Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2406.06150 · neural information processing systems

Physics-Informed Bayesian Optimization of Variational Quantum Circuits

Kim A. Nicoli, Christopher J. Anders, Lena Funcke, Tobias Hartung, Karl Jansen, Stefan Kühn, Klaus‐Robert Müller, Paolo Stornati, Pan Kessel, Shinichi Nakajima

Published Jan 1, 2023• 14 citations
arXivHTMLPDF

Abstract

In this paper, we propose a novel and powerful method to harness Bayesian optimization for Variational Quantum Eigensolvers (VQEs) -- a hybrid quantum-classical protocol used to approximate the ground state of a quantum Hamiltonian. Specifically, we derive a VQE-kernel which incorporates important prior information about quantum circuits: the kernel feature map of the VQE-kernel exactly matches the known functional form of the VQE's objective function and thereby significantly reduces the posterior uncertainty. Moreover, we propose a novel acquisition function for Bayesian optimization called Expected Maximum Improvement over Confident Regions (EMICoRe) which can actively exploit the inductive bias of the VQE-kernel by treating regions with low predictive uncertainty as indirectly ``observed''. As a result, observations at as few as three points in the search domain are sufficient to determine the complete objective function along an entire one-dimensional subspace of the optimization landscape. Our numerical experiments demonstrate that our approach improves over state-of-the-art baselines.

DOI
10.52202/075280-0807

Related papers

Bayesian Optimization of Variational Quantum Eigensolvers

Iannelli, Giovanni

The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm used to find the ground state of a Hamiltonian using variational methods. It has a wide range of potential applications, from quantum chemistry to lattice gauge theories in the Hamiltonian formulation. VQE relies on quantum computers to evaluate the energy of the system in terms of circuit parameters, and it minimizes this parametrized energy with a classical optimization routine. This work describes a Bayesian optimization (BO) algorithm specifically designed to minimize the parametrized energy obtained with a quantum computer. BO based on Gaussian process regression (GPR) is an algorithm for finding the global minimum of a black-box cost function, e.g. the energy, with a very low number of iterations even when using data affected by statistical noise. Furthermore, the GPR procedure developed for this work proved to be very versatile as we also used it to compute discrete integral transforms of noisy data. In particular, this procedure was used to reconstruct parton distribution functions from lattice QCD data.

•Jan 1, 2023•0 citations

Noisy Bayesian optimization for variational quantum eigensolvers

Iannelli, Giovanni, Karl Jansen

The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm used to find the ground state of a Hamiltonian using variational methods. In the context of this Lattice symposium, the procedure can be used to study lattice gauge theories (LGTs) in the Hamiltonian formulation. Bayesian optimization (BO) based on Gaussian process regression (GPR) is a powerful algorithm for finding the global minimum of a cost function, e.g. the energy, with a very low number of iterations using data affected by statistical noise. This work proposes an implementation of GPR and BO specifically tailored to perform VQE on quantum computers already available today.

arXiv:2112.00426•Dec 1, 2021•17 citations

Noisy Bayesian optimization for variational quantum eigensolvers

Giovanni Iannelli, Karl Jansen

The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm used to find the ground state of a Hamiltonian using variational methods. In the context of this Lattice symposium, the procedure can be used to study lattice gauge theories (LGTs) in the Hamiltonian formulation. Bayesian optimization (BO) based on Gaussian process regression (GPR) is a powerful algorithm for finding the global minimum of a cost function, e.g. the energy, with a very low number of iterations using data affected by statistical noise. This work proposes an implementation of GPR and BO specifically tailored to perform VQE on quantum computers already available today.

International Symposium on Lattice Field Theory (LATTICE)•May 16, 2022•9 citations

Classical Regularization in Variational Quantum Eigensolvers

Yury Chernyak, Ijaz Ahamed Mohammad, Martin Plesch

While quantum computers are a very promising tool for the far future, in their current state of the art they remain limited both in size and quality. This has given rise to hybrid quantum-classical algorithms, where the quantum device performs only a small but vital part of the overall computation. Among these, variational quantum algorithms (VQAs), which combine a classical optimization procedure with quantum evaluation of a cost function, have emerged as particularly promising. However, barren plateaus and ill-conditioned optimization landscapes remain among the primary obstacles faced by VQAs, often leading to unstable convergence and high sensitivity to initialization. Motivated by this challenge, we investigate whether a purely classical remedy, standard L2 squared-norm regularization, can systematically stabilize hybrid quantum-classical optimization. Specifically, we augment the Variational Quantum Eigensolver (VQE) objective with a quadratic penalty proportional to the squared norm of the parameters, without modifying the quantum circuit or measurement process. Across all tested Hamiltonians, H2, LiH, and the Random Field Ising Model (RFIM), we observe improved performance over a broad window of the regularization strength. Our large-scale numerical results demonstrate that classical regularization provides a robust, system-independent mechanism for mitigating VQE instability, enhancing the reliability and reproducibility of variational quantum optimization without altering the underlying quantum circuit.

quant-pharXiv:2601.16679•Jan 26, 2026•0 citations

Machine-Learning-Enhanced Optimization of Noise-Resilient Variational Quantum Eigensolvers

Luca Johannes Wagner, Kim A. Nicoli, Lena Funcke

Variational Quantum Eigensolvers (VQEs) are a powerful class of hybrid quantum-classical algorithms designed to approximate the ground state of a quantum system described by its Hamiltonian. VQEs hold promise for various applications, including lattice field theory. However, the inherent noise of Noisy Intermediate-Scale Quantum (NISQ) devices poses a significant challenge for running VQEs as these algorithms are particularly susceptible to noise, e.g., measurement shot noise and hardware noise. In a recent work, it was proposed to enhance the classical optimization of VQEs with Gaussian Processes (GPs) and Bayesian Optimization, as these machine-learning techniques are well-suited for handling noisy data. In these proceedings, we provide additional insights into this new algorithm and present further numerical experiments. In particular, we examine the impact of hardware noise and error mitigation on the algorithm's performance. We validate the algorithm using classical simulations of quantum hardware, including hardware noise benchmarks, which have not been considered in previous works. Our numerical experiments demonstrate that GP-enhanced algorithms can outperform state-of-the-art baselines, laying the foundation for future research on deploying these techniques to real quantum hardware and lattice field theory setups.

arXiv:2501.17689•International Symposium on Lattice Field Theory (LATTICE)•Feb 21, 2025•4 citations

Faster variational quantum algorithms with quantum kernel-based surrogate models

Alistair W. R. Smith, A. J. Paige, M S Kim

Abstract We present a new optimization strategy for small-to-intermediate scale variational quantum algorithms (VQAs) on noisy near-term quantum processors which uses a Gaussian process surrogate model equipped with a classically-evaluated quantum kernel. VQAs are typically optimized using gradient-based approaches however these are difficult to implement on current noisy devices, requiring large numbers of objective function evaluations. Our approach shifts this computational burden onto the classical optimizer component of these hybrid algorithms, greatly reducing the number of quantum circuit evaluations required from the quantum processor. We focus on the variational quantum eigensolver (VQE) algorithm and demonstrate numerically that these surrogate models are particularly well suited to the algorithm’s objective function. Next, we apply these models to both noiseless and noisy VQE simulations and show that they exhibit better performance than widely-used classical kernels in terms of final accuracy and convergence speed. Compared to the typically-used stochastic gradient-descent approach to VQAs, our quantum kernel-based approach is found to consistently achieve significantly higher accuracy while requiring less than an order of magnitude fewer quantum circuit executions. We analyze the performance of the quantum kernel-based models in terms of the kernels’ induced feature spaces and explicitly construct their feature maps. Finally, we describe a scheme for approximating the best-performing quantum kernel using a classically-efficient tensor network representation of its input state and so provide a pathway for scaling this strategy to larger systems.

arXiv:2211.01134•Quantum Science and Technology•Jul 28, 2023•12 citations
In this paper, we propose a novel and powerful method to harness Bayesian optimization for Variational Quantum Eigensolvers (VQEs) -- a hybrid quantum-classical protocol used to approximate the ground state of a quantum Hamiltonian. Specifically, we derive a VQE-kernel which incorporates important prior information about quantum circuits: the kernel feature map of the VQE-kernel exactly matches the known functional form of the VQE's objective function and thereby significantly reduces the posterior uncertainty. Moreover, we propose a novel acquisition function for Bayesian optimization called Expected Maximum Improvement over Confident Regions (EMICoRe) which can actively exploit the inductive bias of the VQE-kernel by treating regions with low predictive uncertainty as indirectly ``observed''. As a result, observations at as few as three points in the search domain are sufficient to determine the complete objective function along an entire one-dimensional subspace of the optimization landscape. Our numerical experiments demonstrate that our approach improves over state-of-the-art baselines.
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm used to find the ground state of a Hamiltonian using variational methods. It has a wide range of potential applications, from quantum chemistry to lattice gauge theories in the Hamiltonian formulation. VQE relies on quantum computers to evaluate the energy of the system in terms of circuit parameters, and it minimizes this parametrized energy with a classical optimization routine. This work describes a Bayesian optimization (BO) algorithm specifically designed to minimize the parametrized energy obtained with a quantum computer. BO based on Gaussian process regression (GPR) is an algorithm for finding the global minimum of a black-box cost function, e.g. the energy, with a very low number of iterations even when using data affected by statistical noise. Furthermore, the GPR procedure developed for this work proved to be very versatile as we also used it to compute discrete integral transforms of noisy data. In particular, this procedure was used to reconstruct parton distribution functions from lattice QCD data.
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm used to find the ground state of a Hamiltonian using variational methods. In the context of this Lattice symposium, the procedure can be used to study lattice gauge theories (LGTs) in the Hamiltonian formulation. Bayesian optimization (BO) based on Gaussian process regression (GPR) is a powerful algorithm for finding the global minimum of a cost function, e.g. the energy, with a very low number of iterations using data affected by statistical noise. This work proposes an implementation of GPR and BO specifically tailored to perform VQE on quantum computers already available today.
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm used to find the ground state of a Hamiltonian using variational methods. In the context of this Lattice symposium, the procedure can be used to study lattice gauge theories (LGTs) in the Hamiltonian formulation. Bayesian optimization (BO) based on Gaussian process regression (GPR) is a powerful algorithm for finding the global minimum of a cost function, e.g. the energy, with a very low number of iterations using data affected by statistical noise. This work proposes an implementation of GPR and BO specifically tailored to perform VQE on quantum computers already available today.
While quantum computers are a very promising tool for the far future, in their current state of the art they remain limited both in size and quality. This has given rise to hybrid quantum-classical algorithms, where the quantum device performs only a small but vital part of the overall computation. Among these, variational quantum algorithms (VQAs), which combine a classical optimization procedure with quantum evaluation of a cost function, have emerged as particularly promising. However, barren plateaus and ill-conditioned optimization landscapes remain among the primary obstacles faced by VQAs, often leading to unstable convergence and high sensitivity to initialization. Motivated by this challenge, we investigate whether a purely classical remedy, standard L2 squared-norm regularization, can systematically stabilize hybrid quantum-classical optimization. Specifically, we augment the Variational Quantum Eigensolver (VQE) objective with a quadratic penalty proportional to the squared norm of the parameters, without modifying the quantum circuit or measurement process. Across all tested Hamiltonians, H2, LiH, and the Random Field Ising Model (RFIM), we observe improved performance over a broad window of the regularization strength. Our large-scale numerical results demonstrate that classical regularization provides a robust, system-independent mechanism for mitigating VQE instability, enhancing the reliability and reproducibility of variational quantum optimization without altering the underlying quantum circuit.
Variational Quantum Eigensolvers (VQEs) are a powerful class of hybrid quantum-classical algorithms designed to approximate the ground state of a quantum system described by its Hamiltonian. VQEs hold promise for various applications, including lattice field theory. However, the inherent noise of Noisy Intermediate-Scale Quantum (NISQ) devices poses a significant challenge for running VQEs as these algorithms are particularly susceptible to noise, e.g., measurement shot noise and hardware noise. In a recent work, it was proposed to enhance the classical optimization of VQEs with Gaussian Processes (GPs) and Bayesian Optimization, as these machine-learning techniques are well-suited for handling noisy data. In these proceedings, we provide additional insights into this new algorithm and present further numerical experiments. In particular, we examine the impact of hardware noise and error mitigation on the algorithm's performance. We validate the algorithm using classical simulations of quantum hardware, including hardware noise benchmarks, which have not been considered in previous works. Our numerical experiments demonstrate that GP-enhanced algorithms can outperform state-of-the-art baselines, laying the foundation for future research on deploying these techniques to real quantum hardware and lattice field theory setups.
Abstract We present a new optimization strategy for small-to-intermediate scale variational quantum algorithms (VQAs) on noisy near-term quantum processors which uses a Gaussian process surrogate model equipped with a classically-evaluated quantum kernel. VQAs are typically optimized using gradient-based approaches however these are difficult to implement on current noisy devices, requiring large numbers of objective function evaluations. Our approach shifts this computational burden onto the classical optimizer component of these hybrid algorithms, greatly reducing the number of quantum circuit evaluations required from the quantum processor. We focus on the variational quantum eigensolver (VQE) algorithm and demonstrate numerically that these surrogate models are particularly well suited to the algorithm’s objective function. Next, we apply these models to both noiseless and noisy VQE simulations and show that they exhibit better performance than widely-used classical kernels in terms of final accuracy and convergence speed. Compared to the typically-used stochastic gradient-descent approach to VQAs, our quantum kernel-based approach is found to consistently achieve significantly higher accuracy while requiring less than an order of magnitude fewer quantum circuit executions. We analyze the performance of the quantum kernel-based models in terms of the kernels’ induced feature spaces and explicitly construct their feature maps. Finally, we describe a scheme for approximating the best-performing quantum kernel using a classically-efficient tensor network representation of its input state and so provide a pathway for scaling this strategy to larger systems.