Revisiting dequantization and quantum advantage in learning tasks
Jordan Cotler, Hsin-Yuan Huang, Jarrod R. McClean

TL;DR
This paper shows that classical algorithms with sample and query access can outperform quantum algorithms with quantum state inputs in certain learning tasks, challenging assumptions about quantum advantage.
Contribution
It proves that classical algorithms with SQ access can be exponentially faster than quantum algorithms with quantum state inputs, highlighting the power of SQ access.
Findings
Classical SQ access algorithms can outperform quantum state input algorithms.
SQ access can be more powerful than quantum state inputs in some learning tasks.
Quantum advantage may be limited by the power of data access models.
Abstract
It has been shown that the apparent advantage of some quantum machine learning algorithms may be efficiently replicated using classical algorithms with suitable data access -- a process known as dequantization. Existing works on dequantization compare quantum algorithms which take copies of an n-qubit quantum state as input to classical algorithms which have sample and query (SQ) access to the vector . In this note, we prove that classical algorithms with SQ access can accomplish some learning tasks exponentially faster than quantum algorithms with quantum state inputs. Because classical algorithms are a subset of quantum algorithms, this demonstrates that SQ access can sometimes be significantly more powerful than quantum state inputs. Our findings suggest that the absence of exponential quantum advantage in some learning tasks may be due to SQ…
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 · Quantum-Dot Cellular Automata
