Several previous works have investigated the circumstances under which quantum adiabatic optimization algorithms can tunnel out of local energy minima that trap simulated annealing or other classical local search algorithms. Here we investigate the even more basic question of whether adiabatic optimization algorithms always succeed in polynomial time for trivial optimization problems in which t...

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 27 December 2019Accepted: 10 February 2021Published online: 13 May 2021Keywordsoptimization, landscape, manifold, eigenvalues the Hessian, overparameterizationAMS Subject Headings68T99, 51M99Publication DataISSN (online): 2577-0187Publisher: Society for Industrial and App...