Related papers: A hierarchical approach for computing spin glass g…
Spatial photonic Ising machines (SPIMs) based on spatial light modulators (SLMs) have emerged as highly effective solvers for many tasks, including combinatorial optimization problems and spin-glass simulations. However, traditional SPIMs…
In practice, optimization tasks have some structure that allows developing new algorithms for every problem with faster convergence rates. Using the structure of optimization tasks, we can propose algorithms with more optimistic convergence…
Here we first discuss briefly the quantum annealing technique. We then study the quantum annealing of Sherrington-Kirkpatrick spin glass model with the tuning of both transverse and longitudinal fields. Both the fields are time-dependent…
We investigate the application of graph-cut methods for the study of the critical behaviour of the two-dimensional random-field Ising model. We focus on exact ground-state calculations, crossing the phase boundary of the model at zero…
We study the geometrical structure of the states in the low temperature phase of a mean field model for generalized spin glasses, the p-spin spherical model. This structure cannot be revealed by the standard methods, mainly due to the…
The state space of finite square and cubic Ising spin glass models is analysed in terms of the global and the local density of states. Systems with uniform and gaussian probability distribution of interactions are compared. Different…
We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based…
Starting from preferences on N proposed policies obtained via questionnaires from a sample of the electorate, an Ising spin-glass model in a field can be constructed from which a political party could find the subset of the proposed…
We study the problem of determining the Hamiltonian of a fully connected Ising Spin Glass of $N$ units from a set of measurements, whose sizes needs to be ${\cal O}(N^2)$ bits. The student-teacher scenario, used to study learning in…
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. Therefore, it is explained how the respective ground state…
Using the discrete $\pm J$ bond distribution for the Sherrington-Kirkpatrick spin glass, all ground states for the entire ensemble of the bond disorder are enumerated. Although the combinatorial complexity of the enumeration severely…
Glassy behavior is one of the main open problems in condensed matter physics. In this thesis, we approach the problem by studying spin-glasses and colloids, using several complementary strategies. From the point of view of model building,…
We report a Monte Carlo simulation of the $2D$ Edwards-Anderson spin glass model within the recently introduced multicanonical ensemble. Replica on lattices of size $L^2$ up to $L=48$ are investigated. Once a true groundstate is found, we…
Ising machines are hardware solvers which aim to find the absolute or approximate ground states of the Ising model. The Ising model is of fundamental computational interest because it is possible to formulate any problem in the complexity…
The purpose of this manuscript is to review my recent activity on three main research topics. The first concerns the nature of low temperature amorphous solids and their relation with the spin glass transition in a magnetic field. This is…
We employ a novel algorithm using a quasi-exact embedded-cluster matching technique as minimization method within a genetic algorithm to reliably obtain numerically exact ground states of the Edwards-Anderson XY spin glass model with…
A patchwork method is used to study the dynamics of loss and recovery of an initial configuration in spin glass models in dimensions d=1 and d=2. The patchwork heuristic is used to accelerate the dynamics to investigate how models might…
Finding the ground state of an Ising-spin glass on general graphs belongs to the class of NP-hard problems, widely believed to have no efficient polynomial-time algorithms for solving them. An approach developed in computer science for…
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum…
Lattice molecule models are proposed in order to study statistical mechanics of glass transition in finite dimensions. Molecules in the models are represented by hard Wang tiles and their density is controlled by a chemical potential. An…