Fast quantum algorithm for numerical gradient estimation
Quantum Physics
2013-05-29 v2
Abstract
Given a blackbox for f, a smooth real scalar function of d real variables, one wants to estimate the gradient of f at a given point with n bits of precision. On a classical computer this requires a minimum of d+1 blackbox queries, whereas on a quantum computer it requires only one query regardless of d. The number of bits of precision to which f must be evaluated matches the classical requirement in the limit of large n.
Cite
@article{arxiv.quant-ph/0405146,
title = {Fast quantum algorithm for numerical gradient estimation},
author = {Stephen P. Jordan},
journal= {arXiv preprint arXiv:quant-ph/0405146},
year = {2013}
}
Comments
additional references and minor clarifications and corrections to version 1