Fast quantum algorithm for numerical gradient estimation
classification
🪐 quant-ph
keywords
bitsblackboxclassicalcomputergivengradientprecisionquantum
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Provable Quantum Advantage for Dynamical Phase Transition
Proves intractability of DQPT estimation on quantum computers but equivalence of subsystem DQPT decision to quantum circuit simulation, with quadratic speedup for critical time search.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.