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

IEEE International Conference on Quantum Artificial Intelligence (QAI)

Scalable Quantum Approximate Optimisation with Adaptive Bayesian Dimensionality Reduction

Amir Alizadeh, Amir Pourabdollah, Ahmad Lotfi

Published Nov 2, 2025• 0 citations
Publisher

Abstract

Quantum Approximate Optimisation Algorithm (QAOA) has emerged as a promising hybrid quantum-classical approach for tackling NP-hard combinatorial optimisation problems by combining quantum and classical computational paradigms. However, efficiently optimising QAOA parameters is notoriously challenging due to the complex, high-dimensional landscapes involved, characterised by numerous local minima and barren plateaus. Bayesian Optimisation (BO) has shown promise in addressing these challenges, yet its effectiveness diminishes significantly with increasing problem dimensionality. In this work, we adopt the Minimum Average Variance Estimation for Bayesian Optimisation (MAVE-BO) method to address this scalability bottleneck. By leveraging the low-dimensional structure inherent in QAOA parameter spaces, our approach improves optimisation efficiency and robustness. We applied our model to a practical power systems problem, optimising eigenvector centrality (EC) in an IEEE 14-bus network. The proposed method demonstrates superior performance in both efficiency and solution quality compared to classical optimisers such as standard Bayesian Optimisation (Vanilla BO), COBYLA, L-BFGS-B, and genetic algorithms. These results underscore the potential of dimensionality-aware BO frameworks for realworld quantum applications in noisy, resource-constrained environments.

DOI
10.1109/qai63978.2025.00037

Related papers

Hybrid Quantum–Classical Optimization: Enhancing QAOA Performance via Classical Optimizer Selection

Xuezhu Chen

Hybrid Quantum–Classical Optimization combines the advantages of quantum computing and classical optimization to address complex combinatorial optimization problems. The Quantum Approximate Optimization Algorithm (QAOA), as an outstanding Variational Quantum Algorithm (VQA), shows great potential in solving combinatorial optimization problems. Classical optimization methods play a crucial role in tuning the parameters of quantum circuits, affecting the algorithm’s convergence speed and solution quality. This paper designs and simulates QAOA circuits based on the Qiskit framework, focusing on comparing the performance of three classical optimizers— Adaptive Moment Estimation (Adam), Constrained Optimization BY Linear Approximations (COBYLA), and Simultaneous Perturbation Stochastic Approximation (SPSA)—in parameter optimization. Adam and SPSA perform more stably in deeper circuits, making them suitable for high-dimensional parameter spaces, whereas COBYLA tends to get trapped in local optima and exhibits greater fluctuations under limited iterations. The results further highlight the importance of classical optimizer selection and hyperparameter tuning in enhancing the performance of hybrid quantum–classical optimization algorithms.

International Conference on Machine Learning, Computational Intelligence and Pattern Recognition (MLCIPR)•Dec 19, 2025•0 citations

Quantum approximate optimization via learning-based adaptive optimization

Lixue Cheng, Yuqin Chen, Shi‐Xin Zhang +1 more

Abstract Combinatorial optimization problems are ubiquitous and computationally hard to solve in general. Quantum approximate optimization algorithm (QAOA), one of the most representative quantum-classical hybrid algorithms, is designed to solve combinatorial optimization problems by transforming the discrete optimization problem into a classical optimization problem over continuous circuit parameters. QAOA objective landscape is notorious for pervasive local minima, and its viability significantly relies on the efficacy of the classical optimizer. In this work, we design double adaptive-region Bayesian optimization (DARBO) for QAOA. Our numerical results demonstrate that the algorithm greatly outperforms conventional optimizers in terms of speed, accuracy, and stability. We also address the issues of measurement efficiency and the suppression of quantum noise by conducting the full optimization loop on a superconducting quantum processor as a proof of concept. This work helps to unlock the full power of QAOA and paves the way toward achieving quantum advantage in practical classical tasks.

arXiv:2303.14877•Communications Physics•Mar 6, 2024•65 citations

Quantum Approximate Optimization Algorithm (QAOA) for Solving NP-Hard Problems

Srikanth Kilaru, Thota Sravya Vardhani, Attluri Udaya Lakshmi +2 more

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.

IEEE Nexo-Tech International Conference on Advanced Technologies and Innovations (ICATI)•May 8, 2026•0 citations

Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation

Tom Krüger, Wolfgang Mauerer

The Quantum Approximate Optimisation Algorithm (QAOA) is a widely studied quantum-classical iterative heuristic for combinatorial optimisation. While QAOA targets problems in complexity class NP, the classical optimisation procedure required in every iteration is itself known to be NP-hard. Still, advantage over classical approaches is suspected for certain scenarios, but nature and origin of its computational power are not yet satisfactorily understood. By introducing means of efficiently and accurately approximating the QAOA optimisation landscape from solution space structures, we derive a new algorithmic variant of unit-depth QAOA for two-level Hamiltonians (including all problems in NP): Instead of performing an iterative quantum-classical computation for each input instance, our non-iterative method is based on a quantum circuit that is instance-independent, but problem-specific. It matches or outperforms unit-depth QAOA for key combinatorial problems, despite reduced computational effort. Our approach is based on proving a long-standing conjecture regarding instance-independent structures in QAOA. By ensuring generality, we link existing empirical observations on QAOA parameter clustering to established approaches in theoretical computer science, and provide a sound foundation for understanding the link between structural properties of solution spaces and quantum optimisation.

arXiv:2408.06493•Quantum•Nov 6, 2025•7 citations

Bayesian Optimization for QAOA

Simone Tibaldi, Davide Vodola, Edoardo Tignone +1 more

The Quantum Approximate Optimization Algorithm (QAOA) adopts a hybrid quantum-classical approach to find approximate solutions to variational optimization problems. In fact, it relies on a classical subroutine to optimize the parameters of a quantum circuit. In this work we present a Bayesian optimization procedure to fulfil this optimization task, and we investigate its performance in comparison with other global optimizers. We show that our approach allows for a significant reduction in the number of calls to the quantum circuit, which is typically the most expensive part of the QAOA. We demonstrate that our method works well also in the regime of slow circuit repetition rates, and that few measurements of the quantum ansatz would already suffice to achieve a good estimate of the energy. In addition, we study the performance of our method in the presence of noise at gate level, and we find that for low circuit depths it is robust against noise. Our results suggest that the method proposed here is a promising framework to leverage the hybrid nature of QAOA on the noisy intermediate-scale quantum devices.

arXiv:2209.03824•IEEE Transactions on Quantum Engineering•Jan 1, 2023•30 citations

Quantum-Enhanced Bayesian Optimization with Adaptive Query Strategies

Jincheng Zhang

This paper presents a novel approach to Bayesian Optimization (BO) that leverages quantum computation to significantly accelerate the optimization process. The core idea is to employ a quantum circuit to estimate the gradient of the objective function, providing a richer and potentially more accurate signal for the classical Bayesian optimizer. Crucially, the algorithm incorporates adaptive query strategies, dynamically adjusting its exploration based on the observed interference effects within the quantum circuit. This synergy between classical Bayesian inference and quantum gradient estimation promises enhanced exploration and faster convergence compared to traditional BO methods. We detail the architecture of the proposed algorithm, outlining the quantum circuit design, the Bayesian optimization framework, and the adaptive query strategy. The theoretical analysis suggests a potential improvement in the exploration efficiency, particularly in high-dimensional search spaces. The algorithm's adaptability allows it to overcome challenges often encountered in BO, such as the "curse of dimensionality," leading to improved performance across a range of optimization problems. The method's effectiveness is demonstrated through a conceptual framework and analytical discussion, highlighting the key components and their interactions.

•Sep 2, 2026•0 citations
Quantum Approximate Optimisation Algorithm (QAOA) has emerged as a promising hybrid quantum-classical approach for tackling NP-hard combinatorial optimisation problems by combining quantum and classical computational paradigms. However, efficiently optimising QAOA parameters is notoriously challenging due to the complex, high-dimensional landscapes involved, characterised by numerous local minima and barren plateaus. Bayesian Optimisation (BO) has shown promise in addressing these challenges, yet its effectiveness diminishes significantly with increasing problem dimensionality. In this work, we adopt the Minimum Average Variance Estimation for Bayesian Optimisation (MAVE-BO) method to address this scalability bottleneck. By leveraging the low-dimensional structure inherent in QAOA parameter spaces, our approach improves optimisation efficiency and robustness. We applied our model to a practical power systems problem, optimising eigenvector centrality (EC) in an IEEE 14-bus network. The proposed method demonstrates superior performance in both efficiency and solution quality compared to classical optimisers such as standard Bayesian Optimisation (Vanilla BO), COBYLA, L-BFGS-B, and genetic algorithms. These results underscore the potential of dimensionality-aware BO frameworks for realworld quantum applications in noisy, resource-constrained environments.
Hybrid Quantum–Classical Optimization combines the advantages of quantum computing and classical optimization to address complex combinatorial optimization problems. The Quantum Approximate Optimization Algorithm (QAOA), as an outstanding Variational Quantum Algorithm (VQA), shows great potential in solving combinatorial optimization problems. Classical optimization methods play a crucial role in tuning the parameters of quantum circuits, affecting the algorithm’s convergence speed and solution quality. This paper designs and simulates QAOA circuits based on the Qiskit framework, focusing on comparing the performance of three classical optimizers— Adaptive Moment Estimation (Adam), Constrained Optimization BY Linear Approximations (COBYLA), and Simultaneous Perturbation Stochastic Approximation (SPSA)—in parameter optimization. Adam and SPSA perform more stably in deeper circuits, making them suitable for high-dimensional parameter spaces, whereas COBYLA tends to get trapped in local optima and exhibits greater fluctuations under limited iterations. The results further highlight the importance of classical optimizer selection and hyperparameter tuning in enhancing the performance of hybrid quantum–classical optimization algorithms.
Abstract Combinatorial optimization problems are ubiquitous and computationally hard to solve in general. Quantum approximate optimization algorithm (QAOA), one of the most representative quantum-classical hybrid algorithms, is designed to solve combinatorial optimization problems by transforming the discrete optimization problem into a classical optimization problem over continuous circuit parameters. QAOA objective landscape is notorious for pervasive local minima, and its viability significantly relies on the efficacy of the classical optimizer. In this work, we design double adaptive-region Bayesian optimization (DARBO) for QAOA. Our numerical results demonstrate that the algorithm greatly outperforms conventional optimizers in terms of speed, accuracy, and stability. We also address the issues of measurement efficiency and the suppression of quantum noise by conducting the full optimization loop on a superconducting quantum processor as a proof of concept. This work helps to unlock the full power of QAOA and paves the way toward achieving quantum advantage in practical classical tasks.
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.
The Quantum Approximate Optimisation Algorithm (QAOA) is a widely studied quantum-classical iterative heuristic for combinatorial optimisation. While QAOA targets problems in complexity class NP, the classical optimisation procedure required in every iteration is itself known to be NP-hard. Still, advantage over classical approaches is suspected for certain scenarios, but nature and origin of its computational power are not yet satisfactorily understood. By introducing means of efficiently and accurately approximating the QAOA optimisation landscape from solution space structures, we derive a new algorithmic variant of unit-depth QAOA for two-level Hamiltonians (including all problems in NP): Instead of performing an iterative quantum-classical computation for each input instance, our non-iterative method is based on a quantum circuit that is instance-independent, but problem-specific. It matches or outperforms unit-depth QAOA for key combinatorial problems, despite reduced computational effort. Our approach is based on proving a long-standing conjecture regarding instance-independent structures in QAOA. By ensuring generality, we link existing empirical observations on QAOA parameter clustering to established approaches in theoretical computer science, and provide a sound foundation for understanding the link between structural properties of solution spaces and quantum optimisation.
The Quantum Approximate Optimization Algorithm (QAOA) adopts a hybrid quantum-classical approach to find approximate solutions to variational optimization problems. In fact, it relies on a classical subroutine to optimize the parameters of a quantum circuit. In this work we present a Bayesian optimization procedure to fulfil this optimization task, and we investigate its performance in comparison with other global optimizers. We show that our approach allows for a significant reduction in the number of calls to the quantum circuit, which is typically the most expensive part of the QAOA. We demonstrate that our method works well also in the regime of slow circuit repetition rates, and that few measurements of the quantum ansatz would already suffice to achieve a good estimate of the energy. In addition, we study the performance of our method in the presence of noise at gate level, and we find that for low circuit depths it is robust against noise. Our results suggest that the method proposed here is a promising framework to leverage the hybrid nature of QAOA on the noisy intermediate-scale quantum devices.
This paper presents a novel approach to Bayesian Optimization (BO) that leverages quantum computation to significantly accelerate the optimization process. The core idea is to employ a quantum circuit to estimate the gradient of the objective function, providing a richer and potentially more accurate signal for the classical Bayesian optimizer. Crucially, the algorithm incorporates adaptive query strategies, dynamically adjusting its exploration based on the observed interference effects within the quantum circuit. This synergy between classical Bayesian inference and quantum gradient estimation promises enhanced exploration and faster convergence compared to traditional BO methods. We detail the architecture of the proposed algorithm, outlining the quantum circuit design, the Bayesian optimization framework, and the adaptive query strategy. The theoretical analysis suggests a potential improvement in the exploration efficiency, particularly in high-dimensional search spaces. The algorithm's adaptability allows it to overcome challenges often encountered in BO, such as the "curse of dimensionality," leading to improved performance across a range of optimization problems. The method's effectiveness is demonstrated through a conceptual framework and analytical discussion, highlighting the key components and their interactions.