A quadratic sample complexity reduction for agnostic learning via quantum algorithms

DOI10.1142/S0219749925500236MaRDI QIDQ6898665zbMATH OpenFDO

Authors Daniel Z. Zanger

Publication date 17 November 2025

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219749925500236

zbMATH Keywords

agnostic learningquantum learning theorysample complexity

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites work

• General nonexact oracle inequalities for classes with a subexponential envelope
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Mean estimation when you have the source code; or, quantum Monte Carlo methods
• Optimal quantum sample complexity of learning algorithms
• Quantum computation and quantum information. 10th anniversary edition
• Quantum speedup of Monte Carlo integration with respect to the number of dimensions and its application to finance
• Quantum speedup of Monte Carlo methods
• The importance of convexity in learning with squared loss

This page was built for publication: A quadratic sample complexity reduction for agnostic learning via quantum algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6898665)