Skip to main content
SpringerLink
Log in

Combining a Local Search and Grover’s Algorithm in Black-Box Global Optimization

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Grover, L.K.: A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (1996)

  2. Baritompa, W.P., Bulger, D.W., Wood, G.R.: Grover’s quantum algorithm applied to global optimization. SIAM J. Optim. 15, 1170–1184 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bulger, D.W., Baritompa, W.P., Wood, G.R.: Implementing pure adaptive search with Grover’s quantum algorithm. J. Optim. Theory Appl. 116, 517–529 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dürr, C., Høyer, P.: A quantum algorithm for finding the minimum; see http://lanl.arxiv.org/abs/quant-ph/9607014, version 2, 7 January 1999

  5. Brooks, S.H.: A discussion of random methods for seeking maxima. Oper. Res. 6, 244–251 (1958)

    Article  MathSciNet  Google Scholar 

  6. Tsai, C.J., Jordan, K.D.: Use of an eigenmode method to locate the stationary points on the potential energy surfaces of selected argon and water clusters. J. Phys. Chem. 97, 11227–11237 (1993)

    Article  Google Scholar 

  7. Wales, D.J., Doye, J.P.K.: Global optimization by basin-hopping and the lowest energy structures of Lennard–Jones clusters containing up to 110 atoms. J. Phys. Chem. 101A, 5111–5116 (1997)

    Google Scholar 

  8. Bulger, D.W., Wood, G.R.: Hesitant adaptive search for global optimization. Math. Program. 81, 89–102 (1998)

    MathSciNet  Google Scholar 

  9. Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46, 493–506 (1998)

    Article  Google Scholar 

  10. Zabinsky, Z.B., Wood, G.R., Steel, M.A., Baritompa, W.P.: Pure adaptive search for finite global optimization. Math. Program. 69, 443–448 (1995)

    MathSciNet  Google Scholar 

  11. Zabinsky, Z.B., Smith, R.L.: Pure adaptive search in global optimization. Math. Program. 53, 323–338 (1992)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Macquarie University, Sydney, New South Wales, Australia

    D. W. Bulger

Authors
  1. D. W. Bulger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. W. Bulger.

Additional information

Communicated by P.M. Pardalos.

The author thanks Dr. Bill Baritompa for helpful discussions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bulger, D.W. Combining a Local Search and Grover’s Algorithm in Black-Box Global Optimization. J Optim Theory Appl 133, 289–301 (2007). https://doi.org/10.1007/s10957-007-9168-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-007-9168-2

Keywords

Search

Navigation