Author:
Ambainis Andris,de Wolf Ronald
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference21 articles.
1. Aaronson S., Shi Y. (2004) Quantum Lower Bounds for the Collision and the Element Distinctness Problems. Journal of the ACM 51(4): 595–605
2. A. Ambainis (2006). Polynomial degree vs. quantum query complexity. Journal of Computer and System Sciences 72(2), 220–238. Earlier version in FOCS’03. quant-ph/0305028.
3. A. Ambainis, A. Bačkurs, J. Smotrovs & R. de Wolf (2013). Optimal quantum query bounds for almost all Boolean functions. In Proceedings of 30th Annual Symposium on Theoretical Aspects of Computer Science (STACS’13), 446–453. quant-ph/1208.1122.
4. R. Beals, H. Buhrman, R. Cleve, M. Mosca & R. de Wolf (2001). Quantum Lower Bounds by Polynomials. Journal of the ACM 48(4), 778–797. Earlier version in FOCS’98. quant-ph/9802049.
5. R. Beigel (1993). The Polynomial Method in Circuit Complexity. In Proceedings of the 8th IEEE Structure in Complexity Theory Conference, 82–95.
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. A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function;Quantum Information Processing;2019-01-16
3. Separations in query complexity using cheat sheets;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19