Quadratic Quantum Speedup for Perceptron Training

Perceptrons, which perform binary classification, are the fundamental building blocks of neural networks. Given a data set of size N and margin γ (how well the given data are separated), the query complexity of the best-known quantum training algorithm scales as either \(nicefrac{sqrt{N}}{γ²}\)log\(nicefrac1{γ²\)} or nicefrac{N}{sqrtγ}, which is achieved by a hybrid of classical and quantum search. In this paper, we improve the version space quantum training method for perceptrons such that the query complexity of our algorithm scales as sqrt{nicefrac{N}γ}. This is achieved by constructing an oracle for the perceptrons using quantum counting of the number of data elements that are correctly classified. We show that query complexity to construct such an oracle has a quadratic improvement over classical methods. Once such an oracle is constructed, bounded-error quantum search can be used to search over the hyperplane instances. The optimality of our algorithm is proven by reducing the evaluation of a two-level AND-OR tree (for which the query complexity lower bound is known) to a multi-criterion search. Our quantum training algorithm can be generalized to train more complex machine learning models such as neural networks, which are built on a large number of perceptrons.