Author:
Mukherjee Chandra Sekhar,Maitra Subhamoy
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modeling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference16 articles.
1. Aaronson, S., Ambainis, A.: Forrelation: a problem that optimally sepa-rates quantum from classical computing. In: Proceedings of STOC’2015 (2015)
2. Ambainis, A.: Superlinear advantage for exact quantum algorithms. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing. ACM Press, New York, pp. 891–900 (2013)
3. Ambainis, A., Balodis, K., Belovs, A., Lee, T., Santha, M., Smotrovs, J.: Separations in query complexity based on pointer functions. J. ACM 64, 5, Article 32 (2017)
4. Ambainis, A., Iraids, J., Nagaj, D.: Exact quantum query complexity of $${\sf EXACT^n_{k,l}}$$. Theory and practice of computer science. SOFSEM 2017. LNCS, vol 10139, (2017)
5. Barnum, H., Saks, M., Szegedy, M.: Quantum query complexity and semi-definite programming. In: Proceedings of 18th IEEE Annual Conference on Computational Complexity, pp. 179–193 (2003)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献