1. S. Aaronson, S. Beigi, A. Drucker, B. Fefferman & P. Shor (2009). The Power of Unentanglement. Theory of Computing 5(1), 1–42.
2. S. Aaronson, A. Cojocaru, A. Gheorghiu & E. Kashefi (2019). Complexity-theoretic limitations on blind delegated quantum computation. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), C. Baier, I. Chatzigiannakis, P. Flocchini & S. Leonardi, editors, volume 132 of Leibniz International Proceedings in Informatics (LIPIcs), 6:1–6:13. Schloss Dagstuhl—Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany.
3. S. Aaronson & A. Drucker (2014). A full characterization of quantum advice. SIAM Journal on Computing 43(3), 1131–1183.
4. D. Aharonov (2003). A simple proof that Toffoli and Hadamard are quantum universal. Available at arXiv:quant-ph/0301040v1.
5. D. Aharonov, M. Ben-Or, F. Brandão & O. Sattath (2022). The pursuit of uniqueness: Extending Valiant-Vazirani Theorem to the probabilistic and quantum Settings. Quantum 6, 668.