Evolving Hogg's Quantum Algorithm Using Linear-Tree GP

Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In this paper a Genetic Programming system based on linear-tree genome structures developed for the purpose of automatic quantum circuit design is introduced. It was applied to instances of the 1-SAT problem, resulting in evidently and "visibly" scalable quantum algorithms, which correspond to Hogg's quantum algorithm.

[1]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[2]  J. K. Kinnear,et al.  Advances in Genetic Programming , 1994 .

[3]  N. Swamy,et al.  Finding a better-than-classical quantum AND/OR algorithm using genetic programming , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[4]  Lee Spector,et al.  Quantum computing applications of genetic programming , 1999 .

[5]  Lee Spector,et al.  Better-than-classical circuits for OR and AND/OR found using genetic programming , 1999 .

[6]  Benjamin I. P. Rubinstein.  Evolving quantum circuits using genetic programming , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[7]  Tad Hogg,et al.  HIGHLY STRUCTURED SEARCHES WITH QUANTUM COMPUTERS , 1998 .

[8]  H. S. Allen.  The Quantum Theory , 1928, Nature.

[9]  L. Spector,et al.  Quantum circuits for OR and AND of ORs , 2000 .

[10]  IEEE Intelligent Systems,et al.  The evolution of arbitrary computational processes To appear in , 2000 .

[11]  Xinhua Peng,et al.  Experimental implementation of Hogg's algorithm on a three-quantum-bit NMR quantum computer , 2002 .

[12]  Alexander G. Gray,et al.  Automated Design of Quantum Circuits , 1998, QCQC.

[13]  Lov K. Grover,et al.  Quantum computation , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[14]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[15]  Alvin J. Surkan,et al.  Evolution of quantum computer algorithms from reversible operators , 2002, Proceedings 2002 NASA/DoD Conference on Evolvable Hardware.

[16]  Colin P. Williams,et al.  Explorations in quantum computing , 1997 .

[17]  Jozef Gruska,et al.  Quantum Computing , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[18]  Tad Hogg,et al.  Solving Highly Constrained Search Problems with Quantum Computers , 2011, J. Artif. Intell. Res..

[19]  Wolfgang Banzhaf,et al.  Linear-Tree GP and Its Comparison with Other GP Structures , 2001, EuroGP.

[20]  M. Hirvensalo.  Quantum Computing (Natural Computing Series) , 2004 .

[21]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.