1. Aaronson, S.: The limits of quantum. Sci. Am. 62–69 (2008)
2. Aaronson, S.: Shtetl-optimized – $$2^n$$ is exponential, but $$2^{50}$$ is finite (2017).
https://www.scottaaronson.com/blog/?p=3512
3. Aaronson, S.: Why Google’s quantum supremacy milestone matters. The New York Times (2019).
https://www.nytimes.com/2019/10/30/opinion/google-quantum-computer-sycamore.html
4. Aaronson, S., Chen, L.: Complexity-theoretic foundations of quantum supremacy experiments. Technical report No. 200, Electronic Colloquium on Computational Complexity (2016)
5. Abbott, A.A.: The Deutsch-Jozsa problem: De-quantisation and entanglement. Nat. Comput. 11(1), 3–11 (2011)