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.14627 · Computer-aided chemical engineering/Computer aided chemical engineering

Bayesian Optimization Priors for Efficient Variational Quantum Algorithms

Farshud Sorourifar, Diana Chamaki, Norm M. Tubman, Joel A. Paulson, David E. Bernal

Published Jan 1, 2024• 3 citations
arXivHTMLPDF
DOI
10.1016/b978-0-443-28824-1.50564-0

Related papers

Variational quantum algorithms

Marco Cerezo, Andrew Arrasmith, Ryan Babbush +8 more

arXiv:2012.09265•Nature Reviews Physics•Aug 12, 2021•4,270 citations

Sample-Efficient Tuning of Quantum Circuit Parameters via Bayesian Optimization

Alessandro Pannone, Federico Tosone, Daniel Faccini +2 more

In this work, we present a Bayesian Optimization (BO) approach for tuning the parameters of the Quantum Approximate Optimization Algorithm (QAOA) applied to max-cut problems. Within our black-box optimization framework, BO achieves competitive solutions while requiring significantly fewer quantum circuit evaluations compared to standard non-Bayesian global optimizers. These results highlight the potential of BO to enhance both the efficiency and the overall performance of variational quantum algorithms.

•Jan 1, 2025•0 citations

Variational Quantum Algorithms and Quantum Machine Learning

Kosuke Mitarai

電子情報通信学会誌•Nov 1, 2021•0 citations

Variational Quantum Algorithm for User Scheduling in Broadband MU-MIMO Systems

Chih-Ho Hsu, Zhi Jun Ding

Multiuser MIMO (MU-MIMO) deployment jointly serves multiple users over shared time-frequency Resource Blocks (RBs) to achieve substantial spectral efficiency improvement. To exploit the full potential of MU-MIMO, users should be scheduled on RBs with strong channels and low Co-Channel Interference (CCI). This paper leverages Variational Quantum Algorithm (VQA) framework, tailored for near-term Noisy Intermediate-Scale Quantum (NISQ) devices, for efficient user scheduling in broadband MU-MIMO systems, which is NP-hard. Specifically, our designed quantum circuit incorporates parameterized entangling gates to create controllable correlations between quantum states, which may explore the solution space more efficiently. To facilitate the challenging variational parameters optimization in VQAs, exacerbated by entangling operations, our framework adopts a two-stage approach. First, we utilize Bayesian Optimization (BO) which constructs a global surrogate model to find sets of promising parameters. Second, we perform local optimization to fine-tune the result of BO by leveraging Gaussian kernels to approximate the noisy optimization landscape with a limited amount of quantum shots. Through extensive simulations, we demonstrate the efficacy of our VQA in achieving near-optimal performance for broadband MU-MIMO user scheduling problems.

IEEE Transactions on Wireless Communications•Jul 23, 2025•1 citation

Noise-Driven Variational Quantum Algorithm Optimization

Theunissen, Thom M.

•Jun 1, 2025•0 citations

Toward efficient quantum computation of molecular ground‐state energies

Farshud Sorourifar, Mohamed Taha Rouabah, Nacer Eddine Belaloui +6 more

Abstract Variational quantum eigensolvers (VQEs) represent a promising approach to computing molecular ground states and energies on modern quantum computers. These approaches use a classical computer to optimize the parameters of a trial wave function, while the quantum computer simulates the energy by preparing and measuring a set of bitstring observations, referred to as shots, over which an expected value is computed. Although more shots improve the accuracy of the expected ground state, it also increases the simulation cost. Hence, we propose modifications to the standard Bayesian optimization algorithm to leverage few‐shot circuit observations to solve VQEs with fewer quantum resources. We demonstrate the effectiveness of our proposed approach, Bayesian optimization with priors on surface topology (BOPT), by comparing optimizers for molecular systems and demonstrate how current quantum hardware can aid in finding ground‐state energies.

arXiv:2407.07963•AIChE Journal•Sep 24, 2025•11 citations
In this work, we present a Bayesian Optimization (BO) approach for tuning the parameters of the Quantum Approximate Optimization Algorithm (QAOA) applied to max-cut problems. Within our black-box optimization framework, BO achieves competitive solutions while requiring significantly fewer quantum circuit evaluations compared to standard non-Bayesian global optimizers. These results highlight the potential of BO to enhance both the efficiency and the overall performance of variational quantum algorithms.
Multiuser MIMO (MU-MIMO) deployment jointly serves multiple users over shared time-frequency Resource Blocks (RBs) to achieve substantial spectral efficiency improvement. To exploit the full potential of MU-MIMO, users should be scheduled on RBs with strong channels and low Co-Channel Interference (CCI). This paper leverages Variational Quantum Algorithm (VQA) framework, tailored for near-term Noisy Intermediate-Scale Quantum (NISQ) devices, for efficient user scheduling in broadband MU-MIMO systems, which is NP-hard. Specifically, our designed quantum circuit incorporates parameterized entangling gates to create controllable correlations between quantum states, which may explore the solution space more efficiently. To facilitate the challenging variational parameters optimization in VQAs, exacerbated by entangling operations, our framework adopts a two-stage approach. First, we utilize Bayesian Optimization (BO) which constructs a global surrogate model to find sets of promising parameters. Second, we perform local optimization to fine-tune the result of BO by leveraging Gaussian kernels to approximate the noisy optimization landscape with a limited amount of quantum shots. Through extensive simulations, we demonstrate the efficacy of our VQA in achieving near-optimal performance for broadband MU-MIMO user scheduling problems.
Abstract Variational quantum eigensolvers (VQEs) represent a promising approach to computing molecular ground states and energies on modern quantum computers. These approaches use a classical computer to optimize the parameters of a trial wave function, while the quantum computer simulates the energy by preparing and measuring a set of bitstring observations, referred to as shots, over which an expected value is computed. Although more shots improve the accuracy of the expected ground state, it also increases the simulation cost. Hence, we propose modifications to the standard Bayesian optimization algorithm to leverage few‐shot circuit observations to solve VQEs with fewer quantum resources. We demonstrate the effectiveness of our proposed approach, Bayesian optimization with priors on surface topology (BOPT), by comparing optimizers for molecular systems and demonstrate how current quantum hardware can aid in finding ground‐state energies.