Communications of the ACM
An introduction to computational learning theory
An introduction to computational learning theory
Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
How many queries are needed to learn?
Journal of the ACM (JACM)
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SIAM Journal on Computing
On the Power of Quantum Computation
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
SIAM Journal on Computing
Information Processing Letters
Machine Learning
Machine Learning
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum Oracle Interrogation: Getting All Information for Almost Half the Price
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Equivalences and Separations Between Quantum and Classical Learnability
SIAM Journal on Computing
Improved algorithms for quantum identification of Boolean oracles
Theoretical Computer Science
The geometry of quantum learning
Quantum Information Processing
An improved lower bound on query complexity for quantum PAC learning
Information Processing Letters
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
SIAM Journal on Computing
Quantum search of partially ordered sets
Quantum Information & Computation
How many query superpositions are needed to learn?
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Quantum hardcore functions by complexity-theoretical quantum list decoding
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Improved algorithms for quantum identification of boolean oracles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
In this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples.