Exploring the search space of quantum programs

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

@InProceedings{Leier:2003:Etssoqp,
  author =       "Andre Leier and Wolfgang Banzhaf",
  title =        "Exploring the search space of quantum programs",
  booktitle =    "Proceedings of the 2003 Congress on Evolutionary
                 Computation CEC2003",
  editor =       "Ruhul Sarker and Robert Reynolds and 
                 Hussein Abbass and Kay Chen Tan and Bob McKay and Daryl Essam and 
                 Tom Gedeon",
  pages =        "170--177",
  year =         "2003",
  publisher =    "IEEE Press",
  address =      "Canberra",
  publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ
                 08855-1331, USA",
  month =        "8-12 " # dec,
  organisation = "IEEE Neural Network Council (NNC), Engineers Australia
                 (IEAust), Evolutionary Programming Society (EPS),
                 Institution of Electrical Engineers (IEE)",
  volume =       "1",
  keywords =     "genetic algorithms, genetic programming, Circuit
                 synthesis, Computer science, Constraint theory, Genetic
                 mutations, Information analysis, Polynomials, Quantum
                 computing, Quantum mechanics, Space exploration,
                 evolutionary computation, quantum computing, search
                 problems, Deutsch-Josza problem, autocorrelation
                 characteristics, evolutionary search, fitness
                 landscapes, information measures, mutation landscapes,
                 quantum circuit evolution, quantum program evolution,
                 search space",
  ISBN =         "0-7803-7804-0",
  URL =          "http://www.cs.mun.ca/~leier/publications/cec03.pdf",
  DOI =          "doi:10.1109/CEC.2003.1299571",
  size =         "8 pages",
  abstract =     "This work is a first study of search spaces and
                 fitness landscapes in the context of quantum program
                 evolution. Considering small instances of the
                 Deutsch-Josza problem as a staring point for
                 explorations of quantum program search spaces, we
                 analyse the structure of mutation landscapes using
                 autocorrelation characteristics and information
                 measures. Our motivation is to obtain insights into the
                 relationship between landscape characteristic and
                 quantum circuit evolution with the aim to improve the
                 efficiency of evolutionary search.",
  notes =        "CEC 2003 - A joint meeting of the IEEE, the IEAust,
                 the EPS, and the IEE.

                 H,Rx,Ry,NOT,CNOT,Ph quantum gates. autocorrelation,
                 information content, partial information content,

                 ",
}

Genetic Programming entries for Andre Leier Wolfgang Banzhaf

Citations