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

Computational Optimization and Applications

Quantum genetic evolutionary algorithm for discrete and continuous optimization on quantum–classical hybrid computing architectures

Zhenghuan Wang, Xiaojun Wang

Published Aug 21, 2026• 0 citations
Publisher
DOI
10.1007/s10589-026-00825-w

Related papers

A Study of the Effects of Quantum Noise on Hybrid Quantum Genetic Algorithm

Giovanni Acampora, Mario Pignataro, Alessandro Riolo +1 more

Quantum computing is a promising and emerging field of computer science with the potential to improve artificial intelligence techniques, particularly those related to optimization. However, current quantum devices operate in the Noisy Intermediate-Scale Quantum era, in which quantum noise can significantly compromise computational reliability. Evolutionary algorithms are inherently stochastic and may therefore be less sensitive to such noise, or even benefit from it. This study evaluates the performance of a hybrid quantum genetic algorithm on a set of combinatorial and continuous optimization problems under various realistic noise models. The findings demonstrate that quantum noise does not hinder the algorithm's performance and can even enhance its exploratory capabilities in some cases. This suggests that noise-aware quantum evolutionary strategies have the potential to be effective even with today's imperfect quantum hardware.

IEEE International Conference on Quantum Artificial Intelligence (QAI)•Nov 2, 2025•0 citations

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•103 citations

Improving quantum genetic optimization through granular computing

Giovanni Acampora, Autilia Vitiello

Abstract Quantum computers promise to revolutionize the world of computing thanks to some features of quantum mechanics that can enable massive parallelism in computation. This benefit may be particularly relevant in the design of evolutionary algorithms, where the quantum paradigm could support the exploration of multiple regions of the search space in a concurrent way. Although some efforts in this research field are ongoing, the potential of quantum computing is not yet fully expressed due to the limited number of qubits of current quantum processors. This limitation is even more acute when one wants to deal with continuous optimization problems, where the search space is potentially infinite. The goal of this paper is to address this limitation by introducing a hybrid and granular approach to quantum algorithm design, specifically designed for genetic optimization. This approach is defined as hybrid, because it uses a digital computer to evaluate fitness functions, and a quantum processor to evolve the genetic population; moreover, it uses granular computing to hierarchically reduce the size of the search space of a problem, so that good near-optimal solutions can be identified even on small quantum computers. As shown in the experiments, where IBM Q family processors are used, the usage of a granular computation scheme statistically enhances the performance of the state-of-the-art evolutionary algorithm implemented on quantum computers, when it is run to optimize well-known benchmark continuous functions.

Granular Computing•Oct 8, 2022•8 citations

Genetic algorithms as classical optimizer for the Quantum Approximate Optimization Algorithm

Giovanni Acampora, Angela Chiatto, Autilia Vitiello

Applied Soft Computing•Apr 25, 2023•100 citations

A Quantum Genetic Algorithm for Continuous Space Optimization based on Search Space Partition

Junying LI -, Jianrong WU -, Haitao Liu

International Journal of Advancements in Computing Technology•Mar 15, 2012•2 citations

Amplitude-based coding hybrid quantum-inspired evolutionary algorithm

Shengchao Ding

Coding the individual with amplitude,and applying the crossover operator of classical genetic algorithm to the evolutionary goals of quantum-inspired evolutionary algorithm,a hybrid quantum-inspired evolutionary algorithm is proposed.Combining the self-adaptive rotation,defining a self-adaptive mutation operator with respect to mutation degree,and exchanging the information of the evolutionary goals by crossover operator regularly,the novel algorithm avoids converging prematurely and yields high efficiency.Also the algorithm exceeds QEA and CGA when they solve the numerical optimization problems.The Need-in-a-Haystack problem can be figured out perfectly.Additionally,the algorithm’s computing speed is similar to the classical one.

Computer Engineering and Applications Journal•Jan 1, 2007•0 citations
Quantum computing is a promising and emerging field of computer science with the potential to improve artificial intelligence techniques, particularly those related to optimization. However, current quantum devices operate in the Noisy Intermediate-Scale Quantum era, in which quantum noise can significantly compromise computational reliability. Evolutionary algorithms are inherently stochastic and may therefore be less sensitive to such noise, or even benefit from it. This study evaluates the performance of a hybrid quantum genetic algorithm on a set of combinatorial and continuous optimization problems under various realistic noise models. The findings demonstrate that quantum noise does not hinder the algorithm's performance and can even enhance its exploratory capabilities in some cases. This suggests that noise-aware quantum evolutionary strategies have the potential to be effective even with today's imperfect quantum hardware.
Abstract Quantum computers promise to revolutionize the world of computing thanks to some features of quantum mechanics that can enable massive parallelism in computation. This benefit may be particularly relevant in the design of evolutionary algorithms, where the quantum paradigm could support the exploration of multiple regions of the search space in a concurrent way. Although some efforts in this research field are ongoing, the potential of quantum computing is not yet fully expressed due to the limited number of qubits of current quantum processors. This limitation is even more acute when one wants to deal with continuous optimization problems, where the search space is potentially infinite. The goal of this paper is to address this limitation by introducing a hybrid and granular approach to quantum algorithm design, specifically designed for genetic optimization. This approach is defined as hybrid, because it uses a digital computer to evaluate fitness functions, and a quantum processor to evolve the genetic population; moreover, it uses granular computing to hierarchically reduce the size of the search space of a problem, so that good near-optimal solutions can be identified even on small quantum computers. As shown in the experiments, where IBM Q family processors are used, the usage of a granular computation scheme statistically enhances the performance of the state-of-the-art evolutionary algorithm implemented on quantum computers, when it is run to optimize well-known benchmark continuous functions.
Coding the individual with amplitude,and applying the crossover operator of classical genetic algorithm to the evolutionary goals of quantum-inspired evolutionary algorithm,a hybrid quantum-inspired evolutionary algorithm is proposed.Combining the self-adaptive rotation,defining a self-adaptive mutation operator with respect to mutation degree,and exchanging the information of the evolutionary goals by crossover operator regularly,the novel algorithm avoids converging prematurely and yields high efficiency.Also the algorithm exceeds QEA and CGA when they solve the numerical optimization problems.The Need-in-a-Haystack problem can be figured out perfectly.Additionally,the algorithm’s computing speed is similar to the classical one.