Quantum computational gradient estimation
| dc.creator | Bulger, David | |
| dc.date | 2005-07-12 | |
| dc.date.accessioned | 2026-07-07T06:13:11Z | |
| dc.date.available | 2026-07-07T06:13:11Z | |
| dc.description | 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. | |
| dc.description | 8 pages, no figure | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0507109 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0507109 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93012 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum computational gradient estimation | |
| dc.type | text |