暂无分享,去创建一个
Guilhem Semerjian | Florent Krzakala | Victor Bapst | Francesco Zamponi | Laura Foini | V. Bapst | F. Krzakala | F. Zamponi | G. Semerjian | L. Foini | Florent Krzakala
[1] D. Ioffe. Stochastic Geometry of Classical and Quantum Ising Models , 2009 .
[2] A. Ekert,et al. Staying adiabatic with unknown energy gap , 2011, 1105.1707.
[3] Christopher R. Laumann,et al. On product, generic and random generic quantum satisfiability , 2009, ArXiv.
[4] D. Saad,et al. Random graph coloring: statistical physics approach. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[5] S. Dusuel,et al. Continuous unitary transformations and finite-size scaling exponents in the Lipkin-Meshkov-Glick model , 2004, cond-mat/0412127.
[6] Julia Kempe,et al. Quantum random walks: An introductory overview , 2003, quant-ph/0303081.
[7] Riccardo Zecchina,et al. Exact solutions for diluted spin glasses and optimization problems , 2001, Physical review letters.
[8] J. Doll,et al. Quantum annealing: A new method for minimizing multidimensional functions , 1994, chem-ph/9404003.
[9] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[10] G. M. Pastor,et al. Density-matrix renormalization study of the Hubbard model [4]on a Bethe lattice , 2000 .
[11] M A Cazalilla,et al. Time-dependent density-matrix renormalization group: a systematic method for the study of quantum many-body out-of-equilibrium systems. , 2002, Physical review letters.
[12] R. Monasson,et al. Statistical Mechanics of the K--Satisfiability Model , 1996, cond-mat/9606215.
[13] Monasson. Structural glass transition and the entropy of the metastable states. , 1995, Physical Review Letters.
[14] N. Cerf,et al. Noise resistance of adiabatic quantum computation using random matrix theory , 2004, quant-ph/0409127.
[15] Florent Krzakala,et al. A Landscape Analysis of Constraint Satisfaction Problems , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[16] Daniel S. Fisher,et al. DISTRIBUTIONS OF GAPS AND END-TO-END CORRELATIONS IN RANDOM TRANSVERSE-FIELD ISING SPIN CHAINS , 1998 .
[17] Manindra Agrawal,et al. PRIMES is in P , 2004 .
[18] Jian-Wei Pan,et al. Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits. , 2007, Physical review letters.
[19] N. Hatano,et al. Finding Exponential Product Formulas of Higher Orders , 2005, math-ph/0506007.
[20] W. Götze. Complex Dynamics of Glass-Forming Liquids: A Mode-Coupling Theory , 2008 .
[21] Bangalore,et al. Infinite-range Ising ferromagnet in a time-dependent transverse magnetic field: Quench and ac dynamics near the quantum critical point , 2006 .
[22] H. S. Allen. The Quantum Theory , 1928, Nature.
[23] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[24] M. Mézard,et al. A ferromagnet with a glass transition , 2001, cond-mat/0103026.
[25] R. Monasson. Optimization problems and replica symmetry breaking in finite connectivity spin glasses , 1997, cond-mat/9707089.
[26] Florent Krzakala,et al. Quiet Planting in the Locked Constraint Satisfaction Problems , 2009, SIAM J. Discret. Math..
[27] Vicky Choi,et al. Different adiabatic quantum optimization algorithms for the NP-complete exact cover problem , 2010, Proceedings of the National Academy of Sciences.
[28] Dimitris Achlioptas,et al. THE THRESHOLD FOR RANDOM k-SAT IS 2k log 2 O(k) , 2004, FOCS 2004.
[29] Moore,et al. Chaotic nature of the spin-glass phase. , 1987, Physical review letters.
[30] Norman Margolus,et al. Physics and Computation , 1987 .
[31] Michele Leone,et al. Replica Bounds for Optimization Problems and Diluted Spin Systems , 2002 .
[32] Seth Lloyd,et al. Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation , 2007, SIAM J. Comput..
[33] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..
[35] I. Chuang,et al. Quantum Computation and Quantum Information: Bibliography , 2010 .
[36] Andris Ambainis,et al. QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS , 2003, quant-ph/0403120.
[37] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[38] N. Mermin. Quantum Computer Science , 2007 .
[39] A. Dembo,et al. Ising models on locally tree-like graphs , 2008, 0804.4726.
[40] Kanter,et al. Mean-field theory of the Potts glass. , 1985, Physical review letters.
[41] Theo M. Nieuwenhuizen,et al. Quantum phase transition in spin glasses with multi-spin interactions , 1998 .
[42] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[43] D. Lidar,et al. Adiabatic quantum computation in open systems. , 2005, Physical review letters.
[44] Florent Krzakala,et al. Phase Transitions in the Coloring of Random Graphs , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[45] Gustavo Rigolin,et al. Adiabatic theorem for quantum systems with spectral degeneracy , 2012 .
[46] B. Lanyon,et al. Experimental demonstration of a compiled version of Shor's algorithm with quantum entanglement. , 2007, Physical review letters.
[47] M. Mézard,et al. Random K-satisfiability problem: from an analytic solution to an efficient algorithm. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[48] F. Krzakala,et al. Quantum Annealing of Hard Problems , 2009, 0910.5644.
[49] Masayuki Ohzeki,et al. Spin Glass a Bridge Between Quantum Computation and Statistical Mechanics , 2012, 1204.2865.
[50] E. Aurell,et al. Behavior of heuristics on large and hard satisfiability problems. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[51] E. Farhi,et al. The functional integral constructed directly from the hamiltonian , 1992 .
[52] R Raussendorf,et al. A one-way quantum computer. , 2001, Physical review letters.
[53] A. Ramezanpour. Cavity approach to variational quantum mechanics , 2012 .
[54] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[55] Florent Krzakala. How many colors to color a random graph? Cavity, complexity, stability and all that , 2004 .
[56] Frank Wilczek,et al. Appearance of Gauge Structure in Simple Dynamical Systems , 1984 .
[57] T. R. Kirkpatrick,et al. Connections between some kinetic and equilibrium theories of the glass transition. , 1987, Physical review. A, General physics.
[58] H. Nishimori,et al. Quantum annealing with antiferromagnetic fluctuations. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.
[59] Federico Ricci-Tersenghi,et al. Being Glassy Without Being Hard to Solve , 2010, Science.
[60] Neil J. Gordon,et al. A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking , 2002, IEEE Trans. Signal Process..
[61] F. Martinelli,et al. Glauber Dynamics for the Quantum Ising Model in a Transverse Field on a Regular Tree , 2011, 1105.5970.
[62] P. Høyer,et al. Improved error bounds for the adiabatic approximation , 2011, 1103.4174.
[63] M. Hastings. Quantum belief propagation: An algorithm for thermal quantum systems , 2007, 0706.4094.
[64] Julien Vidal,et al. Finite-size scaling exponents of the Lipkin-Meshkov-Glick model. , 2004, Physical review letters.
[65] Christopher R. Laumann,et al. Phase transitions and random quantum satisfiability , 2009, ArXiv.
[66] M. Sipser,et al. Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.
[67] Rosario Fazio,et al. Adiabatic quantum dynamics of a random Ising chain across its quantum critical point , 2007, 0706.1832.
[68] Heiko Rieger,et al. Application of a continuous time cluster algorithm to the two-dimensional random quantum Ising ferromagnet , 1999 .
[69] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[70] E. Farhi,et al. A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.
[71] Rosenbaum,et al. Quantum annealing of a disordered magnet , 1999, Science.
[72] R. Feynman. Simulating physics with computers , 1999 .
[73] G. Vidal,et al. Classical simulation of quantum many-body systems with a tree tensor network , 2005, quant-ph/0511070.
[74] R. Moessner,et al. Quantum adiabatic algorithm and scaling of gaps at first-order quantum phase transitions. , 2012, Physical review letters.
[75] Vicky Choi,et al. Avoid First Order Quantum Phase Transition by Changing Problem Hamiltonians , 2010, 1010.1220.
[76] F. Krzakala,et al. Following Gibbs states adiabatically: the energy landscape of mean field glassy systems , 2009, 0909.3820.
[77] S Montangero,et al. Optimal control at the quantum speed limit. , 2009, Physical review letters.
[78] Guilhem Semerjian,et al. First-order transitions and the performance of quantum algorithms in random optimization problems , 2009, Physical review letters.
[79] P. Anderson. Absence of Diffusion in Certain Random Lattices , 1958 .
[80] Pekka Orponen,et al. Circumspect descent prevails in solving random constraint satisfaction problems , 2007, Proceedings of the National Academy of Sciences.
[81] Amin Coja-Oghlan,et al. Algorithmic Barriers from Phase Transitions , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[82] Julia Kempe,et al. 3-local Hamiltonian is QMA-complete , 2003, Quantum Inf. Comput..
[83] Andrew M. Childs,et al. Robustness of adiabatic quantum computation , 2001, quant-ph/0108048.
[84] Petteri Kaski,et al. Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques , 2006, J. Satisf. Boolean Model. Comput..
[85] D. Gosset. Case studies in quantum adiabatic optimization , 2011 .
[86] Jacek Dziarmaga,et al. Dynamics of a quantum phase transition and relaxation to a steady state , 2009, 0912.4034.
[87] D. Deutsch,et al. Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[88] E. Tosatti,et al. Optimization using quantum mechanics: quantum annealing through adiabatic evolution , 2006 .
[89] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[90] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[91] M. Mézard,et al. Spin Glass Theory and Beyond , 1987 .
[92] A. Ekert,et al. Universality in quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[93] Itay Hen,et al. Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[94] Young,et al. Numerical study of the random transverse-field Ising spin chain. , 1996, Physical review. B, Condensed matter.
[95] F. Guerra. Spin Glasses , 2005, cond-mat/0507581.
[96] F. Krzakala,et al. Potts glass on random graphs , 2007, 0710.3336.
[97] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[98] Fisher,et al. Equilibrium behavior of the spin-glass ordered phase. , 1988, Physical review. B, Condensed matter.
[99] D. Bruß,et al. Lectures on Quantum Information , 2007 .
[100] G. Parisi. A sequence of approximated solutions to the S-K model for spin glasses , 1980 .
[101] Christopher R. Laumann,et al. Statistical mechanics of classical and quantum computational complexity , 2010, ArXiv.
[102] N. Mermin. Quantum Computer Science: An Introduction , 2007 .
[103] Andrea Montanari,et al. Clusters of solutions and replica symmetry breaking in random k-satisfiability , 2008, ArXiv.
[104] T. Hogg,et al. Experimental implementation of an adiabatic quantum optimization algorithm. , 2003, Physical review letters.
[105] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[106] A. Cavagna,et al. Spin-glass theory for pedestrians , 2005, cond-mat/0505032.
[107] A. Bray,et al. Replica theory of quantum spin glasses , 1980 .
[108] Shu Tanaka,et al. Quantum Annealing:. from Viewpoints of Statistical Physics, Condensed Matter Physics, and Computational Physics , 2012 .
[109] M. Mézard,et al. Pairs of SAT Assignments and Clustering in Random Boolean Formulae , 2005 .
[110] F. Krzakala,et al. Path-integral representation for quantum spin models: Application to the quantum cavity method and Monte Carlo simulations , 2008, 0807.2553.
[111] David M. Ceperley,et al. Superfluid-insulator transition in disordered boson systems , 1991 .
[112] M. Mézard,et al. Two Solutions to Diluted p-Spin Models and XORSAT Problems , 2003 .
[113] Markus Mueller. Giant positive magnetoresistance and localization in bosonic insulators , 2011 .
[114] J. Bouchaud,et al. Models of traps and glass phenomenology , 1996, cond-mat/9601012.
[115] M. Mézard,et al. The cavity method for quantum disordered systems: from transverse random field ferromagnets to directed polymers in random media , 2010, 1009.3725.
[116] Robert Botet,et al. Large-size critical behavior of infinitely coordinated systems , 1983 .
[117] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[118] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[119] G. Vidal,et al. Time-dependent density-matrix renormalization-group using adaptive effective Hilbert spaces , 2004 .
[120] Andrea Montanari,et al. Instability of one-step replica-symmetry-broken phase in satisfiability problems , 2003, ArXiv.
[121] A. Bray,et al. Phase diagrams for dilute spin glasses , 1985 .
[122] Matthew B. Hastings,et al. Trivial low energy states for commuting Hamiltonians, and the quantum PCP conjecture , 2012, Quantum Inf. Comput..
[123] Fisher,et al. Critical behavior of random transverse-field Ising spin chains. , 1995, Physical review. B, Condensed matter.
[124] J I Cirac,et al. Classical simulation of infinite-size quantum lattice systems in two spatial dimensions. , 2008, Physical review letters.
[125] Umesh V. Vazirani,et al. How powerful is adiabatic quantum computation? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[126] Guilhem Semerjian,et al. The effect of quantum fluctuations on the coloring of random graphs , 2013, ArXiv.
[127] T. R. Kirkpatrick,et al. Scaling concepts for the dynamics of viscous liquids near an ideal glassy state. , 1989, Physical review. A, General physics.
[128] L. Chayes,et al. The Phase Diagram of the Quantum Curie-Weiss Model , 2008, 0804.1605.
[129] M. Mézard,et al. Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.
[130] Andris Ambainis,et al. Variable time amplitude amplification and quantum algorithms for linear algebra problems , 2012, STACS.
[131] G. Biroli,et al. Quantum Thouless-Anderson-Palmer equations for glassy systems , 2001 .
[132] D. DiVincenzo,et al. The Physical Implementation of Quantum Computation , 2000, quant-ph/0002077.
[133] P. Ribeiro,et al. Adiabatic Computation - A Toy Model , 2006 .
[134] S. Sondhi,et al. Cavity method for quantum spin glasses on the Bethe lattice , 2007, 0706.4391.
[135] A. Sandvik. Stochastic series expansion method with operator-loop update , 1999, cond-mat/9902226.
[136] Amin Coja-Oghlan,et al. On belief propagation guided decimation for random k-SAT , 2010, SODA '11.
[137] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[138] Vicky Choi,et al. Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems , 2010, ArXiv.
[139] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[140] Lenka Zdeborová,et al. Statistical Physics of Hard Optimization Problems , 2008, ArXiv.
[141] Thirumalai,et al. Mean-field soft-spin Potts glass model: Statics and dynamics. , 1988, Physical review. B, Condensed matter.
[142] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[143] P. Anderson,et al. A selfconsistent theory of localization , 1973 .
[144] E. Gardner. Spin glasses with p-spin interactions , 1985 .
[145] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.
[146] F. Zamponi,et al. Quantum Biroli-Mézard model: Glass transition and superfluidity in a quantum lattice glass model , 2010, 1011.6320.
[147] Thierry Mora,et al. Pairs of SAT-assignments in random Boolean formulæ , 2005, Theor. Comput. Sci..
[148] I. Chuang,et al. Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance , 2001, Nature.
[149] Vadim N. Smelyanskiy,et al. On the relevance of avoided crossings away from quantum critical point to the complexity of quantum adiabatic algorithm , 2010, ArXiv.
[150] R. Zecchina,et al. Sign problem in the Bethe approximation , 2012, 1208.0188.
[151] T. R. Kirkpatrick,et al. Stable and metastable states in mean-field Potts and structural glasses. , 1987, Physical review. B, Condensed matter.
[152] W. Krauth,et al. Dynamical mean-field theory of strongly correlated fermion systems and the limit of infinite dimensions , 1996 .
[153] A. Montanari,et al. Rigorous Inequalities Between Length and Time Scales in Glassy Systems , 2006, cond-mat/0603018.
[154] Adam Nagy,et al. Simulating quantum systems on the Bethe lattice by translationally invariant infinite-tree tensor network , 2011, 1106.3033.
[155] Andrea Cavagna,et al. Supercooled liquids for pedestrians , 2009, 0903.4264.
[156] Daniel R. Simon,et al. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[157] R. Monasson,et al. Rigorous decimation-based construction of ground pure states for spin-glass models on random lattices. , 2002, Physical review letters.
[158] Umesh V. Vazirani,et al. Quantum Complexity Theory , 1997, SIAM J. Comput..
[159] P. Shor,et al. Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs , 2012, 1208.3757.
[160] Edward Farhi,et al. Quantum adiabatic algorithms, small gaps, and different paths , 2009, Quantum Inf. Comput..
[161] F. Krzakala,et al. Simple glass models and their quantum annealing. , 2008, Physical Review Letters.
[162] T. Jorg,et al. Energy gaps in quantum first-order mean-field–like transitions: The problems that quantum annealing cannot solve , 2009, 0912.4865.
[163] M. Talagrand. The parisi formula , 2006 .
[164] Lenka Zdeborová,et al. Random Subcubes as a Toy Model for Constraint Satisfaction Problems , 2007, ArXiv.
[165] D. Ceperley. Path integrals in the theory of condensed helium , 1995 .
[166] Lloyd,et al. Almost any quantum logic gate is universal. , 1995, Physical review letters.
[167] M. Aizenman,et al. Geometric aspects of quantum spin states , 1993, cond-mat/9310009.
[168] David R. Reichman,et al. Quantum fluctuations can promote or inhibit glass formation , 2010, 1011.0015.
[169] B. Apolloni,et al. Quantum stochastic optimization , 1989 .
[170] E. Farhi,et al. Quantum computation and decision trees , 1997, quant-ph/9706062.
[171] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[172] A. Montanari,et al. On the Dynamics of the Glass Transition on Bethe Lattices , 2005, cond-mat/0509366.
[173] Yashodhan Kanoria,et al. The set of solutions of random XORSAT formulae , 2011, SODA.
[174] G. Biroli,et al. Theoretical perspective on the glass transition and amorphous materials , 2010, 1011.2578.
[175] Sergey Bravyi,et al. Efficient algorithm for a quantum analogue of 2-SAT , 2006, quant-ph/0602108.
[176] M. Müller,et al. Long-range quantum Ising spin glasses at t=0: gapless collective excitations and universality. , 2012, Physical review letters.
[177] Alexei Andreanov,et al. Collective excitations and marginal stability of quantum Ising spin glasses , 2012 .
[178] Edward Farhi,et al. Quantum transverse-field Ising model on an infinite tree from matrix product states , 2007, 0712.1806.
[179] S. Kirkpatrick,et al. Solvable Model of a Spin-Glass , 1975 .
[180] John Watrous,et al. Succinct quantum proofs for properties of finite groups , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[181] Olivier Dubois,et al. Upper bounds on the satisfiability threshold , 2001, Theor. Comput. Sci..
[182] Wei Li,et al. Efficient simulation of infinite tree tensor network states on the Bethe lattice , 2012, 1209.2387.
[183] G. B. Arous,et al. Universality of the REM for Dynamics of Mean-Field Spin Glasses , 2007, 0706.2135.
[184] Sandy Irani,et al. The Power of Quantum Systems on a Line , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[185] de Hans Raedt,et al. PRODUCT FORMULA METHODS FOR TIME-DEPENDENT SCHRODINGER PROBLEMS , 1990 .
[186] R. Zecchina,et al. Complexity transitions in global algorithms for sparse linear systems over finite fields , 2002, cond-mat/0203613.
[187] Cugliandolo,et al. Analytical solution of the off-equilibrium dynamics of a long-range spin-glass model. , 1993, Physical review letters.
[188] M. Amin,et al. Does adiabatic quantum optimization fail for NP-complete problems? , 2010, Physical review letters.
[189] Edward Farhi,et al. A Quantum Monte Carlo method at fixed energy , 2009, Comput. Phys. Commun..
[190] M. Mézard,et al. Disorder-driven quantum phase transitions in superconductors and magnets. , 2010, Physical review letters.
[191] S. White,et al. Real-time evolution using the density matrix renormalization group. , 2004, Physical review letters.
[192] M. Talagrand,et al. Bounds for diluted mean-fields spin glass models , 2004, math/0405357.
[193] F. Guerra,et al. The Thermodynamic Limit in Mean Field Spin Glass Models , 2002, cond-mat/0204280.
[194] Barenco,et al. Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[195] A. Young,et al. Size dependence of the minimum excitation gap in the quantum adiabatic algorithm. , 2008, Physical review letters.
[196] Florent Krzakala,et al. Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[197] G. M. Pastor,et al. Density-matrix renormalization study of the Hubbard model on a Bethe lattice , 1998 .
[198] Goldschmidt. Solvable model of the quantum spin glass in a transverse field. , 1990, Physical review. B, Condensed matter.
[199] R. Cleve,et al. Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[200] A. Young,et al. First-order phase transition in the quantum adiabatic algorithm. , 2009, Physical review letters.
[201] Julia Kempe,et al. The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.
[202] Vicky Choi. Different Adiabatic Quantum Optimization Algorithms for the NP-Complete Exact Cover and 3SAT Problems , 2010, ArXiv.
[203] N. Cerf,et al. Quantum search by local adiabatic evolution , 2001, quant-ph/0107015.
[204] S. Montangero,et al. Speeding up critical system dynamics through optimized evolution , 2010, 1011.6634.
[205] M. Hastings,et al. Markov entropy decomposition: a variational dual for quantum belief propagation. , 2010, Physical review letters.
[206] M. V. Volkov,et al. Analytical results for state-to-state transition probabilities in the multistate Landau-Zener model by nonstationary perturbation theory , 2007 .
[207] Aharonov,et al. Quantum Walks , 2012, 1207.7283.
[208] D. Poulin,et al. Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs , 2007, 0710.4304.
[209] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[210] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[211] B. Derrida. Random-energy model: An exactly solvable model of disordered systems , 1981 .
[212] M. Mézard,et al. The simplest spin glass , 1984 .
[213] J. Ginibre. Reduced density matrices of the anisotropic Heisenberg model , 1968 .
[214] Shafi Goldwasser,et al. Proceedings : 35th Annual Symposium on Foundations of Computer Science, November 20-22, 1994, Santa Fe, New Mexico , 1994 .
[215] R. Monasson. Introduction to Phase Transitions in Random Optimization Problems , 2007, 0704.2536.
[216] M. Mézard,et al. Replicas and optimization , 1985 .
[217] I. Hen. Excitation gap from optimized correlation functions in quantum Monte Carlo simulations. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[218] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[219] H. Nishimori,et al. Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.
[220] D. Deutsch. Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[221] Umesh V. Vazirani,et al. The detectability lemma and quantum gap amplification , 2008, STOC '09.
[222] F. Krzakala,et al. Generalization of the cavity method for adiabatic evolution of Gibbs states , 2010, 1003.2748.
[223] Rémi Monasson,et al. THE EUROPEAN PHYSICAL JOURNAL B c○ EDP Sciences , 1999 .
[224] Fabián A. Chudak,et al. Experimental determination of Ramsey numbers with quantum annealing , 2012 .
[225] Peter G Wolynes,et al. Theory of structural glasses and supercooled liquids. , 2007, Annual review of physical chemistry.
[226] Boris Svistunov,et al. “Worm” algorithm in quantum Monte Carlo simulations☆ , 1998 .
[227] R. Car,et al. Theory of Quantum Annealing of an Ising Spin Glass , 2002, Science.
[228] Federico Ricci-Tersenghi,et al. On the solution-space geometry of random constraint satisfaction problems , 2006, STOC '06.
[229] Roderich Moessner,et al. Random quantum satisfiabiilty , 2010 .
[230] M. Amin,et al. Algorithmic approach to adiabatic quantum optimization , 2011, 1108.3303.
[231] D. W. Robinson,et al. Analyticity Properties of the Anisotropic Heisenberg Model , 1968 .
[232] Andrea Montanari,et al. Gibbs states and the set of solutions of random constraint satisfaction problems , 2006, Proceedings of the National Academy of Sciences.
[233] Martin Horvat,et al. Exponential complexity of an adiabatic algorithm for an NP-complete problem , 2006 .
[234] Andrew M. Childs,et al. Universal computation by quantum walk. , 2008, Physical review letters.
[235] Vitanov,et al. Landau-Zener model: Effects of finite coupling duration. , 1996, Physical review. A, Atomic, molecular, and optical physics.
[236] Mikhail N. Vyalyi,et al. Classical and Quantum Computation , 2002, Graduate studies in mathematics.
[237] S. Simon,et al. Non-Abelian Anyons and Topological Quantum Computation , 2007, 0707.1889.
[238] Sevag Gharibian,et al. Approximation Algorithms for QMA-Complete Problems , 2011, Computational Complexity Conference.
[239] M. Mézard,et al. Threshold values of random K-SAT from the cavity method , 2006 .
[240] George A. Hagedorn,et al. A note on the switching adiabatic theorem , 2012, 1204.2318.
[241] R. Jastrow. Many-Body Problem with Strong Forces , 1955 .
[242] Fusca. Product , 1972, The Veterinary record.
[243] Colin P. Williams,et al. A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration , 2012, 1204.2821.
[244] G. Biroli,et al. The Random First-Order Transition Theory of Glasses: a critical assessment , 2009, 0912.2542.
[245] Julia Kempe,et al. Hardness of approximation for quantum problems , 2012, Quantum Inf. Comput..
[246] Jérémie Roland,et al. Anderson localization makes adiabatic quantum optimization fail , 2009, Proceedings of the National Academy of Sciences.
[247] DiVincenzo. Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.
[248] Andrea De Luca,et al. Structure of typical states of a disordered Richardson model and many-body localization , 2011 .
[249] M. Tarzia,et al. Exact solution of the Bose-Hubbard model on the Bethe lattice , 2009, 0904.3075.
[250] V. Choi,et al. First-order quantum phase transition in adiabatic quantum computation , 2009, 0904.1387.
[251] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[252] Guilhem Semerjian,et al. On the Freezing of Variables in Random Constraint Satisfaction Problems , 2007, ArXiv.
[253] F. Verstraete,et al. Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space. , 2011, Physical review letters.
[254] S. Edwards,et al. Theory of spin glasses , 1975 .
[255] B. Chakrabarti,et al. Quantum Annealing and Related Optimization Methods , 2008 .
[256] D. Poulin,et al. Quantum Graphical Models and Belief Propagation , 2007, 0708.1337.
[257] Edward Farhi,et al. HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL , 2005 .
[258] Julia Kempe,et al. 3-local Hamitonian is QMA-complete , 2003 .
[259] N. V. Vitanov,et al. TRANSITION TIMES IN THE LANDAU-ZENER MODEL , 1998, quant-ph/9811066.
[260] Tommi S. Jaakkola,et al. Approximate inference using conditional entropy decompositions , 2007, AISTATS.
[261] D. Poulin,et al. Coarse-grained belief propagation for simulation of interacting quantum systems at all temperatures , 2009, 0910.2299.
[262] Tosio Kato. On the Adiabatic Theorem of Quantum Mechanics , 1950 .
[263] P. Anderson,et al. Application of statistical mechanics to NP-complete problems in combinatorial optimisation , 1986 .
[264] Stochastic Relaxation , 2014, Computer Vision, A Reference Guide.
[265] G Vidal. Classical simulation of infinite-size quantum lattice systems in one spatial dimension. , 2007, Physical review letters.
[266] Francesco Zamponi,et al. Bose-Einstein condensation in quantum glasses. , 2009, Physical review letters.
[267] D. Thirumalai,et al. 1/p expansion for a p-spin interaction spin-glass model in a transverse field , 1990 .
[268] Marco Guidetti,et al. Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[269] M. Mézard,et al. The Cavity Method at Zero Temperature , 2002, cond-mat/0207121.
[270] N. Dickson. Elimination of perturbative crossings in adiabatic quantum optimization , 2011, 1104.2349.
[271] A. Harrow,et al. Quantum algorithm for linear systems of equations. , 2008, Physical review letters.
[272] W. Kauzmann. The Nature of the Glassy State and the Behavior of Liquids at Low Temperatures. , 1948 .
[273] V. Bapst,et al. On quantum mean-field models and their quantum annealing , 2012, 1203.6003.
[274] R. C. Thompson. The behavior of eigenvalues and singular values under perturbations of restricted rank , 1976 .
[275] Riccardo Zecchina,et al. Threshold values of random K‐SAT from the cavity method , 2003, Random Struct. Algorithms.
[276] V. Fock,et al. Beweis des Adiabatensatzes , 1928 .
[277] R. T. Scalettar,et al. World line simulations of the bosonic Hubbard model in the ground state , 1996 .
[278] Alexander Russell,et al. Bounds on the Quantum Satisfiability Threshold , 2009, ICS.
[279] J. P. Garrahan,et al. Facilitated spin models of dissipative quantum glasses. , 2012, Physical review letters.
[280] G. Vidal. Efficient classical simulation of slightly entangled quantum computations. , 2003, Physical review letters.
[281] M. Talagrand. Spin glasses : a challenge for mathematicians : cavity and mean field models , 2003 .
[282] M. Mézard,et al. Information, Physics, and Computation , 2009 .
[283] Leticia F Cugliandolo,et al. The Quantum Spherical p-Spin-Glass Model , 2001 .
[284] M. Mézard,et al. The Bethe lattice spin glass revisited , 2000, cond-mat/0009418.
[285] L. Ioffe,et al. Superconductor-Insulator transition and energy localization , 2010, 1006.5767.
[286] R. Lathe. Phd by thesis , 1988, Nature.
[287] Lenka Zdeborová,et al. Locked constraint satisfaction problems. , 2008, Physical review letters.
[288] C. Zener. Non-Adiabatic Crossing of Energy Levels , 1932 .
[289] Daniel A. Lidar,et al. Intrinsic geometry of quantum adiabatic evolution and quantum phase transitions , 2010, 1004.0509.
[290] H. Nishimori,et al. Mathematical foundation of quantum annealing , 2008, 0806.1859.
[291] F. Krzakala,et al. Chaotic temperature dependence in a model of spin glasses , 2002 .
[292] Denis Vion,et al. Quantum speeding-up of computation demonstrated in a superconducting two-qubit processor , 2012 .
[293] John V. Franco. Results related to threshold phenomena research in satisfiability: lower bounds , 2001, Theor. Comput. Sci..
[294] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[295] Cristopher Moore,et al. The Nature of Computation , 2011 .
[296] H. Nishimori,et al. Many-body transverse interactions in the quantum annealing of the p-spin ferromagnet , 2012, 1207.2909.
[297] B. B. Beard,et al. Simulations of Discrete Quantum Systems in Continuous Euclidean Time. , 1996 .
[298] S. Sachdev. Quantum Phase Transitions , 1999 .
[299] E. Lucero,et al. Computing prime factors with a Josephson phase qubit quantum processor , 2012, Nature Physics.
[300] Dimitris Achlioptas,et al. Lower bounds for random 3-SAT via differential equations , 2001, Theor. Comput. Sci..
[301] S. Dusuel,et al. Quantum phase transitions in fully connected spin models: An entanglement perspective , 2011, 1101.3654.
[302] White,et al. Density matrix formulation for quantum renormalization groups. , 1992, Physical review letters.
[303] F. Zamponi,et al. Solvable model of quantum random optimization problems. , 2010, Physical review letters.
[304] Young,et al. Zero-temperature quantum phase transition of a two-dimensional Ising spin glass. , 1994, Physical review letters.
[305] Andris Ambainis,et al. A quantum lovász local lemma , 2010, STOC '10.
[306] B. Chakrabarti,et al. Colloquium : Quantum annealing and analog quantum computation , 2008, 0801.2193.