Author:
Ambainis Andris,Špalek Robert,de Wolf Ronald
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference40 articles.
1. Aaronson, S.: Limitations of quantum advice and one-way communication. Theory Comput. 1, 1–28 (2005). Earlier version in Complexity’04. quant-ph/0402095
2. Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51(4), 595–605 (2004)
3. Ambainis, A.: A new quantum lower bound method, with an application to strong direct product theorem for quantum search. quant-ph/0508200 (26 Aug 2005, submitted)
4. Ambainis, A.: Quantum lower bounds by quantum arguments. J. Comput. Syst. Sci. 64(4), 750–767 (2002). Earlier version in STOC’00. quant-ph/0002066
5. Ambainis, A.: Polynomial degree vs. quantum query complexity. J. Comput. Syst. Sci. 72(2), 220–238 (2006). Earlier version in FOCS’03. quant-ph/0305028
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献