 |
    |
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
André Leier and Wolfgang Banzhaf
University of Dortmund,
Dept. of Computer Science,
Chair of Systems Analysis,
44221 Dortmund, Germany
{andre.leier,wolfgang.banzhaf}@cs.uni-dortmund.de
Abstract. Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In this paper a Genetic Programming system based on linear-tree genome structures developed for the purpose of automatic quantum circuit design is introduced. It was applied to instances of the 1-SAT problem, resulting in evidently and "visibly" scalable quantum algorithms, which correspond to Hogg's quantum algorithm.
LNCS 2723, p. 390 ff.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003