1. Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing. STOC ’11, pp 333–342. ACM, New York (2011)
2. Shepherd, D., Bremner, M.J.: Temporally unstructured quantum computation. In: Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, vol. 465, pp 1413–1439. The Royal Society (2009)
3. Boixo, S., Isakov, S.V., Smelyanskiy, V.N., Babbush, R., Ding, N., Jiang, Z., Martinis, J.M., Neven, H.: Characterizing quantum supremacy in near-term devices. arXiv: http://arXiv.org/abs/1608.00263 (2016)
4. Aaronson, S., Chen, L.: Complexity-theoretic foundations of quantum supremacy experiments. arXiv: http://arXiv.org/abs/1612.05903 (2016)
5. Bermejo-Vega, J., Hangleiter, D., Schwarz, M., Raussendorf, R., Eisert, J.: Architectures for quantum simulation showing a quantum speedup (2017)