Separating quantum and classical earning

DOI10.1007/3-540-48224-5_86MaRDI QIDQ4535084zbMATH OpenFDO

Authors Rocco A. Servedio

Publication date 12 June 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2076/20761065

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational learning theory (68Q32) Quantum computation (81P68) Cryptography (94A60)

Recommendations

• Improved bounds on quantum learning algorithms
• Quantum hardness of learning shallow classical circuits
• Quantum learning of concentrated Boolean functions
• Quantum learning Boolean linear functions w.r.t. product distributions

Cited in

(6)

• Quantum speed-up for unsupervised learning
• Using diverging predictions from classical and quantum models to dissociate between categorization systems
• Quantum predictive learning and communication complexity with single input
• Equivalences and Separations Between Quantum and Classical Learnability
• Quantum hardness of learning shallow classical circuits
• Quantum inductive inference by finite automata

This page was built for publication: Separating quantum and classical earning

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