Quantum versus classical learnability

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 138-148

  Servedio, R A ^a   Gortler, S J ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS; MEMBERSHIP FUNCTIONS; POLYNOMIALS;

QUANTUM BLACK BOX QUERY COMPLEXITY; QUANTUM COMPUTERS;

BOOLEAN FUNCTIONS;

EID: 0034858471     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. Quantum lower bounds by quantum arguments
2. Queries and concept learning
3. When won't membership queries help?
4. Quantum lower bounds by polynomials
5. Strengths and weaknesses of quantum computing
6. Quantum complexity theory
7. Learnability and the Vapnik-Chervonenkis dimension
8. Tight bounds on quantum searching
9. Quantum counting
10. An exact quantum polynomial-time algorithm for Simon's problem
11. Oracles and queries that are sufficient for exact learning
12. Learning DNF over the uniform distribution using a quantum example oracle
13. Reducing error probability in quantum algorithms
14. Quantum vs. classical communication and computation
15. An introduction to quantum complexity theory
16. Rapid solution of problems by quantum computation
17. How many functions can be distinguished with κ quantum queries?
18. An oracle builder's toolkit
19. Complexity limitations on quantum computation
20. The complexity of learning with queries
21. A fast quantum mechanical algorithm for database search
22. Generalized teaching dimensions and the query complexity of learning
23. How many queries are needed to learn?
24. Cryptographic limitations on learning boolean formulae and finite automata
25. Separating quantum and classical learning
26. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
27. On the power of quantum computation
28. A theory of the learnable
29. On the uniform convergence of relative frequencies of events to their probabilities
30. Quantum circuit complexity
31. Grover's quantum searching algorithm is optimal