Related papers: Solving Spin Glasses with Optimized Trees of Clust…
We describe a numerical algorithm for computing spin glass ground states with a high level of reliability. The method uses a population based search and applies optimization on multiple scales. Benchmarks are given leading to estimates of…
Chimera graphs define the topology of one of the first commercially available quantum computers. A variety of optimization problems have been mapped to this topology to evaluate the behavior of quantum enhanced optimization heuristics in…
Combinatorial problems such as combinatorial optimization and constraint satisfaction problems arise in decision-making across various fields of science and technology. In real-world applications, when multiple optimal or…
By applying a recently proposed mapping, we derive exactly the upper phase boundary of several Ising spin glass models defined over static graphs and random graphs, generalizing some known results and providing new ones.
The reconstruction of interaction networks between random events is a critical problem arising from statistical physics and politics, sociology, biology, psychology, and beyond. The Ising model lays the foundation for this reconstruction…
The spin glass behavior near zero temperature is a complicated matter. To get an easier access to the spin glass order parameter $Q(x)$ and, at the same time, keep track of $Q_{ab}$, its matrix aspect, and hence of the Hessian controlling…
A new method to numerically calculate the $n$th moment of the spin overlap of the two-dimensional $\pm J$ Ising model is developed using the identity derived by one of the authors (HK) several years ago. By using the method, the $n$th…
For some weighted $NP$-complete problems, checking whether a proposed solution is optimal is a non-trivial task. Such is the case for the celebrated traveling salesman problem, or the spin-glass problem in 3 dimensions. In this letter, we…
A wide variety of optimization techniques, both exact and heuristic, tend to be biased samplers. This means that when attempting to find multiple uncorrelated solutions of a degenerate Boolean optimization problem a subset of the solution…
Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant on the well-known Christofides' algorithm for the TSP, called the Best-of-Many Christofides' algorithm. The algorithm involves…
Zeros of the moment of the partition function $[Z^n]_{\bm{J}}$ with respect to complex $n$ are investigated in the zero temperature limit $\beta \to \infty$, $n\to 0$ keeping $y=\beta n \approx O(1)$. We numerically investigate the zeros of…
Spin glasses, generally defined as disordered systems with randomized competing interactions, are a widely investigated complex system. Theoretical models describing spin glasses are broadly used in other complex systems, such as those…
A spatial photonic Ising machine (SPIM) handles large-scale combinatorial optimization problems owing to optical processing with spatial parallelism. However, iterative feedback in the search for optimal solutions limits processing speed…
We present a polynomial time approximation scheme (PTAS) for the minimum value of the classical Ising Hamiltonian with linear terms on the Chimera graph structure as defined in the recent work of McGeoch and Wang. The result follows from a…
Although many efficient heuristics have been developed to solve binary optimization problems, these typically produce correlated solutions for degenerate problems. Most notably, transverse-field quantum annealing - the heuristic employed in…
We review several parallel tempering schemes and examine their main ingredients for accuracy and efficiency. The present study covers two selection methods of temperatures and several choices for the exchange of replicas, including a recent…
Exact results for the Jarzynski equality are derived for Ising spin glass models. The Jarzynski equality is an equality that connects the work in nonequilibrium and the difference between free energies. The work is performed in switching an…
We identify a special class of multi-species spin glass models: ones in which the species proportions serve to ''balance'' out the interaction strengths. For this class, we prove a free energy lower bound that does not require any convexity…
A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem for…
A dimer mean-field model for the Ising spin-glass is presented. Despite its simplicity it captures some of the essential features of the spin-glass physics. The distribution of the single-spin magnetization is determined from a…