no code implementations • 29 Jul 2020 • Jianhao He, Feidiao Yang, Jialin Zhang, Lvzhou Li
(ii) We show that for strongly convex loss functions, the quantum algorithm can achieve $O(\log T)$ regret with $O(1)$ queries as well, which means that the quantum algorithm can achieve the same regret bound as the classical algorithms in the full information setting.
