Equivalences and Separations Between Quantum and Classical Learnability
暂无分享,去创建一个
[1] Nader H. Bshouty,et al. Learning DNF over the uniform distribution using a quantum example oracle , 1995, COLT '95.
[2] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[3] Tibor Hegedüs,et al. Generalized Teaching Dimensions and the Query Complexity of Learning , 1995, COLT.
[4] Sampath Kannan,et al. Oracles and Queries That Are Sufficient for Exact Learning , 1996, J. Comput. Syst. Sci..
[5] Gilles Brassard,et al. Tight bounds on quantum searching , 1996, quant-ph/9605034.
[6] Rocco A. Servedio,et al. Quantum versus classical learnability , 2000, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[7] Christof Zalka. GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL , 1997, quant-ph/9711070.
[8] Rocco A. Servedio,et al. Separating Quantum and Classical Learning , 2001, ICALP.
[9] Gilles Brassard,et al. An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[10] Leslie G. Valiant,et al. Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.
[11] Babak Sadeghiyan,et al. A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function , 1992, EUROCRYPT.
[12] Umesh V. Vazirani,et al. Quantum complexity theory , 1993, STOC.
[13] HellersteinLisa,et al. How many queries are needed to learn , 1996 .
[14] Tibor Hegedűs,et al. Generalized teaching dimensions and the query complexity of learning , 1995, Annual Conference Computational Learning Theory.
[15] Andrew Chi-Chih Yao,et al. Quantum Circuit Complexity , 1993, FOCS.
[16] Dana Angluin,et al. When won't membership queries help? , 1991, STOC '91.
[17] Lance Fortnow,et al. Complexity limitations on quantum computation , 1999, J. Comput. Syst. Sci..
[18] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[19] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[20] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[21] Stuart A. Kurtz,et al. On oracle builder's toolkit , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[22] Gilles Brassard,et al. Quantum Counting , 1998, ICALP.
[23] J. H. van Lint,et al. Introduction to Coding Theory , 1982 .
[24] D. Deutsch,et al. Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[25] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[26] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[27] J. H. van Lint,et al. Introduction to Coding Theory , 1982 .
[28] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[29] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[30] Lisa Hellerstein,et al. How many queries are needed to learn? , 1995, JACM.
[31] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[32] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[33] Dana Angluin,et al. Queries and concept learning , 1988, Machine Learning.
[34] M. Sipser,et al. Bound on the number of functions that can be distinguished with k quantum queries , 1999 .
[35] Josef Pieprzyk,et al. How to Construct Pseudorandom Permutations from Single Pseudorandom Functions , 1991, EUROCRYPT.
[36] Jacques Patarin,et al. How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function , 1992, EUROCRYPT.
[37] Andris Ambainis,et al. Quantum lower bounds by quantum arguments , 2000, STOC '00.
[38] R. Cleve. An Introduction to Quantum Complexity Theory , 1999, quant-ph/9906111.
[39] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[40] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[41] R. Gavalda. The complexity of learning with queries , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[42] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[43] Daniel R. Simon,et al. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[44] Martin Anthony,et al. Computational learning theory: an introduction , 1992 .
[45] J. Ortega. Matrix Theory: A Second Course , 1987 .
[46] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .