Communications of the ACM
Matrix analysis
Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
A framework for fast quantum mechanical algorithms
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
SIAM Journal on Computing
Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Machine Learning
Machine Learning
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Quantum versus Classical Learnability
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Improved Bounds on Quantum Learning Algorithms
Quantum Information Processing
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On quantum detection and the square-root measurement
IEEE Transactions on Information Theory
Quantum Algorithms for Learning and Testing Juntas
Quantum Information Processing
On the uselessness of quantum queries
Theoretical Computer Science
How many query superpositions are needed to learn?
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Improved algorithms for quantum identification of boolean oracles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Hi-index | 0.00 |
Concept learning provides a natural framework in which to place the problems solved by the quantum algorithms of Bernstein-Vazirani and Grover. By combining the tools used in these algorithms--quantum fast transforms and amplitude amplification--with a novel (in this context) tool--a solution method for geometrical optimization problems--we derive a general technique for quantum concept learning. We name this technique "Amplified Impatient Learning" and apply it to construct quantum algorithms solving two new problems: Battleship and Majority, more efficiently than is possible classically.