Genetic Algorithms for Quantum Circuit Design –Evolving a Simpler Teleportation Circuit–

We propose a method to apply genetic algorithms to the quantum circuit design. We show by experiments that without any deep knowledge of the problem it is possible to evolve a circuit for the quantum teleportation simpler than ever known. keyword: genetic algorithms, quantum teleportation, quantum computer, quantum computing, quantum circuit.

[1]  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).

[2]  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.

[3]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

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

[5]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Gilles Brassard,et al.  Teleportation as a quantum computation , 1998 .

[7]  E. Bach.  Discrete Logarithms and Factoring , 1984 .