Information-Theoretic Limits of Quantum Learning via Data Compression
Armando Angrisani, Brian Coyle, Elham Kashefi

TL;DR
This paper introduces a quantum data compression framework to analyze the limits of quantum machine learning, providing lower bounds on sample complexity and data size for learning tasks, with implications for security in delegated quantum computation.
Contribution
It develops a systematic quantum lossy data compression approach to establish fundamental limits on quantum learning and secure delegated quantum computation.
Findings
Lower bounds on quantum sample complexity for Zipf-distributed data
Optimal quantum data size for learning linear functions
Enhanced security guarantees in measurement-based quantum delegation
Abstract
Understanding the power of quantum data in machine learning is central to many proposed applications of quantum technologies. While access to quantum data can offer exponential advantages for carefully designed learning tasks and often under strong assumptions on the data distribution, it remains an open question whether such advantages persist in less structured settings and under more realistic, naturally occurring distributions. Motivated by these practical concerns, we introduce a systematic framework based on quantum lossy data compression to bound the power of quantum data in the context of probably approximately correct (PAC) learning. Specifically, we provide lower bounds on the sample complexity of quantum learners for arbitrary functions when data is drawn from Zipf's distribution, a widely used model for the empirical distributions of real-world data. We also establish lower…
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.
