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

Applied Soft Computing

Genetic algorithms as classical optimizer for the Quantum Approximate Optimization Algorithm

Giovanni Acampora, Angela Chiatto, Autilia Vitiello

Published Apr 25, 2023• 107 citations
Publisher
DOI
10.1016/j.asoc.2023.110296

Related papers

An improved adaptive quantum genetic algorithm as classical optimizer for the quantum approximate optimization algorithm on MaxCut problem

Yu Zhang, Jing Zhao, Yanguo Jia +1 more

Quantum Information Processing•Jul 12, 2025•5 citations

Genetic Algorithm-based QAOA Training improved with Fuzzy Clustering

Giovanni Acampora, Angela Chiatto, Autilia Vitiello

The Quantum Approximate Optimization Algorithm (QAOA) is emerging as a key method in quantum optimization. Operating within the framework of variational quantum circuits, QAOA entails training a parameterized quantum circuit through classical optimizers to effectively address combinatorial optimization problems. In this context, evolutionary algorithms such as genetic algorithms are emerging as suitable methodologies to search the optimal parameters for QAOA circuits. However, unfortunately, the training process results in a computationally intensive task, and, as a consequence, it is crucial to explore innovative strategies to address this issue. This work introduces a novel approach based on Fuzzy C-means algorithm to opportunely initialize the population of the genetic algorithms employed as optimizers for QAOA and, as a consequence, enhance the training. Experimental results demonstrate that the proposed approach significantly improves the performance of genetic algorithms-based training for QAOA.

•Mar 17, 2025•0 citations

Improve the Quantum Approximate Optimization Algorithm with Genetic Algorithm

Nguyen Ha Huy Phuc, Anh Son Ta, Viết Hùng Nguyễn

The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum optimization technique used for solving combinatorial optimization problems. However, in constrained binary optimization, QAOA’s reliance on equal initial probabilities for all solutions can lead to suboptimal outcomes. To enhance the performance of QAOA in this context, we propose a novel approach that combines QAOA with genetic algorithms. In this hybrid approach, the results obtained from QAOA serve as the initial population for a genetic algorithm. We apply this methodology to address the k-heaviest subgraph problem, a critical challenge in quantum computing research. Our experiments, conducted on benchmark datasets, demonstrate a significant improvement in solution quality.

International Symposium on Information and Communication Technology•Dec 6, 2023•1 citation

Hybrid genetic algorithm based on quantum computing for numerical optimization and parameter estimation

Ling Wang, Fang Tang, Hao Wu

Applied Mathematics and Computation•Mar 31, 2005•104 citations

Quantum approximate optimization algorithm: a review study and problems

Laith Abualigah, Saif AlNajdawi, Abiodun Motunrayo Ikotun +7 more

Elsevier eBooks•Jan 1, 2024•18 citations

A Comparative Study of Hybrid Quantum and Classical Genetic Algorithms in Portfolio Optimization

Romeu Rossi Junior, José Augusto Miranda Nacif, Leonardo Antônio Mendes Souza +1 more

This work investigates the performance of a Hybrid Quantum Genetic Algorithm (HQGA) compared to a classical Genetic Algorithm (GA) for solving the portfolio optimization problem. Our results indicate that the HQGA converges faster to the optimal solution than its classical counterpart, while also maintaining a higher level of population diversity throughout the optimization process. In addition, the HQGA requires significantly fewer evaluations-to-solution than a brute-force approach to reach the global optimum.

quant-pharXiv:2604.11667•Apr 14, 2026
The Quantum Approximate Optimization Algorithm (QAOA) is emerging as a key method in quantum optimization. Operating within the framework of variational quantum circuits, QAOA entails training a parameterized quantum circuit through classical optimizers to effectively address combinatorial optimization problems. In this context, evolutionary algorithms such as genetic algorithms are emerging as suitable methodologies to search the optimal parameters for QAOA circuits. However, unfortunately, the training process results in a computationally intensive task, and, as a consequence, it is crucial to explore innovative strategies to address this issue. This work introduces a novel approach based on Fuzzy C-means algorithm to opportunely initialize the population of the genetic algorithms employed as optimizers for QAOA and, as a consequence, enhance the training. Experimental results demonstrate that the proposed approach significantly improves the performance of genetic algorithms-based training for QAOA.
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum optimization technique used for solving combinatorial optimization problems. However, in constrained binary optimization, QAOA’s reliance on equal initial probabilities for all solutions can lead to suboptimal outcomes. To enhance the performance of QAOA in this context, we propose a novel approach that combines QAOA with genetic algorithms. In this hybrid approach, the results obtained from QAOA serve as the initial population for a genetic algorithm. We apply this methodology to address the k-heaviest subgraph problem, a critical challenge in quantum computing research. Our experiments, conducted on benchmark datasets, demonstrate a significant improvement in solution quality.
This work investigates the performance of a Hybrid Quantum Genetic Algorithm (HQGA) compared to a classical Genetic Algorithm (GA) for solving the portfolio optimization problem. Our results indicate that the HQGA converges faster to the optimal solution than its classical counterpart, while also maintaining a higher level of population diversity throughout the optimization process. In addition, the HQGA requires significantly fewer evaluations-to-solution than a brute-force approach to reach the global optimum.