1. Aaronson S (2003) Multilinear formulas and skepticism of quantum computing. quant-ph/0311039
2. Aaronson S (2004) Quantum computing: postselection and probabilistic polynomial time. quant-ph/0412187
3. Aaronson S (2005a) NP-complete problems and physical reality. quant-ph/0502072
4. Aaronson S (2005b) Are quantum states exponentially long vectors. quant-ph/0507242
5. Abrams DS, Lloyd S (1998) Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P complete problems. quant-ph/9801041