Oracle-Parameterized Convergence Rates: SPIDER, Q-SPIDER, and the Exact CrossoverResearch Paper
Quantum algorithms for stochastic optimization are usually presented one paper at a time: a schedule is fixed, a quantum mean estimator is substituted for a classical minibatch, and a new rate is derived from scratch. The derivations are near-identical, and the step that actually differs — the price of one gradient query — is buried inside each proof rather…