Author:
Lund A. P.,Bremner Michael J.,Ralph T. C.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Statistical and Nonlinear Physics,Computer Science (miscellaneous)
Reference60 articles.
1. Preskill, J. Quantum computing and the entanglement frontier. Preprint at arXiv:1203.5813 (2012).
2. Terhal, B. M. & DiVincenzo, D. P. Quantum information and computation. 4, 134–145. Preprint at arXiv:quant-ph/0205133 (2004).
3. Papadimitriou C. Computational Complexity, (AddisonWesley, 1994).
4. Bremner, M. J., Jozsa, R. & Shepherd, D. J. Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. Proc. R. Soc. A 467, 459–472. Preprint at arXiv:1005.1407 (2011).
5. Aaronson, S., Arkhipov, A. The Computational Complexity of Linear Optics. Theory Comput. 4, 143–252. Preprint at arXiv:1011.3245 (2013).
Cited by
128 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献