Related papers: Large-scale Ising spin network based on degenerate…
The one-dimensional Ising model with its connections to several physical concepts plays a vital role in comprehension of several principles, phenomena and numerical methods. The Hamiltonian of a coupled one-dimensional dissipative spin…
A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables. Most Ising machines leverage second-order…
Ising machines (IMs) are specialized devices designed to efficiently solve combinatorial optimization problems (COPs). They consist of artificial spins that evolve towards a low-energy configuration representing a problem's solution. Most…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
Realizing compact and scalable Ising machines that are compatible with CMOS-process technology is crucial to the effectiveness and practicality of using such hardware platforms for accelerating computationally intractable problems. Besides…
We discuss a dynamical systems perspective on discrete optimization. Departing from the fact that many combinatorial optimization problems can be reformulated as finding low energy spin configurations in corresponding Ising models, we…
We present a direct experimental investigation of the thermal ordering in an artificial analogue of an asymmetric two dimensional Ising system composed of a rectangular array of nano-fabricated magnetostatically interacting islands. During…
We present a protocol to selectively decouple, recouple, and engineer effective couplings in mesoscopic dipolar spin networks. In particular, we develop a versatile protocol that relies upon magic angle spinning to perform Hamiltonian…
Coupled parametric oscillators were recently employed as simulators of artificial Ising networks, with the potential to solve computationally hard minimization problems. We demonstrate a new dynamical regime within the simplest network -…
This paper presents a coupled ring oscillator based Potts ma chine to solve NP-hard combinatorial optimization problems (COPs). Potts model is a generalization of the Ising model, cap turing multivalued spins in contrast to the…
In this work, we have studied the Ising model with one- and two-spin flip competing dynamics on a two-dimensional additive small-world network (A-SWN). The system model consists of a $L\times L$ square lattice where each site of the lattice…
The goal of this paper is to exhibit a deep relation between the partition function of the Ising model on a planar trivalent graph and the generating series of the spin network evaluations on the same graph. We provide respectively a…
We perform a quantum simulation of the Ising model with a transverse field using a collection of three trapped atomic ion spins. By adiabatically manipulating the Hamiltonian, we directly probe the ground state for a wide range of fields…
Quantum or quantum-inspired Ising machines have recently shown promise in solving combinatorial optimization problems in a short time. Real-world applications, such as time division multiple access (TDMA) scheduling for wireless multi-hop…
A lattice of locally bistable driven-dissipative cavity polaritons is found theoretically to effectively simulate the Ising model, also enabling an effective transverse field. We benchmark the system performance for spin glass problems, and…
It is well established that neural networks with deep architectures perform better than shallow networks for many tasks in machine learning. In statistical physics, while there has been recent interest in representing physical data with…
Ising machines -- special-purpose hardware for heuristically solving Ising optimization problems -- based on probabilistic bits (p-bits) have been established as a promising alternative to heuristic optimization algorithms run on…
The oscillator-based Ising machine (OIM) is a network of coupled CMOS oscillators that solves combinatorial optimization problems. In this paper, the distribution of the injection-locking oscillations throughout the circuit is proposed to…
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…
A new family of free fermionic quantum spin chains with multispin interactions was recently introduced. Here we show that it is possible to build standard quantum Ising chains -- but with inhomogeneous couplings -- which have the same…