scientific article; zbMATH DE number 2090015

zbMATH Open1077.68663arXivquant-ph/0202066MaRDI QIDQ4808682FDOQ4808682

Authors: Jeffrey Jackson, C. Tamon, Tomoyuki Yamakami 

Publication date: 12 August 2004

Full work available at URL: https://arxiv.org/abs/quant-ph/0202066

Title of this publication is not available (Why is that?)

Recommendations

• Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
• Improved bounds on quantum learning algorithms
• More efficient PAC-learning of DNF with membership queries under the uniform distribution
• Learnability of DNF with representation-specific queries
• An improved lower bound on query complexity for quantum PAC learning

Mathematics Subject Classification ID

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

Cited In (3)

• Optimal quantum sample complexity of learning algorithms
• An improved lower bound on query complexity for quantum PAC learning
• Improved bounds on quantum learning algorithms

This page was built for publication:

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