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

International Conference on Decision Aid Sciences and Applications (DASA)

The Impact Of Quantum Computing In Evolutionary Algorithms

Djalila Belkebir, Abdelhai Lati, Malak Belkebir

Published Sep 16, 2023• 2 citations
Publisher

Abstract

Genetic algorithms are widely used for solving optimization problems. As the search space of the problem is augmented, the probability of falling into local minima will be augmented as well. Previous works showed that the adjusted phase (i.e. required modification per generation), may enhance badly the optimality reaching. Moreover, the search for suitable probabilities on crossover and mutation results in huge computational complexity. Recent developments in quantum technology have shown that quantum computers can provide a dramatic advantage over classical computers. This paper will be oriented toward computer scientists interested in the quantum genetic algorithm (QGA). Therefore, we will present a discussion, of the pros, and cons of classical GA. We survey the “state of the art” of the most known techniques for evolving evolutionary algorithms and quantum computing. We intend in this work to help researchers and application developers in gaining insights into the power of quantum computing mechanisms. This science can inherently treat the balance between exploration and exploitation of the search space. This property is due to the use of Q-bits. The orientation toward the best solution is due to the use of Q-gates.

DOI
10.1109/dasa59624.2023.10286754

Related papers

Genetic Algorithms and Quantum Computation

Gilson Antonio Giraldi, Renato Portugal, Ricardo N. Thess

Recently, researchers have applied genetic algorithms (GAs) to address some problems in quantum computation. Also, there has been some works in the designing of genetic algorithms based on quantum theoretical concepts and techniques. The so called Quantum Evolutionary Programming has two major sub-areas: Quantum Inspired Genetic Algorithms (QIGAs) and Quantum Genetic Algorithms (QGAs). The former adopts qubit chromosomes as representations and employs quantum gates for the search of the best solution. The later tries to solve a key question in this field: what GAs will look like as an implementation on quantum hardware? As we shall see, there is not a complete answer for this question. An important point for QGAs is to build a quantum algorithm that takes advantage of both the GA and quantum computing parallelism as well as true randomness provided by quantum computers. In the first part of this paper we present a survey of the main works in GAs plus quantum computing including also our works in this area. Henceforth, we review some basic concepts in quantum computation and GAs and emphasize their inherent parallelism. Next, we review the application of GAs for learning quantum operators and circuit design. Then, quantum evolutionary programming is considered. Finally, we present our current research in this field and some perspectives.

arXiv:cs/0403003•Mar 4, 2004•22 citations

Quantum Genetic Algorithms for Computer Scientists

Rafael Lahoz-Beltrá

Genetic algorithms (GAs) are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quantum-mechanical phenomena to perform operations on data) has led to a new class of GAs known as “Quantum Genetic Algorithms” (QGAs). In this review, we present a discussion, future potential, pros and cons of this new class of GAs. The review will be oriented towards computer scientists interested in QGAs “avoiding” the possible difficulties of quantum-mechanical phenomena.

Computers•Oct 15, 2016•134 citations

Comparison of Genetic Algorithm and Quantum Genetic Algorithm

Zakaria Laboudi, Salim Chıkhı

Abstract: Evolving solutions rather than computing them certainly represents a promising programming approach. Evolutionary computation has already been known in computer science since more than 4 decades. More recently, another alternative of evolutionary algorithms was invented: Quantum Genetic Algorithms (QGA). In this paper, we outline the approach of QGA by giving a comparison with Conventional Genetic Algorithm (CGA). Our results have shown that QGA can be a very promising tool for exploring search spaces.

The International Arab Journal of Information Technology•Jan 1, 2012•68 citations

Optimization with Quantum Genetic Algorithm

Bhaskar Das, Utpal Roy

Recent development in quantum technology have shown that quan-tum computer can provide a dramatic advantage over classical com-puters for some algorithms. In particular, a polynomial-time algo-rithm for factoring, a problem which was previously thought to be hard for classical computers, has recently been developed [13]. Similarly, a quantum algorithm searching for unsorted database in square root of time it would take on a classical computer has also been described by Grover [4]- [3]. Both algorithms rely upon the inherent parallelism, superposition and entanglement property of quantum computing to achieve their improvements. Since most problems of real interest for genetic algorithms have a vast search space, it seems appropriate how quantum parallelism can be ap-plied to Genetic Algorithms. In this paper we provide a brief back-ground of quantum computers. We explain why and how quan-tum algorithms provides a fundamental improvements over classi-cal ones for some problems. Further, we present here the Conven-tional Genetic Algorithm and the quantum approach of Genetical Algorithms(QGA) as well. The benefits and drawbacks of QGA are also analyzed. Moreover, this paper provides an improved version over the con-ventional QGA. This improvement originates from the best partial immigration technique applied to the quantum chromosomes. The main objective of the best partial immigration is to consider the string of qubits from the quantum chromosomes having best fit-ness and transfer the same randomly to the chromosomes of next generation for better mixing. The process is reiterated. To observe the performance the best partial immigration technique we have considered some popular optimization problems and performed the experiment on it. These problems are namely Travelling Salesman Problem(TSP), Binpacking Problem and Vertex Cover Problem. It has been observed that the obtained results outperforms the con-ventional QGA. 1.

International Journal of Computer Applications•Sep 18, 2014•18 citations

A Review of Quantum-Inspired Genetic Algorithms

Rupali Mitra, Tamal Chakraborty, Romit S. Beed

By violating the extended Church-Turing thesis, the quantum computing (QC) paradigm has emerged as a serious contender to classical computing. We now know that certain classical exponential problems (NP (nondeterministic polynomial time)-complete) can be solved in polynomial time by QC. Shor’s integer factorization and Grover’s method for unstructured search are perhaps the most well-known quantum algorithms. QC has been successfully applied to a variety of domains including optimization problems. Optimization can be solved by using deterministic/numerical as well as stochastic methods. Genetic algorithms (GA) belong to the latter category. Incorporating quantum mechanical properties such as superposition, entanglement, interference into the structure of GA has resulted in a more efficient evolutionary computing method called the quantum-inspired genetic algorithm. This method has been successfully applied to image processing, signal processing, economic load dispatch, coalition formation, task scheduling, etc. This chapter presents an overview of the current trends and developments in the domain of quantum-inspired genetic algorithms with the aim of investigating areas of further research in this sphere.

Apple Academic Press eBooks•Feb 19, 2026•0 citations

Quantum-Enhanced Genetic Algorithms for Complex Optimization

Jincheng Zhang

This paper presents a novel approach to complex optimization problems utilizing a hybrid Genetic Algorithm (GA) enhanced with quantum computing techniques. Classical GAs often struggle with slow convergence rates in high-dimensional search spaces. This research addresses this limitation by integrating quantum superposition and interference into the core operations of the GA, specifically crossover and mutation. The proposed method, termed Quantum-Enhanced Genetic Algorithm (Q-GA), aims to significantly accelerate the optimization process by exploring the solution space more efficiently. The core idea is to represent potential solutions within a quantum state, allowing for parallel exploration facilitated by superposition. We detail the architecture of the Q-GA, outlining the integration of classical GA components with quantum algorithms. The performance of the Q-GA is theoretically analyzed, focusing on the potential speedup achievable through quantum computation. The results presented demonstrate the promise of this hybrid approach for tackling computationally intensive optimization problems where classical GAs fall short.

•Sep 6, 2026•0 citations
Genetic algorithms are widely used for solving optimization problems. As the search space of the problem is augmented, the probability of falling into local minima will be augmented as well. Previous works showed that the adjusted phase (i.e. required modification per generation), may enhance badly the optimality reaching. Moreover, the search for suitable probabilities on crossover and mutation results in huge computational complexity. Recent developments in quantum technology have shown that quantum computers can provide a dramatic advantage over classical computers. This paper will be oriented toward computer scientists interested in the quantum genetic algorithm (QGA). Therefore, we will present a discussion, of the pros, and cons of classical GA. We survey the “state of the art” of the most known techniques for evolving evolutionary algorithms and quantum computing. We intend in this work to help researchers and application developers in gaining insights into the power of quantum computing mechanisms. This science can inherently treat the balance between exploration and exploitation of the search space. This property is due to the use of Q-bits. The orientation toward the best solution is due to the use of Q-gates.
Recently, researchers have applied genetic algorithms (GAs) to address some problems in quantum computation. Also, there has been some works in the designing of genetic algorithms based on quantum theoretical concepts and techniques. The so called Quantum Evolutionary Programming has two major sub-areas: Quantum Inspired Genetic Algorithms (QIGAs) and Quantum Genetic Algorithms (QGAs). The former adopts qubit chromosomes as representations and employs quantum gates for the search of the best solution. The later tries to solve a key question in this field: what GAs will look like as an implementation on quantum hardware? As we shall see, there is not a complete answer for this question. An important point for QGAs is to build a quantum algorithm that takes advantage of both the GA and quantum computing parallelism as well as true randomness provided by quantum computers. In the first part of this paper we present a survey of the main works in GAs plus quantum computing including also our works in this area. Henceforth, we review some basic concepts in quantum computation and GAs and emphasize their inherent parallelism. Next, we review the application of GAs for learning quantum operators and circuit design. Then, quantum evolutionary programming is considered. Finally, we present our current research in this field and some perspectives.
Genetic algorithms (GAs) are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quantum-mechanical phenomena to perform operations on data) has led to a new class of GAs known as “Quantum Genetic Algorithms” (QGAs). In this review, we present a discussion, future potential, pros and cons of this new class of GAs. The review will be oriented towards computer scientists interested in QGAs “avoiding” the possible difficulties of quantum-mechanical phenomena.
Abstract: Evolving solutions rather than computing them certainly represents a promising programming approach. Evolutionary computation has already been known in computer science since more than 4 decades. More recently, another alternative of evolutionary algorithms was invented: Quantum Genetic Algorithms (QGA). In this paper, we outline the approach of QGA by giving a comparison with Conventional Genetic Algorithm (CGA). Our results have shown that QGA can be a very promising tool for exploring search spaces.
Recent development in quantum technology have shown that quan-tum computer can provide a dramatic advantage over classical com-puters for some algorithms. In particular, a polynomial-time algo-rithm for factoring, a problem which was previously thought to be hard for classical computers, has recently been developed [13]. Similarly, a quantum algorithm searching for unsorted database in square root of time it would take on a classical computer has also been described by Grover [4]- [3]. Both algorithms rely upon the inherent parallelism, superposition and entanglement property of quantum computing to achieve their improvements. Since most problems of real interest for genetic algorithms have a vast search space, it seems appropriate how quantum parallelism can be ap-plied to Genetic Algorithms. In this paper we provide a brief back-ground of quantum computers. We explain why and how quan-tum algorithms provides a fundamental improvements over classi-cal ones for some problems. Further, we present here the Conven-tional Genetic Algorithm and the quantum approach of Genetical Algorithms(QGA) as well. The benefits and drawbacks of QGA are also analyzed. Moreover, this paper provides an improved version over the con-ventional QGA. This improvement originates from the best partial immigration technique applied to the quantum chromosomes. The main objective of the best partial immigration is to consider the string of qubits from the quantum chromosomes having best fit-ness and transfer the same randomly to the chromosomes of next generation for better mixing. The process is reiterated. To observe the performance the best partial immigration technique we have considered some popular optimization problems and performed the experiment on it. These problems are namely Travelling Salesman Problem(TSP), Binpacking Problem and Vertex Cover Problem. It has been observed that the obtained results outperforms the con-ventional QGA. 1.
By violating the extended Church-Turing thesis, the quantum computing (QC) paradigm has emerged as a serious contender to classical computing. We now know that certain classical exponential problems (NP (nondeterministic polynomial time)-complete) can be solved in polynomial time by QC. Shor’s integer factorization and Grover’s method for unstructured search are perhaps the most well-known quantum algorithms. QC has been successfully applied to a variety of domains including optimization problems. Optimization can be solved by using deterministic/numerical as well as stochastic methods. Genetic algorithms (GA) belong to the latter category. Incorporating quantum mechanical properties such as superposition, entanglement, interference into the structure of GA has resulted in a more efficient evolutionary computing method called the quantum-inspired genetic algorithm. This method has been successfully applied to image processing, signal processing, economic load dispatch, coalition formation, task scheduling, etc. This chapter presents an overview of the current trends and developments in the domain of quantum-inspired genetic algorithms with the aim of investigating areas of further research in this sphere.
This paper presents a novel approach to complex optimization problems utilizing a hybrid Genetic Algorithm (GA) enhanced with quantum computing techniques. Classical GAs often struggle with slow convergence rates in high-dimensional search spaces. This research addresses this limitation by integrating quantum superposition and interference into the core operations of the GA, specifically crossover and mutation. The proposed method, termed Quantum-Enhanced Genetic Algorithm (Q-GA), aims to significantly accelerate the optimization process by exploring the solution space more efficiently. The core idea is to represent potential solutions within a quantum state, allowing for parallel exploration facilitated by superposition. We detail the architecture of the Q-GA, outlining the integration of classical GA components with quantum algorithms. The performance of the Q-GA is theoretically analyzed, focusing on the potential speedup achievable through quantum computation. The results presented demonstrate the promise of this hybrid approach for tackling computationally intensive optimization problems where classical GAs fall short.