1. Aaronson S (2002) Quantum lower bound for the collision problem. In: Proceedings of the 35th annual ACM symposium on theory of computing. ACM Press, New York
2. Aaronson S (2005) Limitations of quantum advice and one-way communication. Theory Comput 1:1–28
3. Aaronson S (2006) QMA/qpoly is contained in PSPACE/poly: de-Merlinizing quantum protocols. In: Proceedings of the 21st annual IEEE conference on computational complexity. IEEE Computer Society Press, Los Alamitos, pp 261–273
4. Aaronson S, Kuperberg G (2007) Quantum versus classical proofs and advice. Theory Comput 3:129–157
5. Aaronson S, Shi Y (2004) Quantum lower bounds for the collision and the element distinctness problems. J ACM 51(4):595–605