The quantum adiabatic algorithm applied to random optimization problems: The quantum spin glass perspective
Among various algorithms designed to exploit the specific properties of quantum computers
with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to …
with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to …
[書籍][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
Analytic and algorithmic solution of random satisfiability problems
We study the satisfiability of random Boolean expressions built from many clauses with K
variables per clause (K-satisfiability). Expressions with a ratio α of clauses to variables less …
variables per clause (K-satisfiability). Expressions with a ratio α of clauses to variables less …
Random -satisfiability problem: From an analytic solution to an efficient algorithm
We study the problem of satisfiability of randomly chosen clauses, each with K Boolean
variables. Using the cavity method at zero temperature, we find the phase diagram for the K …
variables. Using the cavity method at zero temperature, we find the phase diagram for the K …
The cavity method at zero temperature
In this note we explain the use of the cavity method directly at zero temperature, in the case
of the spin glass on a lattice with a local tree like structure, which is the proper generalization …
of the spin glass on a lattice with a local tree like structure, which is the proper generalization …
Two Solutions to Diluted p-Spin Models and XORSAT Problems
We derive analytical solutions for p-spin models with finite connectivity at zero temperature.
These models are the statistical mechanics equivalent of p-XORSAT problems in theoretical …
These models are the statistical mechanics equivalent of p-XORSAT problems in theoretical …
Replica bounds for optimization problems and diluted spin systems
S Franz, M Leone - Journal of Statistical Physics, 2003 - Springer
In this paper we generalize to the case of diluted spin models and random combinatorial
optimization problems a technique recently introduced by Guerra (cond-mat/0205123) to …
optimization problems a technique recently introduced by Guerra (cond-mat/0205123) to …
Typical random 3-SAT formulae and the satisfiability threshold
O Dubois, Y Boufkhad, J Mandler - arxiv preprint cs/0211036, 2002 - arxiv.org
We present a new structural (or syntatic) approach for estimating the satisfiability threshold
of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous …
of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous …
Dynamics of glassy systems
LF Cugliandolo - arxiv preprint cond-mat/0210312, 2002 - Springer
These lecture notes can be read in two ways. The first two sections contain a review of the
phenomenology of several physical systems with slow nonequilibrium dynamics. In the …
phenomenology of several physical systems with slow nonequilibrium dynamics. In the …
The 3-XORSAT threshold
O Dubois, J Mandler - Comptes Rendus Mathematique, 2002 - Elsevier
We prove the existence of a threshold phenomenon regarding the random 3-XORSAT
problem (or more generally k-XORSAT). We provide the value of the threshold as the …
problem (or more generally k-XORSAT). We provide the value of the threshold as the …