How Many Query Superpositions Are Needed to Learn?

DOI10.1007/11894841_10MaRDI QIDQ3522978zbMATH OpenOpenAlexFDO

Authors Jorge Castro

Publication date 4 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11894841_10

Mathematics Subject Classification ID

Computational learning theory (68Q32) Quantum computation (81P68)

Recommendations

• Improved bounds on quantum learning algorithms
• Equivalences and Separations Between Quantum and Classical Learnability
• Optimal quantum sample complexity of learning algorithms
• Optimal quantum sample complexity of learning algorithms
• How many queries are needed to learn one bit of information?

Cited in

(8)

• Improved bounds on quantum learning algorithms
• How many queries are needed to learn?
• Optimal quantum sample complexity of learning algorithms
• Equivalences and Separations Between Quantum and Classical Learnability
• Two new results about quantum exact learning
• Optimal quantum sample complexity of learning algorithms
• scientific article; zbMATH DE number 7651037 (Why is no real title available?)
• The geometry of quantum learning

This page was built for publication: How Many Query Superpositions Are Needed to Learn?

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