Advantage of Quantum Machine Learning from General Computational Advantages
Hayata Yamasaki, Natsuto Isogai, Mio Murao

TL;DR
This paper constructs a broad class of supervised learning tasks where quantum algorithms provably outperform all classical methods, demonstrating a general computational advantage for quantum machine learning beyond specific algorithms like Shor's.
Contribution
It introduces a new family of supervised learning tasks with provable quantum advantages based on general computational power, extending beyond prior specific algorithm-based advantages.
Findings
Quantum algorithms can efficiently compute a large class of functions that classical algorithms cannot.
The paper proves the classical hardness of achieving these learning tasks within polynomial time.
Protocols are proposed for preparing classical data to experimentally demonstrate quantum advantage.
Abstract
An overarching milestone of quantum machine learning (QML) is to demonstrate the advantage of QML over all possible classical learning methods in accelerating a common type of learning task as represented by supervised learning with classical data. However, the provable advantages of QML in supervised learning have been known so far only for the learning tasks designed for using the advantage of specific quantum algorithms, i.e., Shor's algorithms. Here we explicitly construct an unprecedentedly broader family of supervised learning tasks with classical data to offer the provable advantage of QML based on general quantum computational advantages, progressing beyond Shor's algorithms. Our learning task is feasibly achievable by executing a general class of functions that can be computed efficiently in polynomial time for a large fraction of inputs by arbitrary quantum algorithms but not…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
