A review of procedures to evolve quantum algorithms

Adrian Gepp, Philip Stocks

Research output: Contribution to journalArticleResearchpeer-review

11 Citations (Scopus)
104 Downloads (Pure)

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.

Original languageEnglish
Pages (from-to)181-228
Number of pages48
JournalGenetic Programming and Evolvable Machines
Volume10
Issue number2
DOIs
Publication statusPublished - Jun 2009

Fingerprint

Quantum Algorithms
Evolutionary Algorithms
Evolutionary algorithms
Quantum Computer
Quantum computers
Patents and inventions
Review
Person
Simulation

Cite this

@article{e5519ac3fb0d4ecc84a95614c89f7ce5,
title = "A review of procedures to evolve quantum algorithms",
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.",
author = "Adrian Gepp and Philip Stocks",
year = "2009",
month = "6",
doi = "10.1007/s10710-009-9080-7",
language = "English",
volume = "10",
pages = "181--228",
journal = "Genetic Programming and Evolvable Machines",
issn = "1389-2576",
publisher = "Springer",
number = "2",

}

A review of procedures to evolve quantum algorithms. / Gepp, Adrian; Stocks, Philip.

In: Genetic Programming and Evolvable Machines, Vol. 10, No. 2, 06.2009, p. 181-228.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - A review of procedures to evolve quantum algorithms

AU - Gepp, Adrian

AU - Stocks, Philip

PY - 2009/6

Y1 - 2009/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=64549103782&partnerID=8YFLogxK

U2 - 10.1007/s10710-009-9080-7

DO - 10.1007/s10710-009-9080-7

M3 - Article

VL - 10

SP - 181

EP - 228

JO - Genetic Programming and Evolvable Machines

JF - Genetic Programming and Evolvable Machines

SN - 1389-2576

IS - 2

ER -