Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range
暂无分享,去创建一个
[1] Scott Aaronson,et al. Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.
[2] Andris Ambainis,et al. Quantum lower bounds by quantum arguments , 2000, STOC '00.
[3] Frédéric Magniez,et al. Quantum algorithms for the triangle problem , 2005, SODA '05.
[4] Samuel Kutin. A quantum lower bound for the collision problem , 2003 .
[5] AaronsonScott,et al. Quantum lower bounds for the collision and the element distinctness problems , 2004 .
[6] Andris Ambainis,et al. Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.
[7] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[8] Yongmei Shi. Approximating linear restrictions of Boolean functions , 2002 .
[9] Frédéric Magniez,et al. Quantum Algorithms for Element Distinctness , 2005, SIAM J. Comput..
[10] Andris Ambainis,et al. Polynomial degree vs. quantum query complexity , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[11] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[12] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..
[13] Noam Nisan,et al. On the degree of boolean functions as real polynomials , 1992, STOC '92.
[14] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[15] Andris Ambainis. Quantum Walk Algorithm for Element Distinctness , 2004, FOCS.
[16] Gilles Brassard,et al. Quantum Counting , 1998, ICALP.
[17] Yaoyun Shi,et al. Quantum lower bounds for the collision and the element distinctness problems , 2001, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[18] Felix Wu,et al. The quantum query complexity of approximating the median and related statistics , 1998, STOC '99.
[19] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[20] Scott Aaronson,et al. Quantum lower bound for the collision problem , 2001, STOC '02.
[21] Harry Buhrman,et al. Quantum verification of matrix products , 2004, SODA '06.
[22] Andris Ambainis. Quantum Lower Bounds by Quantum Arguments , 2002, J. Comput. Syst. Sci..
[23] Lov K. Grover. A framework for fast quantum mechanical algorithms , 1997, STOC '98.