Mihai Udrescu
ABSTRACT
This paper presents a new methodology for running Genetic Algorithms on a Quantum Computer. To the best of our knowledge and according to reference [6]there are no feasible solutions for the implementation of the Quantum Genetic Algorithms (QGAs). We present a new perspective on how to build the corresponding QGA architecture. It turns out that the genetic strategy is not particularly helpful in our quantum computation approach; therefore our solution consists of designing a special-purpose oracle that will work with a modified version of an already known algorithm (maximum finding [1]), in order to reduce the QGAs to a Grover search. Quantum computation offers incentives for this approach, due to the fact that the qubit representation of the chromosome can encode the entire population as a superposition of basis-state values.
- A. Ahuja and S. Kapoor. A quantum algorithm for finding the maximum. ArXiv:quant-ph/9911082 1999.Google Scholar
- A. Barenco, C. H. Bennett, R. Cleve, D. P. Vincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. Elementary gates for quantum computation. Phys. Rev. A(52): 3457--3467, 1995.Google Scholar
- E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Computing 26(5): 141173, 1997. Google ScholarDigital Library
- M. Boyer, G. Brassard, P. Hoyer, and A. Tapp. Tight bounds on quantum searching. Fort sch. Phys - Prog. Phys. 46(4-5):493--505, 1998.Google Scholar
- C. Durr and P. Hoyer. A quantum algorithm for finding the minimum. ArXiv: quant-ph/9607014 1996.Google Scholar
- G. Giraldi, R. Portugal, and R. Thess. Genetic algorithms and quantum computation. ArXiv:cs.NE/0403003 2004.Google Scholar
- P. Gossett. Quantum carry-save arithmetic. quant-ph/9808061 1998.Google Scholar
- L. Grover. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett.79: 325--328, 1997.Google ScholarCross Ref
- K.-H. Han and J.-H. Kim. Genetic quantum algorithm and its application to combinatorial optimization problem. In Proc. of the 2000 Congress on Evolutionary Computation citeseer.nj.nec.com/han00genetic.html, 2000.Google Scholar
- K.-H. Han and J.-H. Kim. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization.IEEE Transactions on Evolutionary Computation 6(6):580--593, 2002. Google ScholarDigital Library
- T. Hogg. Highly structured searches with quantum computers. Phys. Rev. Lett.80:2473--2476,1998.Google ScholarCross Ref
- A. Leier and W. Banzhaf. Evolving hogg's quantum algorithm using linear-tree gp. In Proc. Genetic and Evolutionary Computation Conference (GECCO) pages 390--400, 2003. Google ScholarDigital Library
- M. Lukac, M. Perkowski, H. Goi, M. Pivtoraiko, H.-Y. Chung, K. Chung, H. Jeech, K. Byung-Guk, and K. Yong-Duk. Evolutionary approach to quantum and reversible circuits synthesis.Artificial Intelligence Review 20(3-4): 361--417, 2003. Google ScholarDigital Library
- D. Mange, M. Sipper, A. Stauffer, and G. Tempesti. Toward robust integrated circuits:The embryonics approach. Proc. IEEE 88(4): 516--541,2000.Google ScholarCross Ref
- A. Narayanan and M. Moore. Quantum-inspired genetic algorithms.In Proc. International Conference on Evolutionary Computation (ICEC-96)pages 61--66. IEEE,1 996.Google Scholar
- M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information Cambridge University Press, Cambridge, 2000. Google ScholarDigital Library
- B. Omer. Quantum programming in QCL Technical Report,Institute of Information Systems, Technical of Vienna, Vienna,2000.Google Scholar
- M. Oskin, F. Chong, and I. Chuang. A practical architecture for reliable quantum computers. IEEE Computer 35(1):79--87, 2002. Google ScholarDigital Library
- B. Parhami. Computer Arithmetic. Algorithms and Hardware Designs Oxford University Press, Oxford, 2000. Google ScholarDigital Library
- L. Prodan, M. Udrescu, and M. Vlăţdutiu. Self-repairing embryonic memory arrays.In Proc. IEEE NASA/DoD Conference on Evolvable Hardware, Seattle pages 130--137, 2004.Google Scholar
- L. Prodan, M. Udrescu, and M. Vlăţdutiu. Survivability of embryonic memories:Analysis and design principles.In Proc. IEEE NASA/DoD Conference on Evolvable Hardware (EH'05)pages 280--289, 2005. Google ScholarDigital Library
- B. Rylander, T. Soule, and J. Foster. Computational complexity, genetic programming, and implications. In Proc. 4th EuroGP pages 348--360,2001. Google ScholarDigital Library
- B. Rylander, T. Soule, J. Foster, and J. Alves-Foss. Quantum evolutionary programming. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001)pages 1005--1011, 2001.Google Scholar
- P. W. Shor. Algorithms for quantum computation: Discrete logarithms and factoring. In Proc. 35th Symposium on Foundations of Computer Science pages 124--134,1994.Google ScholarDigital Library
- L. Spector. Automatic Quantum Computer Programming: A Genetic Programming Approach Kluwer Academic Publishers, Boston, 2004. Google ScholarDigital Library
- L. Spector, H. Barnum, and H. Bernstein. Genetic programming for quantum computers. In Genetic Programming 1998: Proceedings of the Third Annual Conference, Madison, Wisconsin pages 365--373,1998.Google Scholar
- L. Spector, H. Barnum, H. Bernstein, and N. Swamy. Quantum computing applications of genetic programming. Advances in Genetic Programming 3(7):135--160,1998. Google ScholarDigital Library
- L. Spector, H. Barnum, H. Bernstein, and N. Swamy. Finding a better-than-classical quantum and/or algorithm using genetic programming. In Proceedings of 1999 Congress of Evolutionary Computation, Piscataway, NJ pages 2239--2246.IEEE,1999.Google ScholarCross Ref
- M. Udrescu, L. Prodan, and M. Vlăţdutiu. Improving quantum circuit dependability with recon.gurable quantum gate arrays.In Proceedings 2nd ACM Conference on Computing Frontiers pages 133--144. Ischia,Italy,May 2005. Google ScholarDigital Library
- V. Vedral, A. Barenco, and A. Ekert.uantum networks for elementary arithmetic operations. quant-ph/9511018 1996.Google Scholar
- G. Viamontes, I. Markov, and J. P. Hayes.I s quantum search practical?In International Workshop on Logic and Synthesis pages 478--485,2004.Google Scholar
Index Terms
- Implementing quantum genetic algorithms: a solution based on Grover's algorithm
Recommendations
Spin---orbit hybrid entangled channel for spin state quantum teleportation using genetic algorithms
We present a physical model of spin quantum teleportation protocol (QTP) in a triple quantum dot array using a genetic algorithm approach. The information to teleport is spin-coded in one electron confined in a single quantum dot (SQD). The remaining ...
Evolution of a human-competitive quantum fourier transform algorithm using genetic programming
GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computationIn this paper, we show how genetic programming (GP) can be used to evolve system-size-independent quantum algorithms, and present a human-competitive Quantum Fourier Transform (QFT) algorithm evolved by GP.
Neural network crossover in genetic algorithms using genetic programming
AbstractThe use of genetic algorithms (GAs) to evolve neural network (NN) weights has risen in popularity in recent years, particularly when used together with gradient descent as a mutation operator. However, crossover operators are often omitted from ...
Comments