Quantum Learning Theory Beyond Batch Binary Classification
Arunachalam and de Wolf (2018) \cite{arunachalam2018optimal} showed that the sample complexity of quantum batch learning of boolean functions, in the realizable and agnostic settings, has the $\textit{same form and order}$ as the corresponding classical sample complexities. In this paper, we extend...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2025-07-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2025-07-29-1813/pdf/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|