Fast quantum algorithm for numerical gradient estimation
Stephen P. Jordan
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.
Create a lesson
Related papers
Towards the Geometry of Quantum Optical Measurements: Kraus Trajectories in the Instrumental Weyl-Heisenberg Group Manifold
Tzula B. Propp, Chris S. Jackson
Bell's go theorem: regaining local causality with a new notion of realism
Lorenzo Catani, Nesta van der Schaaf, Rui Soares Barbosa
Quantum state texture of maximal-resource Fourier states under Hawking radiation
Shengyan Ma, Yiding Wang, Xiaofen Huang et al.
Magic-Free Certification of Logical Error Rates in Universal Fault-Tolerant Circuits
Gebrat Porta-San Miguel, Shahram Panahiyan, Dieter Jaksch
QBFF: Deep Quantum Bottleneck for Automatic Speaker Verification Anti-Spoofing
Anton Firc, Nouhaila Innan, Vojtěch Staněk et al.
Entanglement and parametric resonance in coupled oscillator systems
Roxane Thériault, George Zahariade