Equivalences and separations between quantum and classical learnability

SIAM Journal on Computing

Volumn 33, Issue 5, 2004, Pages 1067-1092

  Servedio, Rocco A ^a   Gortler, Steven J ^b  

^a Department of Earth and Environmental Sciences   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Computational learning theory; Pac learning; Quantum computation; Query complexity

Indexed keywords

COMPUTATIONAL LEARNING THEORY; PAC LEARNING; QUANTUM COMPUTATION; QUERY COMPLEXITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; INFORMATION ANALYSIS; MATHEMATICAL MODELS; POLYNOMIALS; QUANTUM THEORY; TIME SERIES ANALYSIS;

BOOLEAN FUNCTIONS;

EID: 8344269350     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704412910     Document Type: Article

References (46)

1. A. AMBAINIS, Quantum lower bounds by quantum arguments, in Proceedings of the 32nd ACM Symposium on Theory of Computing, Portland, OR, 2000, ACM, New York, pp. 636-643.
2. D. ANGLUIN, Queries and concept learning, Machine Learning, 2 (1988), pp. 319-342.
3. D. ANGLUIN AND M. KHARITONOV, When won't membership queries help?, J. Comput. Systems Sci., 50 (1995), pp. 336-355.
4. M. ANTHONY AND N. BIGGS, Computational Learning Theory: An Introduction, Cambridge University Press, Cambridge, UK, 1997.
5. R. BEALS, H. BUHRMAN, R. CLEVE, M. MOSCA, AND R. DE WOLF, Quantum lower bounds by polynomials, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1998, IEEE Computer Society, Piscataway, NJ, pp. 352-361.
6. C. H. BENNETT, E. BERNSTEIN, G. BRASSARD, AND U. VAZIRANI, Strengths and weaknesses of quantum computing, SIAM J. Comput., 26 (1997), pp. 1510-1523.
7. E. BERNSTEIN AND U. VAZIRANI, Quantum complexity theory, SIAM J. Comput., 26 (1997), pp. 1411-1473.
8. A. BLUMER, A. EHRENFEUCHT, D. HAUSSLER, AND M. K. WARMUTH, Learnability and the Vapnik-Chervonenkis dimension, J. ACM, 36 (1989), pp. 929-965.
9. M. BOYER, G. BRASSARD, P. HØYER, AND A. TAPP, Tight bounds on quantum searching, Fortschr. Phys., 46 (1998), pp. 493-505.
10. G. BRASSARD, P. HØYER, AND A. TAPP, Quantum counting, in Proceedings of the 25th EATCS International Conference on Automata, Languages and Programming, Aalborg, Denmark, 1998, Springer, New York, pp. 820-831.
11. G. BRASSARD AND P. HØYER, An exact quantum polynomial-time algorithm for Simon's problem, in the Fifth Israeli Symposium on Theory of Computers and Systems, Ramat Gan, Israel, 1997, IEEE Computer Society Press, Los Alamitos, CA, pp. 12-23.
12. N. BSHOUTY, R. CLEVE, R. GAVALDÀ, S. KANNAN, AND C. TAMON, Oracles and queries that are sufficient for exact learning, J. Comput. Syst. Sci., 52 (1996), pp. 421-433.
13. N. H. BSHOUTY AND J. C. JACKSON, Learning DNF over the uniform distribution using a quantum example oracle, SIAM J. Comput., 28 (1999), pp. 1136-1153.
14. H. BUHRMAN, R. CLEVE, R. DE WOLF, AND C. ZALKA, Reducing error probability in quantum algorithms, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, New York, 1999, IEEE Computer Society, Piscataway, NJ, pp. 358-368.
15. H. BUHRMAN, R. CLEVE, AND A. WIGDERSON, Quantum vs. classical communication and computation, in Proceedings of the 30th ACM Symposium on Theory of Computing, Dallas, TX, 1998, ACM, New York, 1998, pp. 63-68.
16. R. CLEVE, An introduction to quantum complexity theory, in Collected Papers on Quantum Computation and Quantum Information Theory, C. Macchiavello, G. M. Palma, and A. Zeilinger, eds., World Scientific, River Edge, NJ, 2000, pp. 103-127.
17. D. DEUTSCH AND R. JOZSA, Rapid solution of problems by quantum computation, Proc. Roy. Soc. London A, 439 (1992), pp. 553-558.
18. R. DE WOLF, personal communication, 2000.
19. E. FARHI, J. GOLDSTONE, S. GUTMANN, AND M. SIPSER, How many functions can be distinguished with k quantum queries?, Phys. Rev. A, 60 (1999), pp. 4331-4333.
20. S. FENNER, L. FORTNOW, S. KURTZ, AND L. LI, An oracle builder's toolkit, in Proceedings of the Eighth Structure in Complexity Theory Conference, San Diego, CA, 1993, IEEE Computer Society Press, Los Alamitos, CA, pp. 120-131.
21. L. FORTNOW AND J. ROGERS, Complexity limitations on quantum computation, J. Comput. System. Sci., 59 (1999), pp. 240-252.
22. R. GAVALDÀ, The complexity of learning with queries, in Proceedings of the Ninth Structure in Complexity Theory Conference, Amsterdam, 1994, IEEE Computer Society Press, Los Alamitos, CA, pp. 324-337.
23. O. GOLDREICH, S. GOLDWASSER, AND S. MICALI, How to construct random functions, J. ACM, 33 (1986), pp. 792-807.
24. L. K. GROVER, A fast quantum mechanical algorithm for database search, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, 1996, ACM, New York, pp. 212-219.
25. J. HÅSTAD, R. IMPAGLIAZZO, L. A. LEVIN, AND M. LUBY, A pseudorandom generator from any one-way function, SIAM J. Comput., 28 (1999), pp. 1364-1396.
26. T. HEGEDÜS, Generalized teaching dimensions and the query complexity of learning, in Proceedings of the Eighth Conference on. Computer Learning Theory, Santa Cruz, CA, 1995, ACM Press, New York, pp. 108-117.
27. L. HELLERSTEIM, K. PILLAIPAKKAMNATT, V. RAGHAVAN, AND D. WILKINS, How many queries are needed to learn?, J. ACM, 43 (1996), pp. 840-862.
28. M. KEARNS AND L. VALIANT, Cryptographic limitations on learning Boolean formulae and finite automata, J. ACM 41, (1994), pp. 67-95.
29. M. KEARNS AND U. VAZIRANI, An Introduction to Computational Learning Theory, MIT Press, Cambridge, MA, 1994.
30. M. LUBY AND C. RACKOFF, How to construct pseudorandom permutations from pseudrandom functions, SIAM J. Comput., 17 (1988), pp. 373-386.
31. M. NIELSEN AND I. CEUANG, Quantum Computation and Quantum information, Cambridge University Press, Cambridge, UK, 2000.
32. J. ORTEGA, Matrix Theory: A Second Course, Plenum Press, New York, 1987.
33. J. PATARIN, How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function, in Proceedings of Advances in Cryptography (EU-ROCRYPT '92), Workshop on the Theory and Application of Cryptographic Techniques, Balatonfured, Hungary, 1992, Springer, New York, pp. 256-266.
34. J. PIERPZYK, How to construct pseudorandom permutations from single pseudorandom functions, in Proceedings of Advances in Cryptography (EUROCRYPT '90), Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, 1990, Springer, New York, pp. 140-150.
35. J. PIERPZYK AND B. SADEGHIYAN, A construction for super pseudorandom permutations from a single pseudorandom function, in Proceedings of Advances in Cryptography (EURO-CRYPT '92), Workshop on the Theory and Application of Cryptographic Techniques, Balatonfured, Hungary, 1992, Springer, New York, pp. 267-284.
36. J. PRESKILL, Lecture Notes on Quantum Computation, 1998, available online at http://www.theory.caltech.edu/people/preskill/ph229/.
37. R. SERVEDIO AND S. GORTLER, Quantum versus classical learnability, in Proceedings of the 16th Conference on. Computational Complexity, Chicago, 2001, IEEE Computer Society Press, Los Alamitos, CA, pp. 138-148.
38. R. SERVEDIO, Separating quantum and classical learning, in Proceedings of the 28th EATCS International Conference on Automata, Languages, and Programming, Heraklion, Crete, 2001, Springer, New York, pp. 1065-1080.
39. P. W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
40. D. R. SIMON, On the power of quantum computation, SIAM J. Comput., 26 (1997), pp. 1474-1483.
41. L. G. VALIANT, A theory of the learnable, Comm. ACM, 27 (1984), pp. 1134-1142.
42. J. H. VAN LINT, Introduction to Coding Theory, Springer-Verlag, New York, 1992.
43. V. N. VAPNIK AND A. Y. CHERVONENKIS, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl., 16 (1971), pp. 264-280.
44. A. YAO, Theory and applications of trapdoor functions, in Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, Chicago. IL, 1982, pp. 80-91.
45. A. C. YAO, Quantum circuit complexity, in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1993, pp. 352-361.
46. C. ZALKA, Grover's quantum searching algorithm is optimal, Phys. Rev. A, 60 (1999), pp. 2746-2751.