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:2503.22404 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Avoiding Convergence Stagnation in a Quantum Circuit Evolutionary Framework Through an Adaptive Cost Function

Bruno O. Fernandez, Rodrigo Bloot, Marcelo Albano Moret

Published Aug 30, 2025• 1 citation
arXivHTMLPDF

Abstract

Binary optimization problems are emerging as potential candidates for useful applications of quantum computing. Among quantum algorithms, the quantum approximate optimization algorithm (QAOA) is currently considered the most promising method to obtain a quantum advantage for such problems. The QAOA method uses a classical counterpart to perform optimization in a hybrid approach. In this paper, we show that the recently introduced method called quantum circuit evolutionary (QCE) also has potential for applications in binary optimization problems. This methodology is classical optimizer-free, but, for some scenarios, may have convergence stagnation as a consequence of smooth circuit modifications at each generation. To avoid this drawback and accelerate the convergence capabilities of QCE, we introduce a framework using an adaptive cost function (ACF), which varies dynamically with the circuit evolution. This procedure accelerates the convergence of the method. Applying this new approach to instances of the set partitioning problem, we show that QCE-ACF achieves convergence performance identical to QAOA but with a shorter execution time. Finally, experiments in the presence of induced noise show that this framework is quite suitable for the noisy intermediate-scale quantum era.

DOI
10.1109/qce65121.2025.00215

Related papers

Quantum-Inspired Evolutionary Algorithms for Circuit Optimization

Jincheng Zhang

This paper explores the application of quantum-inspired evolutionary algorithms (QIEAs) to the optimization of quantum circuits. Traditional evolutionary algorithms (EAs) often face challenges in efficiently navigating the complex design space inherent in quantum circuit design. This work proposes a novel approach that leverages quantum-inspired operators – superposition and quantum tunneling – within an adaptive evolutionary framework. The core idea is to mimic key quantum mechanical phenomena to enhance exploration capabilities and accelerate convergence. The algorithm is designed to dynamically adjust its search strategy based on the current state of the population, fostering a more targeted and effective exploration of the circuit design landscape. We demonstrate the potential of this approach to significantly improve the performance of circuit optimization, particularly in scenarios where conventional EAs struggle to find optimal solutions within reasonable computational time. The theoretical framework and the proposed algorithm are presented, followed by a discussion of its potential applications and future research directions.

•Sep 2, 2026•0 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

Toward Quantum Combinatorial Optimization

Yunpyo Hong, Jaejoon Gill, Daeyeun Kim +3 more

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.

IEEE Nanotechnology Magazine•Jan 1, 2026•0 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

Evolutionary quantum feature selection

Anton S. Albino, Otto Menegasso Pires, Mauro Q. Nooblath Neto +1 more

Effective feature selection is essential for enhancing the performance of artificial intelligence models. It involves identifying feature combinations that optimize a given metric, but this is a challenging task due to the problem's exponential time complexity. In this study, we present an innovative heuristic called Evolutionary Quantum Feature Selection (EQFS) that employs the Quantum Circuit Evolution (QCE) algorithm. Our approach harnesses the unique capabilities of QCE, which utilizes shallow depth circuits to generate sparse probability distributions. Our computational experiments demonstrate that EQFS can identify good feature combinations with quadratic scaling in the number of features. To evaluate EQFS's performance, we counted the number of times a given classical model assesses the cost function for a specific metric, as a function of the number of generations.

arXiv:2303.07131•Mar 13, 2023•4 citations

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
Binary optimization problems are emerging as potential candidates for useful applications of quantum computing. Among quantum algorithms, the quantum approximate optimization algorithm (QAOA) is currently considered the most promising method to obtain a quantum advantage for such problems. The QAOA method uses a classical counterpart to perform optimization in a hybrid approach. In this paper, we show that the recently introduced method called quantum circuit evolutionary (QCE) also has potential for applications in binary optimization problems. This methodology is classical optimizer-free, but, for some scenarios, may have convergence stagnation as a consequence of smooth circuit modifications at each generation. To avoid this drawback and accelerate the convergence capabilities of QCE, we introduce a framework using an adaptive cost function (ACF), which varies dynamically with the circuit evolution. This procedure accelerates the convergence of the method. Applying this new approach to instances of the set partitioning problem, we show that QCE-ACF achieves convergence performance identical to QAOA but with a shorter execution time. Finally, experiments in the presence of induced noise show that this framework is quite suitable for the noisy intermediate-scale quantum era.
This paper explores the application of quantum-inspired evolutionary algorithms (QIEAs) to the optimization of quantum circuits. Traditional evolutionary algorithms (EAs) often face challenges in efficiently navigating the complex design space inherent in quantum circuit design. This work proposes a novel approach that leverages quantum-inspired operators – superposition and quantum tunneling – within an adaptive evolutionary framework. The core idea is to mimic key quantum mechanical phenomena to enhance exploration capabilities and accelerate convergence. The algorithm is designed to dynamically adjust its search strategy based on the current state of the population, fostering a more targeted and effective exploration of the circuit design landscape. We demonstrate the potential of this approach to significantly improve the performance of circuit optimization, particularly in scenarios where conventional EAs struggle to find optimal solutions within reasonable computational time. The theoretical framework and the proposed algorithm are presented, followed by a discussion of its potential applications and future research directions.
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.
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.
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.
Effective feature selection is essential for enhancing the performance of artificial intelligence models. It involves identifying feature combinations that optimize a given metric, but this is a challenging task due to the problem's exponential time complexity. In this study, we present an innovative heuristic called Evolutionary Quantum Feature Selection (EQFS) that employs the Quantum Circuit Evolution (QCE) algorithm. Our approach harnesses the unique capabilities of QCE, which utilizes shallow depth circuits to generate sparse probability distributions. Our computational experiments demonstrate that EQFS can identify good feature combinations with quadratic scaling in the number of features. To evaluate EQFS's performance, we counted the number of times a given classical model assesses the cost function for a specific metric, as a function of the number of generations.
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.