Author:
Nishimura Harumichi,Yamakami Tomoyuki
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Adleman, L.M., DeMarrais, J., Huang, M.A.: Quantum computability. SIAM J. Comput. 26, 1524–1540 (1997)
2. Ambainis, A.: A better lower bound for quantum algorithms searching an ordered list. In: Proc. 40th FOCS, pp. 352–357 (1999)
3. Ambainis, A.: Quantum lower bounds by quantum arguments. J. Comput. System Sci. 64, 750–767 (2002)
4. Ambainis, A.: Polynomial degree vs. quantum query complexity. In: Proc. 44th FOCS, pp. 230–240 (2003)
5. Barnum, H., Saks, M., Szegedy, M.: Quantum query complexity and semidefinite programming. In: Proc. 18th CCC, pp. 179–193 (2003)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Power of Adaptivity in Quantum Query Algorithms;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Adversary Lower Bounds for Nonadaptive Quantum Algorithms;Logic, Language, Information and Computation;2008
3. Quantum Computation with Supplementary Information;IPSJ Digital Courier;2005