Related papers: An optical Ising spin glass simulator with tuneabl…
Extensive simulations are made of link and spin overlaps in four and five dimensional Ising Spin Glasses (ISGs). Moments and moment ratios of the mean link overlap distributions (the variance, the kurtosis and the skewness) show clear…
Ising Machines (IMs) are physical systems designed to find solutions to combinatorial optimization (CO) problems mapped onto the IM via the coupling strengths of its binary spins. Using the intrinsic dynamics and different annealing…
A characteristic feature of the non--equilibrium dynamics of real spin glasses at low temperatures are strong aging effects. These phenomena can be manipulated by changing the external parameters in various ways: a thermo-cycling experiment…
The paper discusses the transformation of decorated Ising models into an effective \textit{undecorated} spin models, using the most general Hamiltonian for interacting Ising models including a long range and high order interactions. The…
The mining in physics and biology for accelerating the hardcore algorithm to solve non-deterministic polynomial (NP) hard problems has inspired a great amount of special-purpose ma-chine models. Ising machine has become an efficient solver…
We investigate spin-spin correlation functions in the low temperature phase of spin-glasses. Using the replica field theory formalism, we examine in detail their infrared (long distance) behavior. In particular we identify a longitudinal…
Efficiently optimizing Nondeterministic Polynomial time (NP) problems in polynomial time has profound implications in many domains. CMOS oscillator networks have been shown to be effective and efficient in approximating certain NP-hard…
In this talk I will review the approach to spin glasses based on the spontaneously broken replica symmetry. I will concentrate my attention mostly on more general ideas, skipping technical details and stressing the characteristic…
Ising machines can solve combinatorial optimization problems by representing them as energy minimization problems. A common implementation is the probabilistic Ising machine (PIM), which uses probabilistic (p-) bits to represent coupled…
Error-mitigation methods for Ising machines are reexamined not merely as noise-suppression techniques but as a structural design problem of replica-coupled Ising models. Using simulated annealing as a hardware-noise-free testbed, we…
We simulate the $N$-spin critical Ising model on a square lattice using Glauber dynamics and consider the typical one-unit time equal to $N$ single-spin-flip attempts. The divergence of correlation time with the linear extent of the system…
A new approach to combinatorial optimization based on systematic move-class deflation is proposed. The algorithm combines heuristics of genetic algorithms and simulated annealing, and is mainly entropy-driven. It is tested on two problems…
To investigate novel aspects of pattern formation in spin systems, we use a mapping between reactive concentrations in a reaction-diffusion system and spin orientations in a dynamic multiple-spin Ising model. While pattern formation in…
Ising machines are a form of quantum-inspired processing-in-memory computer which has shown great promise for overcoming the limitations of traditional computing paradigms while operating at a fraction of the energy use. The process of…
Dilute dipolar Ising magnets remain a notoriously hard problem to tackle both analytically and numerically because of long-ranged interactions between spins as well as rare region effects. We study a new type of anisotropic dilute dipolar…
In a $p$-spin interaction spherical spin-glass model both the spins and the couplings are allowed to change in the course of time. The spins are coupled to a heat bath with temperature $T$, while the coupling constants are coupled to a bath…
We study the role of Hamiltonian complexity in the performance of quantum annealers. We consider two general classes of annealing Hamiltonians: stoquastic ones, which can be simulated efficiently using the quantum Monte Carlo algorithm, and…
The statics-dynamics correspondence in spin glasses relate non-equilibrium results on large samples (the experimental realm) with equilibrium quantities computed on small systems (the typical arena for theoretical computations). Here we…
We construct a model of short-range interacting Ising spins on a translationally invariant two-dimensional lattice that mimics a reversible circuit that multiplies or factorizes integers, depending on the choice of boundary conditions. We…
We consider the problem of robotic planning under uncertainty. This problem may be posed as a stochastic optimal control problem, complete solution to which is fundamentally intractable owing to the infamous curse of dimensionality. We…