Abstract
This paper gives a quantum algorithm for global optimization. The heart of such approaches employ Grover’s database search (1996; Phys Rev Lett 79(23):4709–4712, 1997a; 79(2):325–328, 1997b). Chi and Kim (1998) show that when the phases of the generalized Grover database search operator are optimally chosen, it is capable of finding a solution by a single query. To apply this method to global optimization requires knowledge of the number of marked points m to calculate the optimal phases, but this value is seldom known. This paper focuses on overcoming this hurdle by showing that an estimate of the optimal phases can be found and used to replace the optimal phases while maintaining a high probability of finding a solution. Merging this finding with a recently discovered dynamic quantum global optimization algorithm (BBW2D) that reduces the problem to finding successively improving regions using Grover’s search, we present a hybrid method that improves the efficiency and reduces the variance of the search algorithm when empirically compared to other existing quantum search algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baritompa W.P., Bulger D.W., Wood G.R.: Grover’s quantum algorithm applied to global optimization. SIAM J. Optim. 15(4), 1170–1184 (2005)
Benson H.P., Erenguc S., Horst R.: A note on adapting methods for continuous global optimization to the discrete case. Ann. Oper. Res. 25, 243–252 (1990)
Boyer M., Brassard G., Hoyer P., Tapp A.: Tight bounds on quantum searching. Fortshc. Phys. 46, 493–506 (1998)
Bulger D., Baritompa W.P., Wood G.R.: Implementing pure adaptive search with grover’s quantum algorithm. J. Optim. Theory Appl. 116, 517–529 (2003)
Chi D.P., Kim J.: Quantum database search by a single query. In: Lecture Notes In Computer Science; Vol. 1509 archive, Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications, pp. 148–151. Springer, London (1998)
Durr, C., Hoyer, P.: A quantum algorithm for finding the minimum. http://lanl.arxiv.org/abs/quant-ph/9607014,version2 (1999)
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, pp. 212–219 (1996)
Grover L.K.: Quantum computers can search arbitrarily large databases by a single query. Phys. Rev. Lett. 79(23), 4709–4712 (1997a)
Grover L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997b)
Hendrix E.M.T., Klepper O.: On uniform covering, adaptive random search and raspberries. J. Glob. Optim. 18, 143–163 (2000)
Horst R.: On the global minimization of concave functions. OR Spectrum 6(4), 195–205 (1984)
Horst R., Pardalos P., Thoai N.V.: Introduction to Global Optimization. 1st edn. Kluwer Academic Publishers (Springer), Berlin (1995)
Horst R., Tuy H.: Global Optimization: Deterministic Approach. 3rd edn. Springer, Berlin (1996)
Liu Y., Koehler G.J.: Using modifications to Grover’s search algorithm for quantum global optimization. Eur. J. Oper. Res. 207(2), 620–632 (2010)
Long G.L., Li Y.S., Zhang W.L., Niu L.: Phase matching in quantum searching. Phys. Lett. A262, 27–34 (1999)
Meyer C.: A simple finite cone covering algorithm for concave minimization. J. Glob. Optim. 18(4), 357–365 (2000)
Nielsen M.A., Chuang I.L.: Quantum Computation and Quantum Information. Cambridge, UK (2000)
Pardalos P.M., Yatsenko V.: Optimization and Control of Bilinear Systems. Springer, Berlin (2009)
Protopopescu V., Barhen J. et al.: Quantum algorithm for continuous global optimization. In: Qi, L. (eds) Optimization and Control with Applications. Applied optimization, vol. 96, pp. 293–303. Springer, New York, NY (2005) (ISBN 0-387-24254-6/hbk)
Shoup, V.: NTL: a library for doing number theory (version 5.4.1). http://www.shoup.net/ntl/ (2007)
Yatsenko, V., Boyko, N., Xanthopoulos, P., Pardalos, P.: Quantum computing in control and optimization. In: Proceedings of SPIE, vol. 657307. doi:10.1117/12.718613 (2007)
Yatsenko, V., Pardalos, P., Chiarini, B.H.: Quantum optimization and maximum clique problems. In: Donkor, E., Pirich, A.R., Brandt, H.E. (eds.) Proceedings of SPIE, Quantum Information and Computation II, vol. 5436, pp. 373-375, August 2004
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Y., Koehler, G.J. A hybrid method for quantum global optimization. J Glob Optim 52, 607–626 (2012). https://doi.org/10.1007/s10898-011-9806-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-011-9806-y