Finding a better-than-classical quantum AND/OR algorithm using genetic programming
Authors:
- L. SpectorLSL. Spector
- H. BarnumHBH. Barnum
- H.J. BernsteinHBH.J. Bernstein
- N. SwamyNSN. Swamy
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2239-2246
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Algorithms for quantum computation: discrete logarithms and factoring2002
- On the Monte Carlo Boolean decision tree complexity of read-once formulae2002
- Quantum lower bounds by polynomials2002
- Quantum computingReports on Progress in Physics, 1998
- Quantum algorithms revisitedProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Quantum vs. classical communication and computation1998
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Advances in Genetic Programming1996
- Characterizing classes of functions computable by quantum parallelismProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1991
- Probabilistic Boolean decision trees and the complexity of evaluating game trees1986