Related papers: Random Multi-Overlap Structures for Optimization p…
We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem $k$-QSAT on large random graphs. As an approximation strategy, we optimize the solution…
This is a short review about recent methods and results, mostly for mean field spin glasses, based on interpolation and comparison schemes. In particular, the Parisi spontaneous replica symmetry breaking phenomenon is described in the frame…
The chapter starts with a historical summary of first attempts to optimize the spin glass Hamiltonian, comparing it to recent results on searching largest cliques in random graphs. Exact algorithms to find ground states in generic spin…
Here we study the NP-complete $K$-SAT problem. Although the worst-case complexity of NP-complete problems is conjectured to be exponential, there exist parametrized random ensembles of problems where solutions can typically be found in…
We propose an ultrametric broken replica symmetry trial function for the diluted mean field sping glass model in the framework of random multi-overlap structure.
We give an asymptotic evaluation of the complexity of spherical p-spin spin-glass models via random matrix theory. This study enables us to obtain detailed information about the bottom of the energy landscape, including the absolute minimum…
We present a continuous nonlinear optimization model for the Spin Glass Problem (SGP), building on a classical result by Rosenberg (1972), which shows that for a class of multilinear polynomial problems the optimal values of the continuous…
In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse…
This study focuses on the problem of finding ground states of random instances of the Sherrington-Kirkpatrick (SK) spin-glass model with Gaussian couplings. While the ground states of SK spin-glass instances can be obtained with branch and…
We investigate different randomizations for mirror descent method. We try to propose such a randomization that allows us to use sparsity of the problem as much as it possible. In the paper one can also find a generalization of randomizaed…
Properties of Random Overlap Structures (ROSt)'s constructed from the Edwards-Anderson (EA) Spin Glass model on $\Z^d$ with periodic boundary conditions are studied. ROSt's are $\N\times\N$ random matrices whose entries are the overlaps of…
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two extremal cases are considered: (1) the +/- J spin glass, and…
In this paper we study the fluctuations of the probability distributions of the overlap in mean field spin glasses in the presence of a magnetic field on the De Almeida-Thouless line. We find that there is a large tail in the left part of…
This work finds its place in the statistical mechanical approach to light amplification in disordered media, namely Random Lasers (RLs). The problem of going beyond the standard mean-field Replica Symmetry Breaking (RSB) theory employed to…
We consider vector spin glass models with self-overlap correction. Since the limit of free energy is an infimum, we use arguments analogous to those for generic models to show the following: 1) the averaged self-overlap converges; 2) the…
We analyze the transformation of QUBO from its conventional Boolean presentation into an equivalent spin glass problem with coupled $\pm1$ spin variables exposed to a site-dependent external field. We find that in a widely used testbed for…
In an effort to overcome the limitations of random spin-glass benchmarks for quantum annealers, focus has shifted to carefully-crafted gadget-based problems whose logical structure has typically a planar topology. Recent experiments on…
We consider the problem of rational decision making in the presence of nonlinear constraints. By using tools borrowed from spin glass and random matrix theory, we focus on the portfolio optimisation problem. We show that the number of…
We are interested in solving convex optimization problems with large numbers of constraints. Randomized algorithms, such as random constraint sampling, have been very successful in giving nearly optimal solutions to such problems. In this…
In these lectures I will present an introduction to the modern way of studying the properties of glassy systems. I will start from soluble models of increasing complications, the Random Energy Model, the $p$-spins interacting model and I…