[20] Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. Quantum adiabatic evolution algorithms
versus simulated annealing, 2002, arXiv:quant-ph/0201031.
[21] WMC Foulkes, L Mitas, RJ Needs, and G Rajagopal. Quantum monte carlo simulations of
solids. Reviews of Modern Physics, 73(1):33, 2001. DOI: 10.1103/RevModPhys.73.33.
[22] M. B. Hastings. Quantum adiabatic computation with a constant gap is not useful in one
dimension. Phys. Rev. Lett., 103:050502, 2009, arXiv:0902.2960. DOI: 10.1103/Phys-
RevLett.103.050502.
[23] Matthew B Hastings and MH Freedman. Obstructions to classically simulating the quan-
tum adiabatic algorithm. Quantum Information & Computation, 13(11-12):1038–1076, 2013,
arXiv:1302.5733. DOI: 10.5555/2535639.2535647.
[24] Wassily Hoeffding. Probability inequalities for sums of bounded random vari-
ables. Journal of the American Statistical Association, 58(301):13–30, 1963. DOI:
10.1080/01621459.1963.10500830.
[25] Layla Hormozi, Ethan W. Brown, Giuseppe Carleo, and Matthias Troyer. Nonstoquastic
hamiltonians and quantum annealing of an ising spin glass. Phys. Rev. B, 95:184416, May
2017. DOI: 10.1103/PhysRevB.95.184416.
[26] Michael Jarret and Brad Lackey. Substochastic Monte Carlo algorithms, 2017,
arXiv:1704.09014.
[27] Michael Jarret, Stephen P Jordan, and Brad Lackey. Adiabatic optimization versus diffusion
monte carlo methods. Physical Review A, 94(4), 2016, arXiv:1607.03389. DOI: 10.1103/Phys-
RevA.94.042318.
[28] Mark Jerrum and Alistair Sinclair. Polynomial-time approximation algorithms for the Ising
model. SIAM Journal on Computing, 22:1087–1116, 1993. DOI: 10.1137/0222066.
[29] Mark Jerrum and Alistair Sinclair. The Markov chain Monte Carlo method: An approach to
approximate counting and integration. In Dorit S. Hochbaum, editor, Approximation Algo-
rithms for NP-hard Problems, pages 482–520. PWS Publishing Co., Boston, MA, USA, 1997.
ISBN 0-534-94968-1. DOI: 10.5555/241938.241950.
[30] Zhang Jiang, Vadim N Smelyanskiy, Sergei V Isakov, Sergio Boixo, Guglielmo Mazzola,
Matthias Troyer, and Hartmut Neven. Scaling analysis and instantons for thermally assisted
tunneling and quantum Monte Carlo simulations. Physical Review A, 95(1):012322, 2017,
arXiv:1603.01293. DOI: 10.1103/PhysRevA.95.012322.
[31] Tadashi Kadowaki and Hidetoshi Nishimori. Quantum annealing in the transverse Ising
model. Phys. Rev. E, 58:5355–5363, Nov 1998, arXiv:cond-mat/9804280. DOI: 10.1103/Phys-
RevE.58.5355.
[32] Linghang Kong and Elizabeth Crosson. The performance of the quantum adiabatic algorithm
on spike Hamiltonians. Int. J. Quantum Inform., 15(1750011), 2015, arXiv:1511.06991. DOI:
10.1142/S0219749917500113.
[33] Zeph Landau, Umesh Vazirani, and Thomas Vidick. A polynomial-time algorithm for the
ground state of 1D gapped local Hamiltonians. Nature Physics, 2013, arXiv:1307.5143.
DOI: 10.1038/nphys3345.
[34] D.A. Levin, Y. Peres, and E.L. Wilmer. Markov Chains and Mixing Times. American Math-
ematical Soc., 2008. ISBN 9780821886274. DOI: 10.1090/mbk/107.
[35] Fabio Martinelli and Marc Wouts. Glauber dynamics for the quantum Ising model in a
transverse field on a regular tree. Journal of Statistical Physics, 146(5):1059–1088, 2012,
arXiv:1105.5970. DOI: 10.1007/s10955-012-0436-7.
25