Random quantum satisfiabiilty

Quantum Information and Computation

Volumn 10, Issue 1-2, 2010, Pages 1-15

  Laumann, C R ^a   Moessner, R ^b   Scardicchio, A ^a   Sondhi, S L ^a  

^a PRINCETON UNIVERSITY   (United States)

^b MAX PLANCK INSTITUT FÜR PHYSIK KOMPLEXER SYSTEME   (Germany)

Author keywords

Average case complexity; Disordered quantum satisfiability; QSAT; SAT

Indexed keywords

FORMAL LOGIC; GRAPH THEORY; PHASE TRANSITIONS; QUANTUM COMPUTERS;

AVERAGE-CASE COMPLEXITY; CLAUSE DENSITY; DECISION PROBLEMS; GRAPH-THEORETIC PROBLEM; QSAT; QUANTUM PHASE TRANSITIONS; SATISFIABILITY; SATISFIABILITY PROBLEMS;

QUANTUM THEORY;

EID: 75749106638     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. S. Bravyi (2006), Efficient algorithm for a quantum analogue of 2-SAT, quant-ph/0602108.
2. A. Y. Kitaev (1999), Quantum NP, AQIP'99.
3. A. Y. Kitaev, A. Shen, and M. N. Vyalyi (2002), Classical and quantum computation, Graduate studies in mathematics, Vol. 47, American Mathematical Society (Providence, R.I.).
4. M. R. Garey and D. S. Johnson (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in the Mathematical Sciences, W. H. Freeman & Co Ltd.
5. S. Kirkpatrick and B. Selman (1994), Critical behavior in the satisfiability of random Boolean expressions, Science, 264 (5163), pp. 1297-1301.
6. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky (1999), Determining computational complexity from characteristic 'phase transitions', Nature, 400 (6740), pp. 133-137.
7. M. Mézard and R. Zecchina (2002), Random k-satisfiability problem: From an analytic solution to an efficient algorithm, Phys. Rev. E, 66 (5).
8. M. Mézard, G. Parisi, and R. Zecchina (2002), Analytic and algorithmic solution of random satisfiability problems, Science, 297.
9. F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, and L. Zdeborová (2007), Gibbs states and the set of solutions of random constraint satisfaction problems, PNAS, 104 (25), pp. 10318-10323.
10. F. Altarelli, R. Monasson, G. Semerjian, and F. Zamponi (2009), A review of the statistical mechanics approach to random optimization problems, Handbook of Satisfiability, Vol. 185, IOS Press.
11. M. Mézard, F. Ricci-Tersenghi, and R. Zecchina (2003), Two solutions to diluted p-spin models and XORSAT problems, J. Stat. Phys., 111 (3), pp. 505-533.
12. M. Molloy (2005), Cores in random hypergraphs and boolean formulas, Random Struct. Algorithms, 27 (1), pp. 124-135.
13. V. Chvatal and B. Reed (1992), Mick gets some (the odds are on his side) [satisfiability], FOCS, pp. 620-627.
14. R. Monasson and R. Zecchina (1997), Statistical mechanics of the random K-satisfiability model, Phys. Rev. E, 56 (2), pp. 1357-1370.
15. S. L. Sondhi, S. M. Girvin, J. P. Carini, and D. Shahar (1997), Continuous quantum phase transitions, Rev. Mod. Phys., 69 (1), pp. 315-333.
16. S. Sachdev (2001), Quantum phase transitions, Cambridge University Press (Cambridge, UK).
17. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda (2001), A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem, Science, 292 (5516), pp. 472-475.
18. C. Laumann, A. Scardicchio, and S. L. Sondhi (2008), Cavity method for quantum spin glasses on the bethe lattice, Phys. Rev. B, 78 (13), p. 134424.
19. M. B. Hastings (2007), Quantum belief propagation: An algorithm for thermal quantum systems, Phys. Rev. B, 76 (20).
20. M. Leifer and D. Poulin (2008), Quantum graphical models and belief propagation, Ann. Phys., 323, pp. 1899-1946.
21. F. Krzakala, A. Rosso, G. Semerjian, and F. Zamponi (2008), Path-integral representation for quantum spin models: Application to the quantum cavity method and Monte Carlo simulations, Phys. Rev. B, 78 (13), p. 134428.