Quantum predictive learning and communication complexity with single input

MaRDI QIDQ2906787zbMATH OpenFDO

Authors Dmitry Gavinsky

Publication date 5 September 2012

Published in Quantum Information \& Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0812.3429

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Learning and adaptive systems in artificial intelligence (68T05) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68)

Recommendations

• Equivalences and Separations Between Quantum and Classical Learnability
• Optimal quantum sample complexity of learning algorithms
• scientific article; zbMATH DE number 1754656
• New bounds on classical and quantum one-way communication complexity
• Optimal quantum sample complexity of learning algorithms

Cited in

(3)

• Quantum anonymous ranking and selection with verifiability
• Optimal quantum sample complexity of learning algorithms
• Learning quantum finite automata with queries

This page was built for publication: Quantum predictive learning and communication complexity with single input

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