Improved Bounds on Quantum Learning Algorithms
暂无分享,去创建一个
[1] Gebräuchliche Fertigarzneimittel,et al. V , 1893, Therapielexikon Neurologie.
[2] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[3] Leslie G. Valiant,et al. A general lower bound on the number of examples needed for learning , 1988, COLT '88.
[4] Dana Angluin,et al. Queries and concept learning , 1988, Machine Learning.
[5] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[6] 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.
[7] Umesh V. Vazirani,et al. Quantum complexity theory , 1993, STOC.
[8] Daniel R. Simon. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[9] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .
[10] R. Gavalda. The complexity of learning with queries , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[11] Sampath Kannan,et al. Oracles and Queries That Are Sufficient for Exact Learning , 1996, J. Comput. Syst. Sci..
[12] Nader H. Bshouty,et al. Learning DNF over the uniform distribution using a quantum example oracle , 1995, COLT '95.
[13] Tibor Hegedüs,et al. Generalized Teaching Dimensions and the Query Complexity of Learning , 1995, COLT.
[14] Lisa Hellerstein,et al. How many queries are needed to learn? , 1995, JACM.
[15] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[16] Thomas G. Dietterich. What is machine learning? , 2020, Archives of Disease in Childhood.
[17] Lisa Hellerstein,et al. How Many Queries Are Needed to Learn? , 1996, J. ACM.
[18] Gilles Brassard,et al. Tight bounds on quantum searching , 1996, quant-ph/9605034.
[19] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[20] Wim van Dam,et al. Quantum Oracle Interrogation: Getting All Information for Almost Half the Price , 1999 .
[21] M. Sipser,et al. Limit on the Speed of Quantum Computation in Determining Parity , 1998, quant-ph/9802045.
[22] Yaoyun Shi. Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables , 2000, Inf. Process. Lett..
[23] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[24] Andris Ambainis,et al. Quantum Identification of Boolean Oracles , 2004, STACS.
[25] Andris Ambainis,et al. Robust Quantum Algorithms for Oracle Identification (計算機科学基礎理論とその応用 研究集会報告集) , 2004 .
[26] Rocco A. Servedio,et al. Equivalences and Separations Between Quantum and Classical Learnability , 2004, SIAM J. Comput..