544 citations · 1.1k across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
quant-ph2017★ 106 cited
Optimizing quantum optimization algorithms via faster quantum gradient computation
András Gilyén, Srinivasan Arunachalam, Nathan Wiebe
We consider a generic framework of optimization algorithms based on gradient descent. We develop a quantum algorithm that computes the gradient of a multi-variate real-valued funct…
quant-ph2017★ 82 cited
Quantum SDP-Solvers: Better upper and lower bounds
Joran van Apeldoorn, András Gilyén, Sander Gribling +1
Brandão and Svore very recently gave quantum algorithms for approximately solving semidefinite programs, which in some regimes are faster than the best-possible classical algorithm…