1. E. Farhi et al., A quantum adiabatic algorithm applied to random instances of an NP-complete problem, Science 292, 472–476 (2001).
2. M. G. Garey and D. S. Johnson, Computers and Intractability (W.H. Freeman and Company, New York, 1979).
3. J. Roland and N. J. Cerf, Quantum search by local adiabatic evolution, http://xxx.lanl.gov/ abs/_quant-ph/0107015 (2001).
4. L. K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79(2), 325–328 (1997).
5. F. Barahona, On the computational complexity of Ising spin glass models, J. Phys. A 15, 3241 (1982).