Author:
Childs Andrew M.,Lee Troy
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Ambainis, A.: A better lower bound for quantum algorithms searching an ordered list. In: Proc. 40th FOCS, pp. 352–357 (1999)
2. Ambainis, A.: Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences 64(4), 750–767 (2002); Preliminary version in STOC 2000
3. Ambainis, A.: Polynomial degree vs. quantum query complexity. Journal of Computer and System Sciences 72(2), 220–238 (2006); Preliminary version in FOCS 2003
4. Barnum, H., Saks, M., Szegedy, M.: Quantum query complexity and semidefinite programming. In: Proc. 18th CCC, pp. 179–193 (2003)
5. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM 48(4), 778–797 (2001); Preliminary version in FOCS 1998
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献