Quantum Perceptron Revisited: Computational-Statistical Tradeoffs
Mathieu Roget, Giuseppe Di Molfetta, Hachem Kadri

TL;DR
This paper introduces a hybrid quantum-classical perceptron algorithm that outperforms classical perceptrons in complexity and generalization, demonstrating a quadratic improvement in sample efficiency and margin, while analyzing practical implementation challenges.
Contribution
It presents a new hybrid quantum-classical perceptron with improved complexity and generalization, and provides theoretical bounds and numerical analysis of quantum perceptron trade-offs.
Findings
Quadratic improvement in sample complexity over classical perceptron
Better generalization bounds for the hybrid quantum-classical model
Trade-offs between computational complexity and statistical accuracy
Abstract
Quantum machine learning algorithms could provide significant speed-ups over their classical counterparts; however, whether they could also achieve good generalization remains unclear. Recently, two quantum perceptron models which give a quadratic improvement over the classical perceptron algorithm using Grover's search have been proposed by Wiebe et al. arXiv:1602.04799 . While the first model reduces the complexity with respect to the size of the training set, the second one improves the bound on the number of mistakes made by the perceptron. In this paper, we introduce a hybrid quantum-classical perceptron algorithm with lower complexity and better generalization ability than the classical perceptron. We show a quadratic improvement over the classical perceptron in both the number of samples and the margin of the data. We derive a bound on the expected error of the hypothesis…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Neural Networks and Applications · Quantum Information and Cryptography
