Sciweavers

GECCO
2003
Springer

Evolving Hogg's Quantum Algorithm Using Linear-Tree GP

14 years 17 days ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
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.
André Leier, Wolfgang Banzhaf
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where GECCO
Authors André Leier, Wolfgang Banzhaf
Comments (0)