A review of procedures to evolve quantum algorithms

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

@Article{Gepp:2009:GPEM,
  author =       "Adrian Gepp and Phil Stocks",
  title =        "A review of procedures to evolve quantum algorithms",
  journal =      "Genetic Programming and Evolvable Machines",
  year =         "2009",
  volume =       "10",
  number =       "2",
  pages =        "181--228",
  month =        jun,
  keywords =     "genetic algorithms, genetic programming, Evolving
                 quantum algorithms, Quantum computing, Evolutionary
                 algorithms, Quantum algorithms",
  ISSN =         "1389-2576",
  DOI =          "doi:10.1007/s10710-009-9080-7",
  abstract =     "There exist quantum algorithms that are more efficient
                 than their classical counterparts; such algorithms were
                 invented by Shor in 1994 and then Grover in 1996. A
                 lack of invention since Grover's algorithm has been
                 commonly attributed to the non-intuitive nature of
                 quantum algorithms to the classically trained person.
                 Thus, the idea of using computers to automatically
                 generate quantum algorithms based on an evolutionary
                 model emerged. A limitation of this approach is that
                 quantum computers do not yet exist and quantum
                 simulation on a classical machine has an exponential
                 order overhead. Nevertheless, early research into
                 evolving quantum algorithms has shown promise. This
                 paper provides an introduction into quantum and
                 evolutionary algorithms for the computer scientist not
                 familiar with these fields. The exciting field of using
                 evolutionary algorithms to evolve quantum algorithms is
                 then reviewed.",
}

Genetic Programming entries for Adrian Gepp Phil Stocks

Citations