Publisher
Springer International Publishing
Reference38 articles.
1. Aaronson, S.: The aaronson \$25.00 prize. http://www.scottaaronson.com/blog/?p=284
2. Aaronson, S.: The equivalence of sampling and searching. Theory Comput. Syst. 55(2), 281–298 (2013)
3. Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC 2011, New York, NY, USA, pp. 333–342. Association for Computing Machinery (2011)
4. Aharonov, D., Ben-Or, M., Eban, E., Mahadev, U.: Interactive proofs for quantum computations. arXiv:1704.04487 (2017)
5. Aharonov, D., Van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Rev. 50(4), 755–787 (2008)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献