The quantum adiabatic algorithm applied to random optimization problems: The quantum spin glass perspective

Physics Reports

Volumn 523, Issue 3, 2013, Pages 127-205

  Bapst, V ^a   Foini, L ^b   Krzakala, F ^c   Semerjian, G ^a   Zamponi, F ^a  

^a LABORATOIRE DE PHYSIQUE STATISTIQUE   (France)

^b LPTHE   (France)

^c Centre National de la Recherche Scientifique   (France)

Author keywords

Computational complexity; Quantum adiabatic algorithm; Quantum annealing; Quantum spin glasses

Indexed keywords

EID: 84873096101     PISSN: 03701573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physrep.2012.10.002     Document Type: Review

References (293)

1. Garey M.R., Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness 1979, W.H. Freeman and Company, New York.
2. Papadimitriou C.H. Computational Complexity 1994, Addison-Wesley.
3. Papadimitriou C., Steiglitz K. Combinatorial Optimization: Algorithms and Complexity 1998, Dover, New York.
4. Feynman R.P. Simulating physics with computers. Internat. J. Theoret. Phys. 1982, 21:467.
5. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 1985, 400(1818):97.
6. Nielsen M.A., Chuang I.L. Quantum Computation and Quantum Information 2000, Cambridge University Press, Cambridge.
7. Mermin N.D. Quantum Computer Science 2007, Cambridge University Press, Cambridge.
8. Lectures on Quantum Information 2007, Wiley-VCH, Weinheim. D. Bruß, G. Leuchs (Eds.).
9. Deutsch D., Jozsa R. Rapid solutions of problems by quantum computation. Proc. R. Soc. Lond. A 1992, 439:553.
10. D.R. Simon, On the power of quantum computation, in: Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium, 1994, p. 116.
11. P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in: Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium, 1994, p. 124.
12. Grover L. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 1997, 79(2):325.
13. Bernstein E., Vazirani U. Quantum complexity theory. SIAM J. Comput. 1997, 26:1411.
14. Watrous J. Succinct quantum proofs for properties of finite groups. Proc. 41st Annual Symposium on Foundations of Computer Science 2000, IEEE Computer Society, Washington.
15. Kitaev A.Y., Shen A.H., Vyalyi M.N. Classical and Quantum Computation 2002, AMS, Providence.
16. Apolloni B., Carvalho C., de Falco D. Quantum stochastic optimization. Stochastics Process Appl. 1989, 33:233.
17. Finnila A., Gomez M., Sebenik C., Stenson C., Doll J. Quantum annealing: a new method for minimizing multidimensional functions. Chem. Phys. Lett. 1994, 219:343.
18. Kadowaki T., Nishimori H. Quantum annealing in the transverse Ising model. Phys. Rev. E 1998, 58(5):5355.
19. Brooke J., Bitko D., Rosenbaum T.F., Aeppli G. Quantum annealing of a disordered magnet. Science 1999, 284(5415):779-781.
20. Farhi E., Goldstone J., Gutmann S., Lapan J., Lundgren A., Preda D. A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 2001, 292(5516):472-475.
21. Santoro G.E., Tosatti E. Optimization using quantum mechanics: quantum annealing through adiabatic evolution. J. Phys. A: Math. Gen. 2006, 39(36):R393.
22. Quantum Annealing and Related Optimization Methods 2005, Springer-Verlag, Berlin. A. Das, B.K. Chakrabarti (Eds.).
23. Das A., Chakrabarti B.K. Colloquium: quantum annealing and analog quantum computation. Rev. Modern Phys. 2008, 80:1061-1081.
24. Morita S., Nishimori H. Mathematical foundation of quantum annealing. J. Math. Phys. 2008, 49:125210.
25. Messiah A. Quantum Mechanics, vol. 2 1962, North-Holland, Amsterdam.
26. W. van Dam, M. Mosca, U. Vazirani, How powerful is adiabatic quantum computation? in: Proc. 42nd FOCS, 2001, p. 279.
27. W. van Dam, U. Vazirani, Limits on quantum adiabatic optimization (unpublished).
28. Farhi E., Goldstone J., Gutmann S., Nagaj D. How to make the quantum adiabatic algorithm fail. Int. J. Quantum Comput. 2008, 6:503.
29. Znidaric M., Horvat M. Exponential complexity of an adiabatic algorithm for an NP-complete problem. Phys. Rev. A 2006, 73:022329.
30. Janson S., Luczak T., Rucinski A. Random Graphs 2000, John Wiley and Sons, New York.
31. Mitchell D.G., Selman B., Levesque H.J. Hard and easy distributions for SAT problems. Proc. 10th AAAI 1992, 459-465. AAAI Press, Menlo Park, California.
32. Mézard M., Parisi G., Virasoro M. Spin Glass Theory and Beyond 1987, World Scientific, Singapore.
33. Sachdev S. Quantum Phase Transitions 2001, Cambridge University Press.
34. Goldschmidt Y.Y. Solvable model of the quantum spin glass in a transverse field. Phys. Rev. B 1990, 41(7):4858-4861.
35. Nieuwenhuizen T., Ritort F. Quantum phase transition in spin glasses with multi-spin interactions. Physica A 1998, 250(1):8-45.
36. Biroli G., Cugliandolo L.F. Quantum Thouless-Anderson-Palmer equations for glassy systems. Phys. Rev. B 2001, 64(1):014206.
37. Cugliandolo L.F., Grempel D.R., da Silva Santos C.A. Imaginary-time replica formalism study of a quantum spherical p-spin-glass model. Phys. Rev. B 2001, 64(1):014403.
38. Jörg T., Krzakala F., Kurchan J., Maggs A.C. Simple glass models and their quantum annealing. Phys. Rev. Lett. 2008, 101(14):147204.
39. Amin M.H.S., Choi V. First-order quantum phase transition in adiabatic quantum computation. Phys. Rev. A 2009, 80(6):062326.
40. Altshuler B., Krovi H., Roland J. Anderson localization makes adiabatic quantum optimization fail. Proc. Natl. Acad. Sci. 2010, 107(28):12446.
41. Farhi E., Goldstone J., Gosset D., Gutmann S., Meyer H.B., Shor P.W. Quantum adiabatic algorithms, small gaps, and different paths. Quantum Inf. Comput. 2011, 11(3&4):181-214.
42. Choi V. Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3-SAT problems. Quantum Inf. Comput. 2011, 11:638.
43. Dickson N.G., Amin M.H. Algorithmic approach to adiabatic quantum optimization. Phys. Rev. A 2012, 85:032303.
44. Vazirani V. Approximation Algorithms 2001, Springer Verlag.
45. Dziarmaga J. Dynamics of a quantum phase transition and relaxation to a steady state. Adv. Phys. 2010, 59(6):1063.
46. Hastad J. Some optimal inapproximability results. J. ACM 2001, 48:798.
47. Foini L., Semerjian G., Zamponi F. Solvable model of quantum random optimization problems. Phys. Rev. Lett. 2010, 105(16):167204.
48. Jörg T., Krzakala F., Semerjian G., Zamponi F. First-order transitions and the performance of quantum algorithms in random optimization problems. Phys. Rev. Lett. 2010, 104(20):207206.
49. V. Bapst, G. Semerjian, F. Zamponi, The effect of quantum fluctuations on the coloring of random graphs (in preparation).
50. V.N. Smelyanskiy, E.G. Rieffel, S.I. Knysh, C.P. Williams, M.W. Johnson, M.C. Thom, W.G. Macready, K.L. Pudenz, A near-term quantum computing approach for hard computational problems in space exploration, 2012. arxiv:1204.2821.
51. S. Tanaka, R. Tamura, Quantum annealing: from viewpoints of statistical physics, condensed matter physics, and computational physics, 2012. arxiv:1204.2907.
52. M. Ohzeki, Spin glass: A bridge between quantum computation and statistical mechanics, 2012. arxiv:1204.2865.
53. Richardson T., Urbanke R. Modern Coding Theory 2008, Cambridge University Press, Cambridge.
54. DiVincenzo D.P. The physical implementation of quantum computation. Fortschr. Phys. 2000, 48(9-11):771-783.
55. C.R. Laumann, R. Moessner, A. Scardicchio, S.L. Sondhi, Statistical mechanics of classical and quantum computational complexity, 2010. arxiv:1009.1635.
56. DiVincenzo D.P. Two-bit gates are universal for quantum computation. Phys. Rev. A 1995, 51:1015-1022.
57. Deutsch D., Barenco A., Ekert A. Universality in quantum computation. Proc. Math. Phys. Sci. 1995, 449(1937):669.
58. Lloyd S. Almost any quantum logic gate is universal. Phys. Rev. Lett. 1995, 75:346-349.
59. Barenco A., Bennett C.H., Cleve R., DiVincenzo D.P., Margolus N., Shor P., Sleator T., Smolin J.A., Weinfurter H. Elementary gates for quantum computation. Phys. Rev. A 1995, 52:3457-3467.
60. Cleve R., Ekert A., Macchiavello C., Mosca M. Quantum algorithms revisited. Proc. R. Soc. Lond. A 1998, 454(1969):339-354.
61. Rivest R.L., Shamir A., Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 1978, 21(2):120-126.
62. Vandersypen L., Steffen M., Breyta G., Yannoni C.S., Sherwood M.H., Chuang I.L. Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance. Nature 2001, 414:883.
63. Lu C.-Y., Browne D.E., Yang T., Pan J.-W. Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits. Phys. Rev. Lett. 2007, 99:250504.
64. Lanyon B.P., Weinhold T.J., Langford N.K., Barbieri M., James D.F.V., Gilchrist A., White A.G. Experimental demonstration of a compiled version of Shor's algorithm with quantum entanglement. Phys. Rev. Lett. 2007, 99:250505.
65. E. Lucero, R. Barends, Y. Chen, J. Kelly, M. Mariantoni, A. Megrant, P. O'Malley, D. Sank, A. Vainsencher, J. Wenner, T. White, Y. Yin, A.N. Cleland, J.M. Martinis, Computing prime factors with a Josephson phase qubit quantum processor, 2012. arxiv:1202.5707.
66. Agrawal M., Kayal N., Saxena N. PRIMES is in P. Ann. of Math. (2) 2004, 160(2):781.
67. Bennett C.H., Bernstein E., Brassard G., Vazirani U. Strengths and weaknesses of quantum computing. SIAM J. Comput. 1997, 26(5):1510-1523.
68. Dewes A., Lauro R., Ong F.R., Schmitt V., Milman P., Bertet P., Vion D., Esteve D. Quantum speeding-up of computation demonstrated in a superconducting two-qubit processor. Phys. Rev. B 2012, 85:140503.
69. Harrow A.W., Hassidim A., Lloyd S. Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 2009, 103:150502.
70. Ambainis A. Variable time amplitude amplification and quantum algorithms for linear algebra problems. Proceedings of STACS'12 2012, 636. C. Dürr, T. Wilke (Eds.).
71. Kempe J., Regev O. 3-local hamiltonian is QMA-complete. Quantum Inf. Comput. 2003, 3:258.
72. Kempe J., Kitaev A., Regev O. The complexity of the local hamiltonian problem. SIAM J. Comput. 2006, 35(5):1070-1097.
73. Aharonov D., Gottesman D., Irani S., Kempe J. The power of quantum systems on a line. Comm. Math. Phys. 2009, 287:41-65.
74. S. Bravyi, Efficient algorithm for a quantum analogue of 2-SAT, 2006. arxiv:quant-ph/0602108.
75. S. Bravyi, C. Moore, A. Russell, Bounds on the quantum satisfiability threshold, 2009. arxiv:0907.1297.
76. A. Ambainis, J. Kempe, O. Sattath, A quantum Lovasz local lemma, in: Proc. 42nd STOC, 2010, p. 151.
77. Laumann C., Moessner R., Scardicchio A., Sondhi S. Phase transitions and random quantum satisfiability. Quantum. Inf. Comput. 2010, 10:1.
78. Laumann C.R., Läuchli A.M., Moessner R., Scardicchio A., Sondhi S.L. Product, generic, and random generic quantum satisfiability. Phys. Rev. A 2010, 81:062345.
79. Nayak C., Simon S.H., Stern A., Freedman M., Das Sarma S. Non-abelian anyons and topological quantum computation. Rev. Modern Phys. 2008, 80:1083-1159.
80. Raussendorf R., Briegel H.J. A one-way quantum computer. Phys. Rev. Lett. 2001, 86:5188-5191.
81. Farhi E., Gutmann S. Quantum computation and decision trees. Phys. Rev. A 1998, 58:915-928.
82. Kempe J. Quantum random walks: an introductory overview. Contemp. Phys. 2003, 44(4):307-327.
83. Ambainis A. Quantum walks and their algorithmic applications. Int. J. Quantum Inf. 2003, 1:507.
84. Childs A.M. Universal computation by quantum walk. Phys. Rev. Lett. 2009, 102:180501.
85. Reitzner D., Nagaj D., Buzek V. Quantum walks. Acta Phys. Slovaca 2011, 61:603.
86. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science 1983, 220:671-680.
87. Steffen M., van Dam W., Hogg T., Breyta G., Chuang I. Experimental implementation of an adiabatic quantum optimization algorithm. Phys. Rev. Lett. 2003, 90:067903.
88. Z. Bian, F. Chudak, W.G. Macready, L. Clark, F. Gaitan, Experimental determination of Ramsey numbers with quantum annealing, 2012. arxiv:1201.1842.
89. Born M., Fock V. Beweis des Adiabatensatzes. Zeit. Phys. A 1928, 51:165-180.
90. Kato T. On the adiabatic theorem of quantum mechanics. J. Phys. Soc. Japan 1950, 5(6):435-439.
91. Cheung D., Hoyer P., Wiebe N. Improved error bounds for the adiabatic approximation. J. Phys. A 2011, 44:415302.
92. A. Elgart, G. Hagedorn, A note on the switching adiabatic theorem, 2012. arxiv:1204.2318.
93. E. Farhi, J. Goldstone, S. Gutmann, M. Sipser, Quantum computation by adiabatic evolution, 2000. arxiv:quant-ph/0001106.
94. Rigolin G., Ortiz G. Adiabatic theorem for quantum systems with spectral degeneracy. Phys. Rev. A 2012, 85:062111.
95. Wilczek F., Zee A. Appearance of gauge structure in simple dynamical systems. Phys. Rev. Lett. 1984, 52:2111-2114.
96. Valiant L.G., Vazirani V.V. NP is as easy as detecting unique solutions. Theoret. Comput. Sci. 1986, 47:85.
97. Landau L.D. Zur Theorie der Energieubertragung. II. Phys. Soviet Union 1932, 2(2):46-51.
98. Zener C. Non-adiabatic crossing of energy levels. Proc. R. Soc. Lond. 1932, 137(833):696-702.
99. Vitanov N.V., Garraway B.M. Landau-Zener model: effects of finite coupling duration. Phys. Rev. A 1996, 53(6):4288-4304.
100. Vitanov N.V. Transition times in the Landau-Zener model. Phys. Rev. A 1999, 59:988-994.
101. Volkov M.V., Ostrovsky V.N. Analytical results for state-to-state transition probabilities in the multistate Landau-Zener model by nonstationary perturbation theory. Phys. Rev. A 2007, 75(2):022105.
102. Santoro G., Martoňák R., Tosatti E., Car R. Theory of quantum annealing of an Ising spin glass. Science 2002, 295(5564):2427.
103. Bapst V., Semerjian G. On quantum mean-field models and their quantum annealing. J. Stat. Mech. 2012, 2012(06):P06007.
104. Aharonov D., van Dam W., Kempe J., Landau Z., Lloyd S., Regev O. Adiabatic quantum computation is equivalent to standard quantum computation. SIAM J. Comput. 2007, 37(1):166.
105. Rezakhani A.T., Abasto D.F., Lidar D.A., Zanardi P. Intrinsic geometry of quantum adiabatic evolution and quantum phase transitions. Phys. Rev. A 2010, 82:012321.
106. Roland J., Cerf N.J. Quantum search by local adiabatic evolution. Phys. Rev. A 2002, 65(4):042308.
107. Caneva T., Murphy M., Calarco T., Fazio R., Montangero S., Giovannetti V., Santoro G. Optimal control at the quantum speed limit. Phys. Rev. Lett. 2009, 103(24):240501.
108. Caneva T., Calarco T., Fazio R., Santoro G.E., Montangero S. Speeding up critical system dynamics through optimized evolution. Phys. Rev. A 2011, 84:012312.
109. J. Nehrkorn, S. Montangero, A. Ekert, A. Smerzi, R. Fazio, T. Calarco, Staying adiabatic with unknown energy gap, 2011. arxiv:1105.1707.
110. Seki Y., Nishimori H. Quantum annealing with antiferromagnetic fluctuations. Phys. Rev. E 2012, 85:051112.
111. Seoane B., Nishimori H. Many-body transverse interactions in the quantum annealing of the p-spin ferromagnet. J. Phys. A 2012, 45:435301.
112. Ribeiro P., Mosseri R. Adiabatic computation: a toy model. Phys. Rev. A 2006, 74:042333.
113. Arora S., Lund C., Motwani R., Sudan M., Szegedy M. Proof verification and the hardness of approximation problems. J. ACM 1998, 45:501-555.
114. D. Aharonov, I. Arad, Z. Landau, U. Vazirani, The detectibility lemma and quantum gap amplification, in: Proc. 41st Annual ACM Symposium on Theory of Computing, vol. 287, 2009, pp. 417-426.
115. M. Hastings, Trivial low energy states for commuting hamiltonians, and the quantum PCP conjecture, 2012. arxiv:1201.3387.
116. S. Gharibian, J. Kempe, Approximation algorithms for QMA-complete problems, in: Proc. 26th CCC'11, 2011, p. 178.
117. S. Gharibian, J. Kempe, Hardness of approximation for quantum problems, 2012. arxiv:1209.1055.
118. Cheeseman P., Kanefsky B., Taylor W.M. Where the really hard problems are. Proc. 12th IJCAI 1991, 331-337. Morgan Kaufmann, San Mateo, CA, USA.
119. Friedgut E. Sharp thresholds of graph properties, and the k-sat problem. J. Amer. Math. Soc. 1999, 12:1017.
120. Franco J. Results related to threshold phenomena research in satisfiability: lower bounds. Theoret. Comput. Sci. 2001, 265:147.
121. Achlioptas D. Lower bounds for random 3-SAT via differential equations. Theoret. Comput. Sci. 2001, 265(1-2):159-185.
122. Dubois O. Upper bounds on the satisfiability threshold. Theoret. Comput. Sci. 2001, 265:187.
123. k log 2-O(k). J. Amer. Math. Soc. 2004, 17:947.
124. Monasson R., Zecchina R. Statistical mechanics of the random k-satisfiability model. Phys. Rev. E 1997, 56(2):1357-1370.
125. Mézard M., Zecchina R. Random k-satisfiability problem: from an analytic solution to an efficient algorithm. Phys. Rev. E 2002, 66(5):056126.
126. Mézard M., Parisi G., Zecchina R. Analytic and algorithmic solution of random satisfiability problems. Science 2002, 297:812-815.
127. Mertens S., Mézard M., Zecchina R. Threshold values of random k-SAT from the cavity method. Random Structures Algorithms 2006, 28(3):340-373.
128. Krzakala F., Pagnani A., Weigt M. Threshold values, stability analysis, and high-q asymptotics for the coloring problem on random graphs. Phys. Rev. E 2004, 70(4):046705.
129. Biroli G., Monasson R., Weigt M. A variational description of the ground state structure in random satisfiability problems. Eur. Phys. J. B 2000, 14:551.
130. Krzakala F., Montanari A., Ricci-Tersenghi F., Semerjian G., Zdeborová L. Gibbs states and the set of solutions of random constraint satisfaction problems. Proc. Natl. Acad. Sci. 2007, 104(25):10318-10323.
131. Franz S., Leone M. Replica bounds for optimization problems and diluted spin systems. J. Stat. Phys. 2003, 111(3-4):535-564.
132. Panchenko D., Talagrand M. Bounds for diluted mean-fields spin glass models. Probab. Theory Related Fields 2004, 130(3):319-336.
133. Daudé H., Mora T., Mézard M., Zecchina R. Pairs of sat assignments and clustering in random boolean formulae. Theoret. Comput. Sci. 2008, 393:260-279.
134. D. Achlioptas, F. Ricci-Tersenghi, On the solution-space geometry of random constraint satisfaction problems, in: Proc. of the 38th Annual ACM Symposium on Theory of Computing.
135. A. Coja-Oghlan, On belief propagation guided decimation for random k-sat, in: Proc. 22nd SODA, 2011, p. 957.
136. Monasson R. Introduction to phase transitions in random optimization problems. Complex Systems 2007, Elsevier, Les Houches, France. J.P. Bouchaud, M. Mézard, J. Dalibard (Eds.).
137. Mézard M., Montanari A. Information, Physics and Computation 2009, Oxford University Press.
138. Moore C., Mertens S. The Nature of Computation 2011, Oxford University Press, Oxford.
139. Anderson P.W. Absence of diffusion in certain random lattices. Phys. Rev. 1958, 109(5):1492.
140. Derrida B. Random-energy model: an exactly solvable model of disordered systems. Phys. Rev. B 1981, 24(5):2613-2626.
141. Edwards S.F., Anderson P.W. Theory of spin-glasses. J. Phys. F 1975, 5:965-974.
142. Sherrington D., Kirkpatrick S. Solvable model of a spin-glass. Phys. Rev. Lett. 1975, 35(26):1792-1796.
143. Parisi G. A sequence of approximated solutions to the S-K model for spin glasses. J. of Phys. A 1980, 13(4):L115.
144. Fischer K., Hertz J. Spin Glasses 1991, Cambridge University Press.
145. Talagrand M. The Parisi formula. Ann. of Math. 2006, 163:221.
146. Guerra F., Toninelli F.L. The thermodynamic limit in mean field spin glass models. Comm. Math. Phys. 2002, 230:71-79.
147. Gross D., Mézard M. The simplest spin glass. Nuclear Phys. B 1984, 240:431.
148. Viana L., Bray A. Phase diagrams for dilute spin glasses. J. Phys. C 1985, 18(15):3037-3051.
149. Mézard M., Parisi G. Replicas and optimization. J. Phys. 1985, 46:L771-L778.
150. Fu Y., Anderson P.W. Application of statistical mechanics to NP-complete problems in combinatorial optimization. J. Phys. A 1986, 19:1605-1620.
151. Monasson R. Optimization problems and replica symmetry breaking in finite connectivity spin glasses. J. Phys. A 1998, 31(2):513-529.
152. Mézard M., Parisi G. The Bethe lattice spin glass revisited. Eur. Phys. J. B 2001, 20:217.
153. Mézard M., Parisi G. The cavity method at zero temperature. J. Stat. Phys. 2003, 111(1-2):1-34.
154. Talagrand M. Spin Glasses: A Challenge for Mathematicians: Cavity and Mean Field Models 2003, Springer.
155. Castellani T., Cavagna A. Spin-glass theory for pedestrians. J. Stat. Mech. 2005, 2005(05):P05012.
156. Kirkpatrick T.R., Wolynes P.G. Stable and metastable states in mean-field Potts and structural glasses. Phys. Rev. B 1987, 36:8552.
157. Kirkpatrick T.R., Thirumalai D. Mean-field soft-spin Potts glass model: statics and dynamics. Phys. Rev. B 1988, 37:5342.
158. Kirkpatrick T.R., Wolynes P.G. Connections between some kinetic and equilibrium theories of the glass transition. Phys. Rev. A 1987, 35(7):3072-3080.
159. Kirkpatrick T.R., Thirumalai D., Wolynes P.G. Scaling concepts for the dynamics of viscous liquids near an ideal glassy state. Phys. Rev. A 1989, 40(2):1045-1054.
160. Lubchenko V., Wolynes P.G. Theory of structural glasses and supercooled liquids. Ann. Rev. Phys. Chem. 2007, 58(1):235-266.
161. Cavagna A. Supercooled liquids for pedestrians. Phys. Rep. 2009, 476(46):51-124.
162. Biroli G., Bouchaud J.P. The Random First-Order Transition Theory of Glasses: A Critical Assessment. Structural Glasses and Supercooled Liquids: Theory, Experiment and Applications 2012, Wiley & Sons. P. Wolynes, V. Lubchenko (Eds.).
163. Berthier L., Biroli G. Theoretical perspective on the glass transition and amorphous materials. Rev. Modern Phys. 2011, 83:587-645.
164. Götze W. Complex Dynamics of Glass-Forming Liquids: A Mode-Coupling Theory, Vol. 143 2009, Oxford University Press, USA.
165. Kauzmann W. The nature of the glassy state and the behavior of liquids at low temperatures. Chem. Rev. 1948, 43:219.
166. Gardner E. Spin glasses with p-spin interactions. Nuclear Phys. B 1985, 257:747-765.
167. Mézard M., Ricci-Tersenghi F., Zecchina R. Two solutions to diluted p-spin models and XORSAT problems. J. Stat. Phys. 2003, 111(3-4):505-533.
168. Cocco S., Dubois O., Mandler J., Monasson R. Rigorous decimation-based construction of ground pure states for spin-glass models on random lattices. Phys. Rev. Lett. 2003, 90(4):047205.
169. Montanari A., Semerjian G. On the dynamics of the glass transition on Bethe lattices. J. Stat. Phys. 2006, 124:103.
170. Ibrahimi M., Kanoria Y., Kraning M., Montanari A. The set of solutions of random XORSAT formulae. Proc. of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms 2012, 760-779. SIAM.
171. D. Achlioptas, M. Molloy, The solution space geometry of random linear equations, 2011. arxiv:1107.5550.
172. Mora T., Zdeborová L. Random subcubes as a toy model for constraint satisfaction problems. J. Stat. Phys. 2008, 131:1121-1138.
173. Zdeborová L., Krzakala F. Phase transitions in the coloring of random graphs. Phys. Rev. E 2007, 76(3):031131.
174. Semerjian G. On the freezing of variables in random constraint satisfaction problems. J. Stat.Phys. 2008, 130:251.
175. Achlioptas D., Coja-Oghlan A. Algorithmic barriers from phase transitions. Foundations of Computer Science, 2008. FOCS'08. IEEE 49th Annual IEEE Symposium on 2008, 793-802. IEEE.
176. Alava M., Ardelius J., Aurell E., Kaski P., Krishnamurthy S., Orponen P., Seitz S. Circumspect descent prevails in solving random constraint satisfaction problems. Proc. Natl. Acad. Sci. 2008, 105:15253.
177. Krzakala F., Kurchan J. Landscape analysis of constraint satisfaction problems. Phys. Rev. E 2007, 76:021122.
178. Krzakala F., Zdeborová L. Potts glass on random graphs. Europhys. Lett. 2008, 81:57005.
179. Montanari A., Semerjian G. Rigorous inequalities between length and time scales in glassy systems. J. Stat. Phys. 2006, 125(1):23-54.
180. Gross D.J., Kanter I., Sompolinsky H. Mean-field theory of the Potts glass. Phys. Rev. Lett. 1985, 55:304.
181. Geman S., Geman D. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 1984, 6:721.
182. Monthus C., Bouchaud J.-P. Models of traps and glass phenomenology. J. Phys. A 1996, 29(14):3847.
183. Arous G., Bovier A., Cerny J. Universality of the REM for dynamics of mean-field spin glasses. Comm. Math. Phys. 2008, 282:663-695.
184. Bray A.J., Moore M.A. Chaotic nature of the spin-glass phase. Phys. Rev. Lett. 1987, 58(1):57-60.
185. Fisher D.S., Huse D.A. Equilibrium behavior of the spin-glass ordered phase. Phys. Rev. B 1988, 38(1):386-411.
186. Krzakala F., Martin O. Chaotic temperature dependence in a model of spin glasses. Eur. Phys. J. B 2002, 28:199-208.
187. Krzakala F., Zdeborová L. Following Gibbs states adiabatically the energy landscape of mean-field glassy systems. Europhys. Lett. 2010, 90(6):66002.
188. Zdeborová L., Krzakala F. Generalization of the cavity method for adiabatic evolution of Gibbs states. Phys. Rev. B 2010, 81(22):224205.
189. van Mourik J., Saad D. Random graph coloring: statistical physics approach. Phys. Rev. E 2002, 66:056120.
190. Ardelius J., Aurell E. Behavior of heuristics on large and hard satisfiability problems. Phys. Rev. E 2006, 74(3):037702.
191. Zdeborová L., Mézard M. Locked constraint satisfaction problems. Phys. Rev. Lett. 2008, 101(7):078702.
192. Zdeborová L. Statistical physics of hard optimization problems. Acta Phys. Slovaca 2009, 59:169-303.
193. Braunstein A., Leone M., Ricci-Tersenghi F., Zecchina R. Complexity transitions in global algorithms for sparse linear systems over finite fields. J. Phys. A 2002, 35(35):7559.
194. Haanpää H., Järvisalo M., Kaski P., Niemelä I. Hard satisfiable clause sets for benchmarking equivalence reasoning techniques. J. Sat. Boolean Model. Comput. 2006, 2:27-46.
195. Ricci-Tersenghi F. Being glassy without being hard to solve. Science 2010, 330(6011):1639-1640.
196. Zdeborová L., Krzakala F. Quiet planting in the locked constraint satisfaction problems. SIAM J. Discrete Math. 2011, 25:750-770.
197. Young A.P., Knysh S., Smelyanskiy V.N. First-order phase transition in the quantum adiabatic algorithm. Phys. Rev. Lett. 2010, 104(2):020502.
198. Foini L., Semerjian G., Zamponi F. Quantum Biroli-Mézard model: glass transition and superfluidity in a quantum lattice glass model. Phys. Rev. B 2011, 83:094513.
199. Botet R., Jullien R. Large-size critical behavior of infinitely coordinated systems. Phys. Rev. B 1983, 28:3955-3967.
200. Dusuel S., Vidal J. Finite-size scaling exponents of the Lipkin-Meshkov-Glick model. Phys. Rev. Lett. 2004, 93:237204.
201. Dusuel S., Vidal J. Continuous unitary transformations and finite-size scaling exponents in the Lipkin-Meshkov-Glick model. Phys. Rev. B 2005, 71:224420.
202. Das A., Sengupta K., Sen D., Chakrabarti B.K. Infinite-range Ising ferromagnet in a time-dependent transverse magnetic field: quench and ac dynamics near the quantum critical point. Phys. Rev. B 2006, 74:144423.
203. Fisher D.S. Critical behavior of random transverse-field Ising spin chains. Phys. Rev. B 1995, 51:6411.
204. Fisher D.S., Young A.P. Distributions of gaps and end-to-end correlations in random transverse-field Ising spin chains. Phys. Rev. B 1998, 58:9131-9141.
205. Young A.P., Rieger H. Numerical study of the random transverse-field Ising spin chain. Phys. Rev. B 1996, 53:8486-8498.
206. Caneva T., Fazio R., Santoro G.E. Adiabatic quantum dynamics of a random Ising chain across its quantum critical point. Phys. Rev. B 2007, 76:144427.
207. Bray A.J., Moore M.A. Replica theory of quantum spin glasses. J. Phys. C 1980, 13(24):L655.
208. A. Andreanov, M. Müller, Collective excitations and marginal stability of quantum Ising spin glasses, 2012. arxiv:1204.4156.
209. Jörg T., Krzakala F., Kurchan J., Maggs A.C., Pujos J. Energy gaps in quantum first-order mean-field-like transitions: the problems that quantum annealing cannot solve. EPL 2010, 89(4):40004.
210. Filippone M., Dusuel S., Vidal J. Quantum phase transitions in fully connected spin models: an entanglement perspective. Phys. Rev. A 2011, 83:022327.
211. C. Laumann, R. Moessner, A. Scardicchio, S. Sondhi, The quantum adiabatic algorithm and scaling of gaps at first order quantum phase transition, 2012. arxiv:1202.3646.
212. Dobrosavljevic V., Thirumalai D. 1/p expansion for a p-spin interaction spin-glass model in a transverse field. J. Phys. A 1990, 23:L767.
213. Jörg T., Krzakala F., Kurchan J., Maggs A.C. Quantum annealing of hard problems. Progr. Theoret. Phys. Suppl. 2010, 184:290-303.
214. Buccheri F., De Luca A., Scardicchio A. Structure of typical states of a disordered Richardson model and many-body localization. Phys. Rev. B 2011, 84:094203.
215. Dickson N.G. Elimination of perturbative crossings in adiabatic quantum optimization. New J. Phys. 2011, 13(7):073011.
216. S. Knysh, V. Smelyanskiy, On the relevance of avoided crossings away from quantum critical point to the complexity of quantum adiabatic algorithm, 2010. arxiv:1005.3011.
217. V. Choi, Adiabatic quantum algorithms for the NP-complete maximum-weight independent set, exact cover and 3-SAT problems, 2010. arxiv:1004.2226.
218. V. Choi, Avoid first order quantum phase transition by changing problem hamiltonians, 2010. arxiv:1010.1220.
219. Dickson N.G., Amin M.H.S. Does adiabatic quantum optimization fail for np-complete problems?. Phys. Rev. Lett. 2011, 106:050502.
220. Thompson R.C. The behavior of eigenvalues and singular values under perturbations of restricted rank. Linear Algebra Appl. 1976, 13(1-2):69-78.
221. Montanari A., Ricci-Tersenghi F., Semerjian G. Clusters of solutions and replica symmetry breaking in random k-satisfiability. J. Stat. Mech. 2008, 2008(04):P04004. p. 41.
222. Dembo A., Montanari A. Ising models on locally tree-like graphs. Ann. Appl. Probab. 2010, 20:565-592.
223. Laumann C., Scardicchio A., Sondhi S.L. Cavity method for quantum spin glasses on the Bethe lattice. Phys. Rev. B 2008, 78(13):134424.
224. Krzakala F., Rosso A., Semerjian G., Zamponi F. Path-integral representation for quantum spin models: application to the quantum cavity method and monte carlo simulations. Phys. Rev. B 2008, 78(13):134428.
225. Leifer M.S., Poulin D. Quantum graphical models and belief propagation. Ann. Physics 2008, 323(8):1899.
226. Poulin D., Bilgin E. Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs. Phys. Rev. A 2008, 77(5):052318.
227. Bilgin E., Poulin D. Coarse-grained belief propagation for simulation of interacting quantum systems at all temperatures. Phys. Rev. B 2010, 81(5):054106.
228. Poulin D., Hastings M. Markov entropy decomposition: a variational dual for quantum belief propagation. Phys. Rev. Lett. 2011, 106(8):80403.
229. Ioffe L.B., Mézard M. Disorder-driven quantum phase transitions in superconductors and magnets. Phys. Rev. Lett. 2010, 105(3):037001.
230. Dimitrova O., Mézard M. The cavity method for quantum disordered systems: from transverse random field ferromagnets to directed polymers in random media. J. Stat. Mech. 2011, 2011:P01020.
231. Ramezanpour A. Cavity approach to variational quantum mechanics. Phys. Rev. B 2012, 85:125131.
232. Semerjian G., Tarzia M., Zamponi F. Exact solution of the Bose-Hubbard model on the Bethe lattice. Phys. Rev. B 2009, 80(1):014524.
233. Kschischang F., Frey B., Loeliger H. Factor graphs and the sum-product algorithm. IEEE Trans. Inform. Theory 2001, 47(2):498.
234. Molloy M., Reed B. A critical point for random graphs with a given degree sequence. Random Structures Algorithms 1995, 6:161.
235. Monasson R. Structural glass transition and the entropy of the metastable states. Phys. Rev. Lett. 1995, 75:2847-2850.
236. Cugliandolo L., Kurchan J. Analytical solution of the off-equilibrium dynamics of a long-range spin-glass model. Phys. Rev. Lett. 1993, 71(1):173.
237. Abou-Chacra R., Thouless D., Anderson P. A selfconsistent theory of localization. J. Phys. C 1973, 6:1734.
238. Arulampalam M., Maskell S., Gordon N., Clapp T. A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking. IEEE Trans. Signal Process. 2002, 50(2):174.
239. Andrea Montanari G.P., Ricci-Tersenghi F. Instability of one-step replica-symmetry-broken phase in satisfiability problems. J. Phys. A 2004, 37:2073.
240. Ginibre J. Reduced density matrices of the anisotropic Heisenberg model. Comm. Math. Phys. 1968, 10:140-154.
241. Gallavotti G., Miracle-Sole S., Robinson D. Analyticity properties of the anisotropic Heisenberg model. Comm. Math. Phys 1968, 10:311-324.
242. Farhi E., Gutmann S. The functional integral constructed directly from the Hamiltonian. Ann. Physics 1992, 213:182-203.
243. Aizenman M., Nachtergaele B. Geometric aspects of quantum spin states. Comm. Math. Phys. 1994, 164:17.
244. Chayes L., Crawford N., Ioffe D., Levit A. The phase diagram of the quantum Curie-Weiss model. J. Stat. Phys. 2008, 133:131-149.
245. Ioffe D. Stochastic geometry of classical and quantum Ising models. Lecture Notes in Mathematics 2009, vol. 1970:87. Springer, Berlin, Heidelberg.
246. Martinelli F., Wouts M. Glauber dynamics for the quantum Ising model in a transverse field on a regular tree. J. Stat. Phys. 2012, 146:1059-1088.
247. Hastings M. Quantum belief propagation: an algorithm for thermal quantum systems. Phys. Rev. B 2007, 76(20):201102.
248. Feigel'man M.V., Ioffe L.B., Mézard M. Superconductor-insulator transition and energy localization. Phys. Rev. B 2010, 82(18):184534.
249. M. Mueller, Giant positive magnetoresistance and localization in bosonic insulators, arxiv:1109.0245.
250. Georges A., Kotliar G., Krauth W., Rozenberg M.J. Dynamical mean-field theory of strongly correlated fermion systems and the limit of infinite dimensions. Rev. Modern Phys. 1996, 68:13-125.
251. A. Globerson, T. Jaakkola, Approximate inference using conditional entropy decompositions, in: Proc. of the 11th International Conference on Artificial Intelligence and Statistics, 2007.
252. Jastrow R. Many-body problem with strong forces. Phys. Rev. 1955, 98:1479.
253. Ramezanpour A., Zecchina R. The sign problem in the Bethe approximation. Phys. Rev. B 2012, 86:155147.
254. White S. Density matrix formulation for quantum renormalization groups. Phys. Rev. Lett. 1992, 69(19):2863.
255. Vidal G. Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 2003, 91(14):147902.
256. Nagaj D., Farhi E., Goldstone J., Shor P., Sylvester I. Quantum transverse-field Ising model on an infinite tree from matrix product states. Phys. Rev. B 2008, 77(21):214431.
257. Shi Y.-Y., Duan L.-M., Vidal G. Classical simulation of quantum many-body systems with a tree tensor network. Phys. Rev. A 2006, 74:022320.
258. Nagy Á Simulating quantum systems on the Bethe lattice by translationally invariant infinite-tree tensor network. Ann. Physics 2012, 327:542.
259. W. Li, J. von Delft, T. Xiang, Efficient simulation of infinite tree tensor network states on the Bethe lattice, 2012. arxiv:1209.2387.
260. Vidal G. Classical simulation of infinite-size quantum lattice systems in one spatial dimension. Phys. Rev. Lett. 2007, 98(7):70201.
261. Lepetit M.-B., Cousy M., Pastor G. Density-matrix renormalization study of the Hubbard model on a Bethe lattice. Eur. Phys. J. B 2000, 13:421-427.
262. http://www.caam.rice.edu/software/ARPACK/.
263. Hatano N., Suzuki M. Finding exponential product formulas of higher orders. Optimization 2005, (3):22.
264. Huyghebaert J., Raedt H.D. Product formula methods for time-dependent schrodinger problems. J. Phys. A 1990, 23(24):5777.
265. Poulin D., Quarry A., Somma R., Verstraete F. Quantum simulation of time-dependent hamiltonians and the convenient illusion of hilbert space. Phys. Rev. Lett. 2011, 106(17):170501.
266. Cazalilla M., Marston J. Time-dependent density-matrix renormalization group: a systematic method for the study of quantum many-body out-of-equilibrium systems. Phys. Rev. Lett. 2002, 88(25):256403.
267. White S., Feiguin A. Real-time evolution using the density matrix renormalization group. Phys. Rev. Lett. 2004, 93(7):76401.
268. Daley A., Kollath C., Schollwöck U., Vidal G. Time-dependent density-matrix renormalization-group using adaptive effective hilbert spaces. J. Stat. Mech. 2004, 2004:P04005.
269. Ceperley D.M. Path integrals in the theory of condensed helium. Rev. Mod. Phys. 1995, 67:279.
270. Krauth W., Trivedi N., Ceperley D. Superfluid-insulator transition in disordered boson systems. Phys. Rev. Lett. 1991, 67(17):2307.
271. Rieger H., Young A.P. Zero-temperature quantum phase transition of a two-dimensional Ising spin glass. Phys. Rev. Lett. 1994, 72:4141-4144.
272. Batrouni G., Scalettar R. World line simulations of the bosonic Hubbard model in the ground state. Comput. Phys. Comm. 1996, 97(1):63-81.
273. Beard B.B., Wiese U.-J. Simulations of discrete quantum systems in continuous euclidean time. Phys. Rev. Lett. 1996, 77:5130-5133.
274. Prokof'ev N.V., Svistunov B.V., Tupitsyn I.S. "Worm" algorithm in quantum Monte Carlo simulations. Phys. Lett. A 1998, 238(4-5):253-257.
275. Rieger H., Kawashima N. Application of a continuous time cluster algorithm to the two-dimensional random quantum Ising ferromagnet. Eur. Phys. J. B 1999, 9(2):233-236.
276. Farhi E., Goldstone J., Gosset D., Meyer H. A quantum Monte Carlo method at fixed energy. Comput. Phys. Comm. 2011, 182:1663-1673.
277. Sandvik A.W. Stochastic series expansion method with operator-loop update. Phys. Rev. B 1999, 59:R14157.
278. Hen I., Young A.P. Exponential complexity of the quantum adiabatic algorithm for certain satisfiability problems. Phys. Rev. E 2011, 84:061152.
279. Young A.P., Knysh S., Smelyanskiy V.N. Size dependence of the minimum excitation gap in the quantum adiabatic algorithm. Phys. Rev. Lett. 2008, 101:170503.
280. Hen I. Excitation gap from optimized correlation functions in quantum Monte Carlo simulations. Phys. Rev. E 2012, 85:036705.
281. Markland T.E., Morrone J.A., Berne B.J., Miyazaki K., Rabani E., Reichman D.R. The quantum liquid-glass transition. Nat. Phys. 2010, 7:134-137.
282. Guidetti M., Young A.P. Complexity of several constraint-satisfaction problems using the heuristic classical algorithm walksat. Phys. Rev. E 2011, 84:011102.
283. E. Farhi, D. Gosset, I. Hen, A. Sandvik, P. Shor, A. Young, F. Zamponi, The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs, 2012. arxiv:1208.3757.
284. Franz S., Leone M., Ricci-Tersenghi F., Zecchina R. Exact solutions for diluted spin glasses and optimization problems. Phys. Rev. Lett. 2001, 87(12):127209.
285. Franz S., Mézard M., Ricci-Tersenghi F., Weigt M., Zecchina R. A ferromagnet with a glass transition. Europhys. Lett. 2001, 55(4):465.
286. http://code.google.com/p/relsat.
287. http://www.laria.u-picardie.fr/~cli/maxsatz2009.c.
288. D. Gosset, Ph.D. Thesis, Case Studies in Quantum Adiabatic Optimization, 2011.
289. B. Olmos, I. Lesanovsky, J. Garrahan, Facilitated spin models of dissipative quantum glasses, 2012. arxiv:1203.6585.
290. Carleo G., Tarzia M., Zamponi F. Bose-Einstein condensation in quantum glasses. Phys. Rev. Lett. 2009, 103(21):215302.
291. Childs A.M., Farhi E., Preskill J. Robustness of adiabatic quantum computation. Phys. Rev. A 2001, 65:012322.
292. Roland J., Cerf N.J. Noise resistance of adiabatic quantum computation using random matrix theory. Phys. Rev. A 2005, 71:032330.
293. Sarandy M.S., Lidar D.A. Adiabatic quantum computation in open systems. Phys. Rev. Lett. 2005, 95:250503.