1. [1] Aaronson, S.: Limitations of quantum advice and one-way communication, Proc. 19th Annual IEEE Conference on Computational Complexity, IEEE, New York, pp.320-332 (2004). Its journal version appeared in Theory of Computing, Vol.1, pp.1-28 (2005).
2. [2] Aaronson, S.: Oracles are subtle but not malicious. http://arxiv.org/cs.CC/0504048
3. Quantum Computability
4. Dense quantum coding and quantum finite automata
5. The structure of logarithmic advice complexity classes