Evolving blackbox quantum algorithms using genetic programming

Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM

Volumn 22, Issue 3, 2008, Pages 285-297

  Stadelhofer, Ralf ^a   Banzhaf, Wolfgang ^b   Suter, Dieter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

Genetic programming; Quantum computation; Quantum information processing

Indexed keywords

ALGORITHMS; ARCHITECTURAL DESIGN; COMPUTER GRAPHICS; COMPUTER NETWORKS; COMPUTER PROGRAMMING; COMPUTERS; DECISION MAKING; DECISION THEORY; DECISION TREES; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; GENETIC PROGRAMMING; MATHEMATICAL MODELS; QUANTUM COMPUTERS; QUANTUM OPTICS; QUANTUM THEORY;

CAMBRIDGE UNIVERSITY; COMPUTATIONAL PROBLEMS; DECISION TREE MODELS; GENETIC PROGRAMMING (GP) SYSTEMS; LOWER BOUNDS; NEW TECHNIQUES; PARITY PROBLEMS; QUANTUM ALGORITHMS; QUANTUM PHYSICS; QUERY COMPLEXITY;

INTEGER PROGRAMMING;

EID: 45749126095     PISSN: 08900604     EISSN: 14691760     Source Type: Journal    
DOI: 10.1017/S089006040800019X     Document Type: Article

References (20)

1. Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001). Quantum lower bounds by polynomials. Journal of the Association for Computing Machinery 48, 778.
2. Bennett, C.H., Bernstein, E., Brassard, G., & Vazirani, U. (1997). Strengths and weaknesses of quantum computing. SIAM Journal on Computing 26(5), 1510-1523.
3. Bernstein, E., & Vazirani, U. (1997). Quantum complexity theory. SIAM Journal on Computing 26, 1411.
4. Brassard, G., & Høyer, P. (1997). An exact quantum polynomial-time algorithm for Simon's problem. Proc. Fifth Israeli Symp. Theory of Computing and Systems (ISTCS), pp. 12-23.
5. Burhman, H., & de Wolf, R. (2002). Complexity measures and decision tree complexity: a survey. Theoretical Computer Science 288, 21.
6. Collins, D., Kim, K.W., & Holton, W.C. (1998). Deutsch-Jozsa algorithm as a test of quantum computation. Physical Review A 58, R1633.
7. Deutsch, D., & Jozsa, R. (1992). Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London A 439, 553-558.
8. Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (1998). Limit on the speed of quantum computation in determining parity. Physical Review Letters 81, 5442.
9. Leier, A., & Banzhaf, W. (2003a). Exploring the search space of quantum programs. Proc. 2003 Congr. Evolutionary Computation, Vol. I, pp. 170-177.
10. Leier, A., & Banzhaf, W. (2003b). Evolving Hogg's quantum algorithm using linear-tree GP. Proc. Genetic and Evolutionary Computation Conf. GECCO-03, pp. 390-400.
11. Lloyd, S. (2000). Quantum search without entanglement. Physical Review A, 61, 010301.
12. Massey, P., Clark, J., & Stepney, S. (2004). Evolving quantum circuits and programs through genetic programming. Proc. Genetic and Evolutionary Computation Conf. GECCO-2004.
13. Nielsen, M., & Chuang, I. (2000). Quantum Computation and Quantum Information. New York: Cambridge University Press.
14. Rieffel, E., & Polak, W. (2000). An introduction to quantum computing for non-physicists. ACM Computing Surveys 32, 300.
15. Shor, P.W. (1994). Algorithms for quantum computation: discrete logarithm and factoring. IEEE Symp. Foundations of Computer Science, pp. 124-134.
16. Simon, D.R. (1994). On the power of quantum computation. Proc. 35th Annual Symp. Foundations of Computer Science, pp. 116-123.
17. Spector, L. (2004). Automatic Quantum Computer Programming: A Genetic Programming Approach. New York: Kluwer Academic.
18. Spector, L., Barnum, H., Bernstein, H.J., & Swamy, N. (1999). Quantum computing applications of genetic programming. In Advances in Genetic Programming (Spector, L., Langdon, W.B., O'Reilly, U., & Angeline, P.J., Eds.), Vol. 3, p. 135. Cambridge, MA: MIT Press.
19. Stadelhofer, R., Suter, D., & Banzhaf, W. (2005). Quantum and classical parallelism in parity algorithms for ensemble quantum computers. Physical Review A 71, 032345.
20. Williams, C.P., & Gray, A.G. (1998). Automated design of quantum circuits. Proc. First NASA Int. Conf. Quantum Computing and Quantum Communications (QCQC), pp. 113-125.