Author:
Guo Tingting,Wang Peng,Hu Lei,Ye Dingfeng
Publisher
Springer International Publishing
Reference34 articles.
1. Belovs, A., Spalek, R.: Adversary lower bound for the k-sum problem. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, pp. 323–328 (2013)
2. Lecture Notes in Computer Science;D Boneh,2013
3. Bonnetain, X.: Tight bounds for Simon’s algorithm. IACR Cryptology ePrint Archives 2020, 919 (2020). https://eprint.iacr.org/2020/919
4. Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. 305, 53–74 (2002)
5. Brassard, G., Hoyer, P., Tapp, A.: Quantum algorithm for the collision problem. arXiv preprint quant-ph/9705002 (1997)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献