Quantum computational gradient estimation
Quantum Physics
2007-05-23 v1
Abstract
Classically, determining the gradient of a black-box function f:R^p->R requires p+1 evaluations. Using the quantum Fourier transform, two evaluations suffice. This is based on the approximate local periodicity of exp(2*pi*i*f(x)). It is shown that sufficiently precise machine arithmetic results in gradient estimates of any required accuracy.
Cite
@article{arxiv.quant-ph/0507109,
title = {Quantum computational gradient estimation},
author = {David Bulger},
journal= {arXiv preprint arXiv:quant-ph/0507109},
year = {2007}
}
Comments
8 pages, no figure