Comparison of Selection Strategies for Evolutionary Quantum Circuit Design

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.

• Type: Conference
• Year: 2004
• Where: GECCO
• Authors: André Leier, Wolfgang Banzhaf
• Keywords: Different Selection Strategies, GECCO 2004, Huge Search Spaces, Quantum Circuits