Publisher
Springer Science and Business Media LLC
Subject
Physics and Astronomy (miscellaneous),General Mathematics
Reference35 articles.
1. Aharonov, D., Ben-Or, M., Eban, E., Mahadev, U.: Interactive proofs for quantum computations. arXiv:1704.04487 (2017)
2. Ambainis, A.: Quantum lower bounds by quantum arguments. J. Comput. Syst. Sci. 64(4), 750–767 (2002)
3. Ambainis, A.: Polynomial degree vs. quantum query complexity. In: 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings, pp 230–239 (2003)
4. Ambainis, A.: Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range. Theory of Computing 1(1), 37–46 (2005)
5. Bai, C. M., Li, Z. H., Si, M. M., Li, Y. M.: Quantum secret sharing for a general quantum access structure. Eur. Phys. J. D 71(10), 1–8 (2017)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献