no code implementations • ICML 2020 • Srinivasan Arunachalam, Reevu Maity
To this end, suppose we have a $\gamma$-weak quantum learner for a Boolean concept class $C$ that takes time $Q(C)$, we introduce a quantum boosting algorithm whose complexity scales as $\sqrt{VC(C)}\cdot poly(Q(C), 1/\gamma);$ thereby achieving a quadratic quantum improvement over classical AdaBoost in terms of $VC(C)$.
no code implementations • 31 Jan 2020 • Bobak Toussi Kiani, Seth Lloyd, Reevu Maity
We study the hardness of learning unitary transformations in $U(d)$ via gradient descent on time parameters of alternating operator sequences.
