Evolving Hogg's Quantum Algorithm Using Linear-Tree GP

Created by W.Langdon from gp-bibliography.bib Revision:1.7917

@InProceedings{leier:2003:gecco,

• author = "Andr{\'e} Leier and Wolfgang Banzhaf",
• title = "Evolving {Hogg's} Quantum Algorithm Using Linear-Tree {GP}",
• booktitle = "Genetic and Evolutionary Computation -- GECCO-2003",
• editor = "E. Cant{\'u}-Paz and J. A. Foster and K. Deb and D. Davis and R. Roy and U.-M. O'Reilly and H.-G. Beyer and R. Standish and G. Kendall and S. Wilson and M. Harman and J. Wegener and D. Dasgupta and M. A. Potter and A. C. Schultz and K. Dowsland and N. Jonoska and J. Miller",
• year = "2003",
• pages = "390--400",
• address = "Chicago",
• publisher_address = "Berlin",
• month = "12-16 " # jul,
• volume = "2723",
• series = "LNCS",
• ISBN = "3-540-40602-6",
• publisher = "Springer-Verlag",
• keywords = "genetic algorithms, genetic programming, DNA, Molecular, and Quantum Computing",
• DOI = "doi:10.1007/3-540-45105-6_48",
• 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.",
• notes = "GECCO-2003. A joint meeting of the twelfth International Conference on Genetic Algorithms (ICGA-2003) and the eighth Annual Genetic Programming Conference (GP-2003)",

}

Genetic Programming entries for Andre Leier Wolfgang Banzhaf

Citations