Evolving blackbox quantum algorithms using genetic programming

Authors:
Ralf Stadelhofer;Wolfgang Banzhaf;Dieter Suter
Affiliations:
Department of computer science, university of dortmund, dortmund, germany;Department of computer science, memorial university of newfoundland, st. john's, canada;Department of physics, university of dortmund, dortmund, germany
Venue:
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Year:
2008

Citing 12
Cited 2

Quantum Complexity Theory

SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing

SIAM Journal on Computing
Quantum computing applications of genetic programming

Advances in genetic programming
An introduction to quantum computing for non-physicists

ACM Computing Surveys (CSUR)
Quantum lower bounds by polynomials

Journal of the ACM (JACM)
Quantum computation and quantum information

Quantum computation and quantum information
Complexity measures and decision tree complexity: a survey

Theoretical Computer Science - Complexity and logic
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Automatic Quantum Computer Programming: A Genetic Programming Approach (Genetic Programming)

Automatic Quantum Computer Programming: A Genetic Programming Approach (Genetic Programming)
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On the power of quantum computation

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Evolving Hogg's quantum algorithm using linear-tree GP

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

A review of procedures to evolve quantum algorithms

Genetic Programming and Evolvable Machines
Human-competitive results produced by genetic programming

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have been developed so far. Designing such algorithms is complicated by the rather nonintuitive character of quantum physics. In this paper we present a genetic programming system that uses some new techniques to develop and improve quantum algorithms. We have used this system to develop two formerly unknown quantum algorithms. We also address a potential deficiency of the quantum decision tree model used to prove lower bounds on the query complexity of the parity problem.