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

Genetic and Evolutionary Computation Conference (GECCO)

Quantum evolutionary programming

Bart Rylander, Terry Soule, James A. Foster, Jim Alves-Foss

Published Jul 7, 2001• 29 citations
OpenAlex

Abstract

Recent developments in quantum technology have shown that quantum computers can provide dramatic advantages over classical computers for some problems [1] [2]. These quantum algorithms rely upon the inherent parallel qualities of quantum computers to achieve their improvement. In this paper we provide a brief background of quantum computers. We present a simple quantum approach to genetic algorithms and analyze its benefits and drawbacks. We describe the quantum advantage of true randomness. We show that in some cases, such as program induction, there is a measurable difference [3]. These algorithms are significant because to date there are only a handful of quantum algorithms that take advantage of quantum parallelism [4] and none that show an advantage due to true randomness. Finally, we provide ideas for directions of future research.

Related papers

Quantum genetic algorithms

Bart Rylander, Terry Soule, James A. Foster +1 more

Recent developments in quantum technology have shown that quantum computers can provide a dramatic advantage over classical computers for some algorithms. Since most problems of real interest for genetic algorithms (GAs) have a vast search space [Holland, 1975], it seems appropriate to consider how quantum parallelism can be applied to GAs. In this paper we present a simple quantum approach to genetic algorithms and analyze its benefits and drawbacks. This is significant because to date there are only a handful of quantum algorithms [Williams and Clearwater, 1997].

Genetic and Evolutionary Computation Conference (GECCO)•Jul 10, 2000•25 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

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

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

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 Computing Applications of Genetic Programming

Quantum computers are computational devices that use the dynamics of atomic-scale objects to store and manipulate information.Only a few, small-scale quantum computers have been built to date, but quantum computers can in principle outperform all possible classical computers in significant ways.Quantum computation is therefore a subject of considerable theoretical interest that may also have practical applications in the future.Genetic programming can automatically discover new algorithms for quantum computers [Spector et al., 1998].We describe how to simulate a quantum computer so that the fitness of a quantum algorithm can be determined on classical hardware.We then describe ways in which three different genetic programming approaches can drive the simulator to evolve new quantum algorithms.The approaches are standard tree-based genetic programming, stack-based linear genome genetic programming, and stackless linear genome genetic programming.We demonstrate the techniques on four different problems: the two-bit early promise problem, the scaling majority-on problem, the four-item database search problem, and the two-bit and-or problem.For three of these problems (all but majority-on) the automatically discovered algorithms are more efficient than any possible classical algorithms for the same problems.One of the better-than-classical algorithms (for the two-bit and-or problem) is in fact more efficient than any previously known quantum algorithm for the same problem, suggesting that genetic programming may be a valuable tool in the future study of quantum programming.

The MIT Press eBooks•Jan 1, 1999•71 citations
Recent developments in quantum technology have shown that quantum computers can provide dramatic advantages over classical computers for some problems [1] [2]. These quantum algorithms rely upon the inherent parallel qualities of quantum computers to achieve their improvement. In this paper we provide a brief background of quantum computers. We present a simple quantum approach to genetic algorithms and analyze its benefits and drawbacks. We describe the quantum advantage of true randomness. We show that in some cases, such as program induction, there is a measurable difference [3]. These algorithms are significant because to date there are only a handful of quantum algorithms that take advantage of quantum parallelism [4] and none that show an advantage due to true randomness. Finally, we provide ideas for directions of future research.
Recent developments in quantum technology have shown that quantum computers can provide a dramatic advantage over classical computers for some algorithms. Since most problems of real interest for genetic algorithms (GAs) have a vast search space [Holland, 1975], it seems appropriate to consider how quantum parallelism can be applied to GAs. In this paper we present a simple quantum approach to genetic algorithms and analyze its benefits and drawbacks. This is significant because to date there are only a handful of quantum algorithms [Williams and Clearwater, 1997].
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.
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.
Quantum computers are computational devices that use the dynamics of atomic-scale objects to store and manipulate information.Only a few, small-scale quantum computers have been built to date, but quantum computers can in principle outperform all possible classical computers in significant ways.Quantum computation is therefore a subject of considerable theoretical interest that may also have practical applications in the future.Genetic programming can automatically discover new algorithms for quantum computers [Spector et al., 1998].We describe how to simulate a quantum computer so that the fitness of a quantum algorithm can be determined on classical hardware.We then describe ways in which three different genetic programming approaches can drive the simulator to evolve new quantum algorithms.The approaches are standard tree-based genetic programming, stack-based linear genome genetic programming, and stackless linear genome genetic programming.We demonstrate the techniques on four different problems: the two-bit early promise problem, the scaling majority-on problem, the four-item database search problem, and the two-bit and-or problem.For three of these problems (all but majority-on) the automatically discovered algorithms are more efficient than any possible classical algorithms for the same problems.One of the better-than-classical algorithms (for the two-bit and-or problem) is in fact more efficient than any previously known quantum algorithm for the same problem, suggesting that genetic programming may be a valuable tool in the future study of quantum programming.