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.
In REF a linear-tree GP scheme was successfully applied to evolve a scalable quantum algorithm for 1-SAT, analogous to Hogg's algorithm.
Evolving Hogg’s quantum algorithm using linear tree
Procedings of the Genetic and Evolutionary Computation Conference, Part I.Volume 2723 of LNCS.,Springer
Computer Science