 |
    |
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
André Leier1 and Wolfgang Banzhaf2
1Dept. of Computer Science, University of Dortmund, 44221 Dortmund, Germany
andre.leier@cs.uni-dortmund.de
2Dept. of Computer Science, Memorial University of Newfoundland, St. John’s, NL, A1C 5S7 Canada
banzhaf@cs.mun.ca
Abstract. Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper we analyze different selection strategies, which are applied to the Deutsch-Jozsa problem and the 1-SAT problem using our GP system. Furthermore, we show the effects of adding randomness to the selection mechanism of a (1,10) selection strategy. It can be demonstrated that this boosts the evolution of quantum algorithms on particular problems.
LNCS 3103, p. 557 ff.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2004