Separating quantum and classical learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 1065-1080

  Servedio, Rocco A ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BOOLEAN FUNCTIONS; INFORMATION THEORY; POLYNOMIAL APPROXIMATION; QUANTUM THEORY; COMPUTATIONAL LINGUISTICS; CRYPTOGRAPHY;

MEMBERSHIP QUERY; ONE-WAY FUNCTIONS; POLYNOMIAL-TIME; QUANTUM ALGORITHMS;

QUANTUM CRYPTOGRAPHY;

EID: 37349105305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_86     Document Type: Conference Paper

References (31)

1. D. Angluin. Queries and concept learning. Machine Learning 2 (1988), 319-342.
2. D. Angluin and M. Kharitonov. When won't membership queries help J. Comp. Syst. Sci. 50 (1995), 336-355.
3. R. Beals, H. Buhrman, R. Cleve, M. Mosca and R. de Wolf. Quantum lower bounds by polynomials, in "Proc. 39th Symp. on Found. of Comp. Sci. ," (1998), 352-361.
4. C. Bennett, E. Bernstein, G. Brassard and U. Vazirani. Strengths and weaknesses of quantum computing, SIAM J. Comp. 26(5) (1997), 1510-1523.
5. E. Bernstein & U. Vazirani. Quantum complexity theory, SICOMP 26(5) (1997), 1411-1473.
6. M. Boyer, G. Brassard, P. Høyer, A. Tapp. Tight bounds on quantum searching, Forschritte der Physik 46(4-5) (1998), 493-505.
7. G. Brassard, P. Høyer and A. Tapp. Quantum counting, in "Proc. 25th Int. Conf. on Automata, Languages and Programming" (1998), 820-831.
8. G. Brassard and P. Høyer. An exact quantum polynomial-time algorithm for Simon's problem, in "Proc. Fifth Israeli Symp. on Theory of Comp. and Systems" (1997), 12-23.
9. N. Bshouty, R. Cleve, R. Gavald̀a, S. Kannan and C. Tamon. Oracles and queries that are sufficient for exact learning, J. Comput. Syst. Sci. 52(3) (1996), 421-433.
10. N. Bshouty and J. Jackson. Learning DNF over the uniform distribution using a quantum example oracle, SIAM J. Comp. 28(3) (1999), 1136-1153.
11. H. Buhrman, R. Cleve and A. Wigderson. Quantum vs. classical communication and computation, in "Proc. 30th Symp. on Theory of Comp. " (1998), 63-68.
12. R. Cleve. An introduction to quantum complexity theory, to appear in "Collected Papers on Quantum Computation and Quantum Information Theory," ed. by C. Macchiavello, G. M. Palma and A. Zeilinger.
13. D. Deutsch and R. Jozsa. Rapid solution of problems by quantum computation, Proc. Royal Society of London A, 439 (1992), 553-558.
14. R. Gavald̀a. The complexity of learning with queries, in "Proc. Ninth Structure in Complexity Theory Conference" (1994), 324-337.
15. O. Goldreich, S. Goldwasser and S. Micali. How to construct random functions, J. ACM 33(4) (1986), 792-807.
16. L. K. Grover. A fast quantum mechanical algorithm for database search, in "Proc. 28th Symp. on Theory of Comp. " (1996), 212-219.
17. J. Hastad, R. Impagliazzo, L. Levin and M. Luby. A pseudorandom generator from any one-way function, SIAM J. Comp. 28(4) (1999), 1364-1396.
18. T. Hegedus. Generalized teaching dimensions and the query complexity of learning, in "Proc. Eighth Conf. on Comp. Learning Theory," (1995), 108-117.
19. L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan and D. Wilkins. How many queries are needed to learn J. ACM 43(5) (1996), 840-862.
20. M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata, J. ACM 41(1) (1994), 67-95.
21. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseu-drandom functions, SIAM J. Comp. 17(2) (1988), 373-386.
22. J. Patarin. How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function, in "Adv. in Crypt.-EUROCRYPT '92" (1992), 256-266.
23. J. Pierpzyk. How to construct pseudorandom permutations from single pseudorandom functions. in "Adv. in Crypt.-EUROCRYPT '90" (1990), 140-150.
24. J. Pierpzyk and B. Sadeghiyan. A construction for super pseudorandom permutations from a single pseudorandom function. in "Adv. in Crypt.-EUROCRYPT '92" (1992), 267-284.
25. J. Preskill. Lecture notes on quantum computation (1998). Available at http://www. theory. caltech. edu/people/preskill/ph229/
26. R. Servedio and S. Gortler. Quantum versus classical learnability, to appear in "Proc. 16th Conf. on Comput. Complex. " (2001).
27. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comp. 26(5) (1997), 1484-1509.
28. D. Simon. On the power of quantum computation, SIAM J. Comp. 26(5) (1997), 1474-1483.
29. A. Yao. Theory and applications of trapdoor functions, in "Proc. 23rd FOCS" (1982), 80-91.
30. A. Yao. Quantum circuit complexity, in "Proc. 34th FOCS" (1993), 352-361.
31. C. Zalka. Grover's quantum searching algorithm is optimal. Physical Review A 60 (1999), 2746-2751.