no code implementations • 20 Jul 2020 • Chenyi Zhang, Jiaqi Leng, Tongyang Li
Compared to the classical state-of-the-art algorithm by Jin et al. with $\tilde{O}(\log^{6} (n)/\epsilon^{1. 75})$ queries to the gradient oracle (i. e., the first-order oracle), our quantum algorithm is polynomially better in terms of $\log n$ and matches its complexity in terms of $1/\epsilon$.
