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

Apple Academic Press eBooks

A Review of Quantum-Inspired Genetic Algorithms

Rupali Mitra, Tamal Chakraborty, Romit S. Beed

Published Feb 19, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1201/9781998511051-9

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

The Impact Of Quantum Computing In Evolutionary Algorithms

Djalila Belkebir, Abdelhai Lati, Malak Belkebir

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.

International Conference on Decision Aid Sciences and Applications (DASA)•Sep 16, 2023•2 citations

A Comprehensive Review on Quantum-inspired Metaheuristic Algorithms: Basics to Recent Advancements

Sunita Salunke, Anuj Kumar, Sangeeta Pant +1 more

Quantum-inspired metaheuristic approaches, often called QIMAs, basically try to mix quantum computing ideas with the usual metaheuristic search routines. In practice, they make it easier to go through tangled search spaces, and they also help maintain a broader population variety, thanks to probabilistic qubit style encodings. Because of that, these methods have drawn a lot of attention across multiple academic directions, like materials science and engineering optimization, plus areas such as drug development and cryptography. QIMAs deliver a decent alternative by stitching Quantum-inspired mechanisms into algorithms that can run on ordinary classical machines, even if actually building full universal quantum computers is still hard, because quantum states are fragile and need heavy error correction, also the hardware is just plain complicated. Theoretical underpinnings, algorithmic progress and real-world applications of QIMAs are all looked at in depth in this article, sort of in a grounded way. The literature covering primarily 2015 to 2025 is reviewed carefully, then organized by the kind of inspiration it uses, like evolutionary algorithms, swarm intelligence approaches, and also genetic algorithms that are inspired by quantum mechanics in a more direct sense. The studies we examine show quite clearly how QIMAs can be used effectively for things like structural design, image processing, flight control, feature selection, and predictive modeling. The intention behind this review is to offer scholars and practitioners a complete, operationally efficient resource on Quantum-inspired optimization methods, for tackling tricky optimization problems.

International Journal of Mathematical Engineering and Management Sciences•Jul 29, 2026•0 citations

Adaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems

Jyoti Chaturvedi

The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency.This is particularly useful for NP-hard problems such as graph layout problems.Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper focuses on a Quantum Inspired Genetic Algorithm (QIGA) and develops and evaluates adaptive strategies for the same.QIGA adapts ideas of Q-bits, superposition of Q-bits from quantum computing.The effectiveness and the applicability of adaptive QIGA is demonstrated by experimental results on the benchmark Knapsack, Maxcut and Onemax combinatorial optimization problems.The results show that adaptive QIGA is superior to QIGAs.

International Journal of Computer Applications•Dec 18, 2014•3 citations

Quantum-inspired genetic algorithms

A. Narayanan, M. Moore

A novel evolutionary computing method-quantum inspired genetic algorithms-is introduced, where concepts and principles of quantum mechanics are used to inform and inspire more efficient evolutionary computing methods. The basic terminology of quantum mechanics is introduced before a comparison is made between a classical genetic algorithm and a quantum inspired method for the travelling salesperson problem. It is informally shown that the quantum inspired genetic algorithm performs better than the classical counterpart for a small domain. The paper concludes with some speculative comments concerning the relationship between quantum inspired genetic algorithms and various complexity classes.

IEEE Congress on Evolutionary Computation (CEC)•Dec 24, 2002•667 citations

Quantum algorithms

In this chapter, we focus on quantum algorithms and the techniques underlying their construction. These algorithms take advantage of the basic properties of quantum mechanics, from the superposition principle to entanglement and interference effects, to solve certain computational problems much more efficiently than a classical computer. This includes basic problems of computer science: from the search of a marked item in an unstructured database (Grover’s algorithm) to integer factoring (Shor’s algorithm). The latter case provides a striking exponential speedup over the best known classical algorithms. After that, we discuss a third relevant class of quantum algorithms, the simulation of physical systems.

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations
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.
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 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.
Quantum-inspired metaheuristic approaches, often called QIMAs, basically try to mix quantum computing ideas with the usual metaheuristic search routines. In practice, they make it easier to go through tangled search spaces, and they also help maintain a broader population variety, thanks to probabilistic qubit style encodings. Because of that, these methods have drawn a lot of attention across multiple academic directions, like materials science and engineering optimization, plus areas such as drug development and cryptography. QIMAs deliver a decent alternative by stitching Quantum-inspired mechanisms into algorithms that can run on ordinary classical machines, even if actually building full universal quantum computers is still hard, because quantum states are fragile and need heavy error correction, also the hardware is just plain complicated. Theoretical underpinnings, algorithmic progress and real-world applications of QIMAs are all looked at in depth in this article, sort of in a grounded way. The literature covering primarily 2015 to 2025 is reviewed carefully, then organized by the kind of inspiration it uses, like evolutionary algorithms, swarm intelligence approaches, and also genetic algorithms that are inspired by quantum mechanics in a more direct sense. The studies we examine show quite clearly how QIMAs can be used effectively for things like structural design, image processing, flight control, feature selection, and predictive modeling. The intention behind this review is to offer scholars and practitioners a complete, operationally efficient resource on Quantum-inspired optimization methods, for tackling tricky optimization problems.
The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency.This is particularly useful for NP-hard problems such as graph layout problems.Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper focuses on a Quantum Inspired Genetic Algorithm (QIGA) and develops and evaluates adaptive strategies for the same.QIGA adapts ideas of Q-bits, superposition of Q-bits from quantum computing.The effectiveness and the applicability of adaptive QIGA is demonstrated by experimental results on the benchmark Knapsack, Maxcut and Onemax combinatorial optimization problems.The results show that adaptive QIGA is superior to QIGAs.
A novel evolutionary computing method-quantum inspired genetic algorithms-is introduced, where concepts and principles of quantum mechanics are used to inform and inspire more efficient evolutionary computing methods. The basic terminology of quantum mechanics is introduced before a comparison is made between a classical genetic algorithm and a quantum inspired method for the travelling salesperson problem. It is informally shown that the quantum inspired genetic algorithm performs better than the classical counterpart for a small domain. The paper concludes with some speculative comments concerning the relationship between quantum inspired genetic algorithms and various complexity classes.
In this chapter, we focus on quantum algorithms and the techniques underlying their construction. These algorithms take advantage of the basic properties of quantum mechanics, from the superposition principle to entanglement and interference effects, to solve certain computational problems much more efficiently than a classical computer. This includes basic problems of computer science: from the search of a marked item in an unstructured database (Grover’s algorithm) to integer factoring (Shor’s algorithm). The latter case provides a striking exponential speedup over the best known classical algorithms. After that, we discuss a third relevant class of quantum algorithms, the simulation of physical systems.