Pedro Lara, Renato Portugal, Carlile Lavor
Grover's algorithm can be employed in global optimization methods providing, in some cases, a quadratic speedup over classical algorithms. This paper describes a new method for continuous global optimization problems that uses a classical algorithm for finding a local minimum and Grover's algorithm to escape from this local minimum. Simulations with testbed functions and comparisons with algorithms from the literature are presented.
View original:
http://arxiv.org/abs/1301.4667
No comments:
Post a Comment