Evolving Hogg's Quantum Algorithm Using Linear-Tree GP

Download PDF
Open Webpage

André Leier, Wolfgang Banzhaf

Published: 2003, Last Modified: 28 Feb 2026GECCO 2003EveryoneRevisionsBibTeXCC BY-SA 4.0
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.