Related papers: Aspects of Statistical Physics in Computational Co…
We use a simple mode-coupling approach to investigate glassy dynamics of partially pinned fluid systems. Our approach is different from the mode-coupling theory developed by Krakoviack [Phys. Rev. Lett. 94, 065703 (2005), Phys. Rev. E 84,…
We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the…
In the study of disordered models like spin glasses the key object of interest is the rugged energy hypersurface defined in configuration space. The statistical mechanics calculation of the Gibbs-Boltzmann Partition Function gives the…
The central object of this PhD thesis is known under different names in the fields of computer science and statistical mechanics. In computer science, it is called the Maximum Cut problem, one of the famous twenty-one Karp's original…
Focusing on the optimization version of the random K-satisfiability problem, the MAX-K-SAT problem, we study the performance of the finite energy version of the Survey Propagation (SP) algorithm. We show that a simple (linear time)…
Satisfiability is considered the canonical NP-complete problem and is used as a starting point for hardness reductions in theory, while in practice heuristic SAT solving algorithms can solve large-scale industrial SAT instances very…
Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other. The results are in…
Understanding how frustration and disorder shape relaxation in complex systems is a central problem in statistical physics and quantum annealing. Spin-glass models provide a natural framework to explore this connection, as their energy…
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum…
The Sherrington-Kirkpatrick spin-glass model is investigated by means of Monte Carlo simulations employing a combination of the multi-overlap algorithm with parallel tempering methods. We investigate the finite-size scaling behaviour of the…
It is shown that the canonical problem of classical statistical thermodynamics, the computation of the partition function, is in the case of +/-J Ising spin glasses a particular instance of certain simple sums known as quadratically signed…
C-dismantling (CD) problem aims at finding the minimum vertex set D of a graph G(V,E) after removing which the remaining graph will break into connected components with the size not larger than C. In this paper, we introduce a spin-glass…
We show two fascinating topics lying between quantum information processing and statistical mechanics. First, we introduce an elaborated technique, the surface code, to prepare the particular quantum state with robustness against…
Phase transitions in spin glass type systems and, more recently, in related computational problems have gained broad interest in disparate arenas. In the current work, we focus on the "community detection" problem when cast in terms of a…
We present an ansatz for the ground states of the Quantum Sherrington-Kirkpatrick model, a paradigmatic model for quantum spin glasses. Our ansatz, based on the concept of generalized coherent states, very well captures the fundamental…
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our variational scheme accurately reproduces the known replica…
A key point in the spin foam approach to quantum gravity is the implementation of simplicity constraints in the partition functions of the models. Here, we discuss the imposition of these constraints in a phase space setting corresponding…
We review the main methods used to study spin glasses. In the first part, we focus on methods for fully connected models and systems defined on a tree, such as the replica method, the Thouless-Anderson-Palmer formalism, the cavity method,…
The Survey Propagation (SP) algorithm for solving $k$-SAT problems has been shown recently as an instance of the Belief Propagation (BP) algorithm. In this paper, we show that for general constraint-satisfaction problems, SP may not be…
Classical economics has developed an arsenal of methods, based on the idea of representative agents, to come up with precise numbers for next year's GDP, inflation and exchange rates, among (many) other things. Few, however, will disagree…