Boulder School 2010: Reading Material

Week 1
Troyer
Trebst
Melko
Refael
Week 2
Week 3
Huse
Week 4
Terhal
Nayak & Terhal

Articles

  1. “Quantum NP- A survey”, D. Aharonov and T. Naveh, http://arxiv.org/abs/quant-ph/0210077
  2. “The power of quantum systems on a line”, D. Aharonov, D. Gottesman, S. Irani, J. Kempe, http://arxiv.org/abs/0705.4077
  3. “Efficient algorithm for a quantum analogue of 2-SAT”, S. Bravyi,  http://arxiv.org/abs/quant-ph/0602108
  4. The computational difficulty of finding MPS ground states, N. Schuch, I. Cirac, F. Verstraete, http://arxiv.org/abs/0802.3351

Books

  1. C. Papadimitriou , “Computational Complexity” (Addison Wesley, 1993).
  2. A. Yu. Kitaev, A. H. Shen, M. N. Vyalyi, “Classical and Quantum Computation (Graduate Studies in Mathematics)” (AMS, 2002).

For a survey of quantum complexity theory:

Quantum Computational Complexity, John Watrous, http://arxiv.org/abs/0804.3401 (Springer Encyclopedia of Complexity and Systems Science).

For a gentle introduction to quantum computation and information:

An Introduction to Quantum Computation, P. Kaye, R. Laflamme, M. Mosca (Oxford University Press, 2007).