Abstract:
This paper documents the discovery of a new, better-than-classical quantum algorithm for the depthtwo AND/OR tree problem. We describe the genetic programming system that was constructed specifically for this work, the quantum computer simulator that is used to evaluate the fitness of evolving quantum algorithms, and the newly discovered algorithm. 1 Introduction Quantum computers use the dynamics of atomic-scale objects to store and manipulate information. The behavior of atomicscale objects is governed by quantum mechanics rather than by classical physics, and the quantum mechanical properties of these systems can be harnessed to compute certain functions more efficiently than is possible on any classical computer [1]. For example, Shor's quantum factoring algorithm finds the prime factors of an n-digit number in time O(n 2 log(n) log log(n)) [2], while the best known classical factoring algorithms require time O(2 n 1 3 log(n) 2 3 ) and many researchers doubt the existence...
Citations
|
1921
|
Genetic Programming I : On the Programming of Computers by Means of Natural Selection
– Koza
- 1992
|
|
528
|
Genetic Programming II: automatic discovery of reusable programs
– Koza
- 1994
|
|
434
|
Algorithms for quantum computation: discrete log and factoring
– Shor
- 1994
|
|
132
|
Quantum mechanics helps in searching for a needle in a haystack, Phys
– Grover
- 1997
|
|
66
|
Mosca: Quantum algorithms revisited
– Cleve, Ekert, et al.
- 1998
|
|
42
|
Probabilistic Boolean decision trees and the complexity of evaluating game trees
– Saks, Wigderson
- 1986
|
|
17
|
Quantum computing applications of genetic programming
– Spector, Barnum, et al.
- 1999
|
|
14
|
Efficient networks for quantum factoring
– Beckman, Chari, et al.
- 1996
|
|
14
|
Characterisation of Pareto and lexicographic optimal solutions, in Multiple Criteria Decision Making Theory and Application
– Ben-Tal
- 1980
|
|
12
|
Characterising Classes of Functions Computable by Quantum Parallelism
– Jozsa
- 1991
|
|
8
|
Quantum computing: Pro and con
– Preskill
- 1997
|
|
6
|
Quantum Computing,” Documenta Mathematica, vol. Extra Volume ICM
– Shor
- 1998
|
|
5
|
Quantum computation, Reports on
– Steane
- 1998
|
|
4
|
Entanglement and quantum computation,” in Geometric Issues in the Foundations of Science
– Jozsa
- 1997
|
|
4
|
Entanglement and Quantum Computation," in The Geometric Universe: Science, Geometry, and the Work of Roger Penrose, edited by
– Jozsa
- 1998
|
|
3
|
Quantum computing," Reports on
– Steane
- 1998
|
|
2
|
Quantum computation: a tutorial,” Available only electronically, on-line at URL http ://chemphys.weizmann.ac.il/ ˜schmuel/comp/comp.html
– Braunstein
- 1995
|
|
2
|
Schrödinger's Machines: The Quantum Technology Reshaping Everyday
– Milburn
- 1997
|
|
2
|
Genetic programming for quantum computers,” in Genetic Programming 1998
– Spector, Barnum, et al.
- 1998
|
|
2
|
Quantum lower bounds by polynomials,” FOCS '98
– Beals, Buhrman, et al.
- 1998
|
|
2
|
On the Monte-Carlo Boolean decision tree complexity of read-once formulae
– Santha
- 1991
|
|
2
|
Quantum computing," Documenta Mathematica, vol. Extra Volume ICM
– Shor
- 1998
|
|
1
|
Avi Widgerson, “Quantum vs. classical communication and computation
– Buhrman, Cleve
- 1998
|
|
1
|
Principles of Arti"cial Intelligence
– Nilsson
- 1980
|
|
1
|
Quantum computation: a tutorial, " Available only electronically, on-line at URL http ://chemphys.weizmann.ac.il/ schmuel/comp/comp.html
– Braunstein
- 1995
|
|
1
|
Genetic programming for quantum computers," in Genetic Programming 1998
– Spector, Barnum, et al.
- 1998
|
|
1
|
Quantum lower bounds by polynomials, " FOCS '98
– Beals, Buhrman, et al.
- 1998
|
|
1
|
Avi Widgerson, "Quantum vs. classical communication and computation
– Buhrman, Cleve
- 1998
|
|
