Using modifications to Grover's Search algorithm for quantum global optimization
We study the problem of finding a global optimal solution to discrete optimization problems using a heuristic based on quantum computing methods. (Knowledge of quantum computing ideas is not necessary to read this paper.) We focus on a successful quantum computing method introduced by Baritompa, Bulger, and Wood, that we refer to as the BBW algorithm, and develop two modifications. First, we modify the BBW algorithm to achieve a dramatic speedup that lets us extend the known BBW static schedule from 33 to 43 points, thereby increasing its applicability. We further modify it by converting it from a static method to a dynamic one. Experimental results show the value of this latter modification.
Year of publication: |
2010
|
---|---|
Authors: | Liu, Yipeng ; Koehler, Gary J. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 207.2010, 2, p. 620-632
|
Publisher: |
Elsevier |
Keywords: | Discrete optimization Global optimization Grover iterations Quantum computing |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Using modifications to Grover’s Search algorithm for quantum global optimization
Liu, Yipeng, (2010)
-
Using modifications to Grover’s Search algorithm for quantum global optimization
Liu, Yipeng, (2010)
-
A hybrid method for quantum global optimization
Liu, Yipeng, (2012)
- More ...