Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference32 articles.
1. Andris Ambainis (2002) Quantum Lower Bounds by Quantum Arguments. Journal of Computer and System Sciences 64(4): 750–767
2. Andris Ambainis (2006) Polynomial degree vs. quantum query complexity. Journal of Computer and System Sciences 72(2): 220–238
3. Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani (2010a) The quantum query complexity of certification. Quantum Information and Computation 10: 181–188
4. Andris Ambainis, Andrew M. Childs, Ben W. Reichardt, Robert Špalek, Shengyu Zhang (2010b) Any AND-OR Formula of Size N Can Be Evaluated in Time N 1/2+o(1) on a Quantum Computer. SIAM Journal on Computing 39(6): 2513
5. Andris Ambainis, Loïck Magnin, Martin Roetteler, & Jérémie Roland (2011). Symmetry-assisted adversaries for quantum state generation. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 167–177. IEEE Computer Society.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献