© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:cs/0403003

Genetic Algorithms and Quantum Computation

Gilson Antonio Giraldi, Renato Portugal, Ricardo N. Thess

Published Mar 4, 2004• 20 citations

Abstract

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.

DOI: 10.48550/arxiv.cs/0403003

Related papers

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

QUANTUM CIRCUIT DESIGN BY MEANS OF GENETIC PROGRAMMING ê

Andrei Bãutu, Elena Bãutu

Research in quantum technology has shown that quantum computers can provide dramatic advantages over classical computers for some problems. The efficiency of quantum computing is considered to become so significant that the study of quantum algorithms has attracted widespread interest. Development of quantum algorithms and circuits is difficult for a human researcher, so automatic induction of computer programs by means of genetic programming, which uses almost no auxiliary information on the search space, proved to be useful in generating new quantum algorithms. This approach takes advantage of the intrinsic parallelism of the genetic algorithm and quantum computing parallelism. The paper begins with a brief review on some basic concepts in genetic algorithms and quantum computation. Next, it describes an application of genetic programming for evolving quantum computing circuits.

•Jan 1, 2007•3 citations

QUANTUM CIRCUIT DESIGN BY MEANS OF GENETIC PROGRAMMING

Andrei Bãutu, Elena Bãutu

Research in quantum technology has shown that quantum computers can provide dramatic advantages over classical computers for some problems. The efficiency of quantum computing is considered to become so significant that the study of quantum algorithms has attracted widespread interest. Development of quantum algorithms and circuits is difficult for a human researcher, so automatic induction of computer programs by means of genetic programming, which uses almost no auxiliary information on the search space, proved to be useful in generating new quantum algorithms. This approach takes advantage of the intrinsic parallelism of the genetic algorithm and quantum computing parallelism. The paper begins with a brief review on some basic concepts in genetic algorithms and quantum computation. Next, it describes an application of genetic programming for evolving quantum computing circuits.

•Jan 1, 2006•6 citations

A Review on Applications of Improved Quantum Genetic Algorithms

LUCAS APABLAZA, Iván Oyarzún Rojas, Ian Rossi A +1 more

This survey presents a comprehensive analysis of the Improved Quantum Genetic Algorithm (IQGA), an interesting way of applying quantum computing to genetic algorithms (GAs). The study begins with an introduction to the several variants of Quantum Genetic Algorithm (QGA), which are widely used in different applications of GAs. The article introduces the IQGA as a quantum version of the classical GA, detailing how it leverages quantum parallelism and superposition to reduce the time complexity of the genetic operations, and highlighting its crucial role in quantum algorithms. The analysis also addresses the mathematical foundations of the IQGA, and the key advantages and challenges associated with its use in several applications. Finally, it concludes with an exploration of the current and potential applications of IQGA and common characteristics of several implementations of IQGAs.

IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON)•Oct 28, 2025•0 citations

Implementing quantum genetic algorithms

Mihai Udrescu, Lucian Prodan, Mircea Vlăduţiu

This paper presents a new methodology for running Genetic Algorithms on a Quantum Computer. To the best of our knowledge and according to reference [6]there are no feasible solutions for the implementation of the Quantum Genetic Algorithms (QGAs). We present a new perspective on how to build the corresponding QGA architecture. It turns out that the genetic strategy is not particularly helpful in our quantum computation approach; therefore our solution consists of designing a special-purpose oracle that will work with a modified version of an already known algorithm (maximum finding [1]), in order to reduce the QGAs to a Grover search. Quantum computation offers incentives for this approach, due to the fact that the qubit representation of the chromosome can encode the entire population as a superposition of basis-state values.

ACM International Conference on Computing Frontiers (CF)•May 3, 2006•35 citations

ADVANCES IMPROVED QUANTUM GENETIC ALGORITHMS: METHODS, IMPACT AND FUTURE CHALLENGES

LUCAS APABLAZA, Ignacio Rojas, IAN ROSSI +1 more

This survey presents a comprehensive analysis of the Improved Quantum Genetic Algorithm (IQGA), an interesting way of applying quantum computing to genetic algorithms (GAs). The study begins with an introduction to the several variants of Quantum Genetic Algorithm (QGA), which are widely used in different applications of GAs. The article introduces the IQGA as a quantum version of the classical GA, detailing how it leverages quantum parallelism and superposition to reduce the time complexity of the genetic operations, and highlighting its crucial role in quantum algorithms. The analysis also addresses the mathematical foundations of the IQGA, and the key advantages and challenges associated with its use in several applications. Finally, it concludes with an exploration of the current and potential applications of IQGA and common characteristics of several implementations of IQGAs. Keywords: QGA, IQGA, GA.

DYNA•Nov 1, 2025•0 citations

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.

Research in quantum technology has shown that quantum computers can provide dramatic advantages over classical computers for some problems. The efficiency of quantum computing is considered to become so significant that the study of quantum algorithms has attracted widespread interest. Development of quantum algorithms and circuits is difficult for a human researcher, so automatic induction of computer programs by means of genetic programming, which uses almost no auxiliary information on the search space, proved to be useful in generating new quantum algorithms. This approach takes advantage of the intrinsic parallelism of the genetic algorithm and quantum computing parallelism. The paper begins with a brief review on some basic concepts in genetic algorithms and quantum computation. Next, it describes an application of genetic programming for evolving quantum computing circuits.

Research in quantum technology has shown that quantum computers can provide dramatic advantages over classical computers for some problems. The efficiency of quantum computing is considered to become so significant that the study of quantum algorithms has attracted widespread interest. Development of quantum algorithms and circuits is difficult for a human researcher, so automatic induction of computer programs by means of genetic programming, which uses almost no auxiliary information on the search space, proved to be useful in generating new quantum algorithms. This approach takes advantage of the intrinsic parallelism of the genetic algorithm and quantum computing parallelism. The paper begins with a brief review on some basic concepts in genetic algorithms and quantum computation. Next, it describes an application of genetic programming for evolving quantum computing circuits.

This survey presents a comprehensive analysis of the Improved Quantum Genetic Algorithm (IQGA), an interesting way of applying quantum computing to genetic algorithms (GAs). The study begins with an introduction to the several variants of Quantum Genetic Algorithm (QGA), which are widely used in different applications of GAs. The article introduces the IQGA as a quantum version of the classical GA, detailing how it leverages quantum parallelism and superposition to reduce the time complexity of the genetic operations, and highlighting its crucial role in quantum algorithms. The analysis also addresses the mathematical foundations of the IQGA, and the key advantages and challenges associated with its use in several applications. Finally, it concludes with an exploration of the current and potential applications of IQGA and common characteristics of several implementations of IQGAs.

This paper presents a new methodology for running Genetic Algorithms on a Quantum Computer. To the best of our knowledge and according to reference [6]there are no feasible solutions for the implementation of the Quantum Genetic Algorithms (QGAs). We present a new perspective on how to build the corresponding QGA architecture. It turns out that the genetic strategy is not particularly helpful in our quantum computation approach; therefore our solution consists of designing a special-purpose oracle that will work with a modified version of an already known algorithm (maximum finding [1]), in order to reduce the QGAs to a Grover search. Quantum computation offers incentives for this approach, due to the fact that the qubit representation of the chromosome can encode the entire population as a superposition of basis-state values.

This survey presents a comprehensive analysis of the Improved Quantum Genetic Algorithm (IQGA), an interesting way of applying quantum computing to genetic algorithms (GAs). The study begins with an introduction to the several variants of Quantum Genetic Algorithm (QGA), which are widely used in different applications of GAs. The article introduces the IQGA as a quantum version of the classical GA, detailing how it leverages quantum parallelism and superposition to reduce the time complexity of the genetic operations, and highlighting its crucial role in quantum algorithms. The analysis also addresses the mathematical foundations of the IQGA, and the key advantages and challenges associated with its use in several applications. Finally, it concludes with an exploration of the current and potential applications of IQGA and common characteristics of several implementations of IQGAs. Keywords: QGA, IQGA, GA.