Related papers: Self-contained relaxation-based dynamical Ising ma…
This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state. The basic…
We consider two parallel cyclic Ising chains counter-rotating at a relative velocity v, the motion actually being a succession of discrete steps. There is an in-chain interaction between nearest-neighbor spins and a cross-chain interaction…
Finding the ground state of spin glasses is a challenging problem with broad implications. Many hard optimization problems, including NP-complete problems, can be mapped, for instance, to the Ising spin glass model. We present a graph-based…
Oscillator based Ising machines are non-von-Neumann machines ideally suited for solving combinatorial problems otherwise intractable on classic stored-program digital computers due to their run-time complexity. Possible future applications…
Time crystals in periodically driven systems have initially been studied assuming either the ability to quench the Hamiltonian between different many-body regimes, the presence of disorder or long-range interactions. Here we propose the…
Optical Ising machines promise to solve complex optimization problems with an optical hardware acceleration advantage. Here we study the ground state properties of a nonlinear optical Ising machine realized by spatial light modulator,…
We propose a novel type of minor-embedding (ME) in simulated-annealing-based Ising machines. The Ising machines can solve combinatorial optimization problems. Many combinatorial optimization problems are mapped to find the ground…
Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising…
The commercial and industrial demand for the solution of hard combinatorial optimization problems push forward the development of efficient solvers. One of them is the Ising machine which can solve combinatorial problems mapped to Ising…
The bulk and boundary magnetizations are calculated for the critical Ising model on a randomly triangulated disk in the presence of a boundary magnetic field h. In the continuum limit this model corresponds to a c = 1/2 conformal field…
The phase transition kinetics of Ising gauge models are investigated. Despite the absence of a local order parameter, relevant topological excitations that control the ordering kinetics can be identified. Dynamical scaling holds in the…
The dissipative variant of the Ising model in a transverse field is one of the most important models in the analysis of open quantum many-body systems, due to its paradigmatic character for understanding driven-dissipative quantum phase…
Periodically driven parametric oscillators offer a convenient way to simulate classical Ising spins. When many parametric oscillators are coupled dissipatively, they can be analogous to networks of Ising spins, forming an effective coherent…
We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence…
Neuronal ensemble activity, including coordinated and oscillatory patterns, exhibits hallmarks of nonequilibrium systems with time-asymmetric trajectories to maintain their organization. However, assessing time asymmetry from neuronal…
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 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…
The dynamics of the spins in the Ising model are analyzed using a virtual walk scenario. The system is quenched from a very high temperature to a lower one using the Glauber scheme in one and two dimensions. A walk is associated with each…
We consider social systems in which agents are not only characterized by their states but also have the freedom to choose their interaction partners to maximize their utility. We map such systems onto an Ising model in which spins are…
We present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm…