Fast quantum learning with statistical guarantees

01/28/2020
by   Carlo Ciliberto, et al.
0

Within the framework of statistical learning theory it is possible to bound the minimum number of samples required by a learner to reach a target accuracy. We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms – for which statistical guarantees are available – cannot achieve polylogarithmic runtimes in the input dimension. This calls for a careful revaluation of quantum speedups for learning problems, even in cases where quantum access to the data is naturally available.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset