Combining a local search and grover's algorithm in black-box global optimization

D. W. Bulger*

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    10 Citations (Scopus)


    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.

    Original languageEnglish
    Pages (from-to)289-301
    Number of pages13
    JournalJournal of Optimization Theory and Applications
    Issue number3
    Publication statusPublished - Jun 2007


    Dive into the research topics of 'Combining a local search and grover's algorithm in black-box global optimization'. Together they form a unique fingerprint.

    Cite this