Quantum basin hopping with gradient-based local optimisation
Abstract
The quantum basin hopping algorithm for continuous global optimisation combines a local search with Grover's algorithm, and can locate the global optimum using effort proportional to the square root of the number of basins. This article establishes that Jordan's quantum gradient estimation method can be incorporated into the quantum basin hopper, providing an extra acceleration proportional to the domain dimension.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.