Quantum Genetic Algorithms

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].

[1]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[2]  Christof Zalka.  Simulating quantum systems on a quantum computer , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[3]  R. Jozsa.  Characterizing classes of functions computable by quantum parallelism , 1991, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Martin Gennis,et al.  Explorations in Quantum Computing , 2001, Künstliche Intell..

[6]  Christof Zalka.  Efficient Simulation of Quantum Systems by Quantum Computers , 1996, quant-ph/9603026.

[7]  Seth Lloyd,et al.  Universal Quantum Simulators , 1996, Science.

[8]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[9]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  David E. Goldberg,et al.  Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.

[11]  Carol A. Ankenbrandt.  An Extension to the Theory of Convergence and a Proof of the Time Complexity of Genetic Algorithms , 1990, FOGA.

[12]  James A. Foster,et al.  GA Hard Problems , 2000, GECCO.