Log In Sign Up

Quantum Algorithms for Escaping from Saddle Points

by   Chenyi Zhang, et al.

We initiate the study of quantum algorithms for escaping from saddle points with provable guarantee. Given a function fℝ^n→ℝ, our quantum algorithm outputs an ϵ-approximate second-order stationary point using Õ(log^2 n/ϵ^1.75) queries to the quantum evaluation oracle (i.e., the zeroth-order oracle). Compared to the classical state-of-the-art algorithm by Jin et al. with Õ(log^6 n/ϵ^1.75) queries to the gradient oracle (i.e., the first-order oracle), our quantum algorithm is polynomially better in terms of n and matches its complexity in terms of 1/ϵ. Our quantum algorithm is built upon two techniques: First, we replace the classical perturbations in gradient descent methods by simulating quantum wave equations, which constitutes the polynomial speedup in n for escaping from saddle points. Second, we show how to use a quantum gradient computation algorithm due to Jordan to replace the classical gradient queries by quantum evaluation queries with the same complexity. Finally, we also perform numerical experiments that support our quantum speedup.


Escape saddle points by a simple gradient-descent based algorithm

Escaping saddle points is a central research topic in nonconvex optimiza...

Optimizing quantum optimization algorithms via faster quantum gradient computation

We consider a generic framework of optimization algorithms based on grad...

Classical computation of quantum guesswork

The guesswork quantifies the minimum number of queries needed to guess t...

Low depth algorithms for quantum amplitude estimation

We design and analyze two new low depth algorithms for amplitude estimat...

Quantum algorithms for learning graphs and beyond

We study the problem of learning an unknown graph provided via an oracle...

Quantum speedups of some general-purpose numerical optimisation algorithms

We give quantum speedups of several general-purpose numerical optimisati...

A neural network oracle for quantum nonlocality problems in networks

Characterizing quantum nonlocality in networks is a challenging problem....