no code implementations • 15 Feb 2023 • Preetham Mohan, Ambuj Tewari
Arunachalam and de Wolf (2018) showed that the sample complexity of quantum batch learning of boolean functions, in the realizable and agnostic settings, has the same form and order as the corresponding classical sample complexities.