arXiv (All)
open access
Unconditional Quantum PAC Learning Advantage in the Large Error Regime
We establish an unconditional super-polynomial separation between quantum and classical PAC learning of Boolean functions under the uniform distribution in the large error regime. For every advantage $λ(n) = n^{-ω(1)}$, we construct a concept class that a polynomial-time quantum learner learns to ag
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Probabilistic Storage and Retrieval of Quantum Superchannels for "Retrospective" Intervention#1141578
- Distributing Quantum Computations, Shot-Wise#274736
- A Few Constrain Many: Correlation-Enhanced Learning of Many-Body Quantum Systems#1145102
- 15 U.S.C. § 8841 — Quantum information science research and education program#565409
- Advances in quantum learning theory with bosonic systems#785159
Record · ID 1387552
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive