Equivalences and Separations Between Quantum and Classical Learnability

DOI10.1137/S0097539704412910zbMath1101.68623WikidataQ60307424 ScholiaQ60307424MaRDI QIDQ4651506

Steven J. Gortler, Rocco A. Servedio

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

computational learning theoryquantum computationPAC learningquery complexity

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68)

Related Items (16)

Quantum machine learning: a classical perspective ⋮ Quantum adiabatic machine learning ⋮ Quantum learning Boolean linear functions w.r.t. product distributions ⋮ Learning bounds for quantum circuits in the agnostic setting ⋮ Learning quantum finite automata with queries ⋮ An improved lower bound on query complexity for quantum PAC learning ⋮ Quantum AdaBoost algorithm via cluster state ⋮ Robust online Hamiltonian learning ⋮ Quantum algorithms for learning and testing juntas ⋮ Quantum Relief algorithm ⋮ Improved bounds on quantum learning algorithms ⋮ Unnamed Item ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Unnamed Item ⋮ RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC ⋮ Quantum algorithms for learning symmetric juntas via the adversary bound

This page was built for publication: Equivalences and Separations Between Quantum and Classical Learnability