2025
Fast Zeroth-Order Convex Optimization with Quantum Gradient Methods
NeurIPS 2025poster
We study quantum algorithms based on quantum (sub)gradient estimation using noisy function evaluation oracles, and demonstrate the first dimension-independent query complexities (up to poly-logarithmic factors) for zeroth-order convex optimization in both smooth and nonsmooth settings. Interestingly…