%0 Report %1 Giraldi:2004:0403003 %A Giraldi, Gilson A. %A Portugal, Renato %A Thess, Ricardo N. %D 2004 %K Computing, Evolutionary Quantum Strategies algorithms, genetic programming, %N 0403003 %T Genetic Algorithms and Quantum Computation %U http://arxiv.org/pdf/cs.NE/0403003 %X 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 emphasise 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.

@techreport{Giraldi:2004:0403003, 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 emphasise 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.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Giraldi, Gilson A. and Portugal, Renato and Thess, Ricardo N.}, biburl = {https://www.bibsonomy.org/bibtex/2646f07f4df84533faf5d0483f4054064/brazovayeye}, institution = {National Laboratory for Scientific Computing, Petropolis, RJ, Brazil}, interhash = {15eda39a1a81418db74bbf1056bea7c9}, intrahash = {646f07f4df84533faf5d0483f4054064}, keywords = {Computing, Evolutionary Quantum Strategies algorithms, genetic programming,}, number = 0403003, size = {27 pages}, timestamp = {2008-06-19T17:40:19.000+0200}, title = {Genetic Algorithms and Quantum Computation}, url = {http://arxiv.org/pdf/cs.NE/0403003}, year = 2004 }