Publisher
Springer Berlin Heidelberg
Reference42 articles.
1. Ambainis, A., Childs, A.M., Le Gall, F., Tani, S.: The quantum query complexity of certification. Quantum Inf. Comput. 10, 181–188 (2010) (
arXiv:0903.1291
[quant-ph])
2. Ambainis, A., Childs, A.M., Reichardt, B.W., Špalek, R., Zhang, S.: Any AND-OR formula of size
$$N$$
can be evaluated in time
$${N}^{1/2+o(1)}$$
on a quantum computer. SIAM J. Comput. 39(6), 2513–2530 (2010). (Earlier version in FOCS’07)
3. Ambainis, A.: Quantum lower bounds by quantum arguments. J. Comput. Syst. Sci. 64, 750–767 (2002). (arXiv:quant-ph/0002066. Earlier version in STOC’00)
4. Ambainis, A.: Polynomial degree and lower bounds in quantum complexity: collision and element distinctness with small range. Theory Comput. 1, 37–46 (2005). (arXiv:quant-ph/0305179)
5. Ambainis, A.: Polynomial degree vs. quantum query complexity. J. Comput. Syst. Sci. 72(2), 220–238 (2006). (arXiv:quant-ph/0305028. Earlier version in FOCS’03)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献