Implementing quantum genetic algorithms: a solution based on Grover's algorithm

  • Authors:
  • Mihai Udrescu;Lucian Prodan;Mircea Vlăduţiu

  • Affiliations:
  • University "Politehnica" of Timişoara, Timişoara, Romania;University "Politehnica" of Timişoara, Timişoara, Romania;University "Politehnica" of Timişoara, Timişoara, Romania

  • Venue:
  • Proceedings of the 3rd conference on Computing frontiers
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.