Grover's quantum algorithm promises a quadratic acceleration for any problem formulable as a search. For unstructured search problems, its implementation and performance are well understood. The curse of dimensionality and the intractability of the general global optimization problem require any identifiable structure or regularity to be incorporated into a solution method. This paper addresses the application of Grover's algorithm when a local search technique is available, thereby combining the quadratic acceleration with the acceleration seen in the multistart method.
|Number of pages||13|
|Journal||Journal of Optimization Theory and Applications|
|Publication status||Published - Jun 2007|