Related papers: Self-contained relaxation-based dynamical Ising ma…
We study the purely relaxational dynamics (model A) at criticality in three-dimensional disordered Ising systems whose static critical behaviour belongs to the randomly diluted Ising universality class. We consider the site-diluted and…
Oscillator Ising machines (OIMs) represent an exemplar case of using physics-inspired non-linear dynamical systems to solve computationally challenging combinatorial optimization problems (COPs). The computational performance of such…
The standard phase-ordering process is obtained by quenching a system, like the Ising model, to below the critical point. This is usually done with periodic boundary conditions to insure ergodicity breaking in the low temperature phase.…
The central question of systems biology is to understand how individual components of a biological system such as genes or proteins cooperate in emerging phenotypes resulting in the evolution of diseases. As living cells are open systems in…
The Coherent Ising Machine (CIM) is a non-conventional architecture that takes inspiration from physical annealing processes to solve Ising problems heuristically. Its dynamics are naturally continuous and described by a set of ordinary…
We have revisited the non-conserved (or model A) critical dynamics of the two-dimensional Ising model through numerical simulations of its lattice and continuum formulations --Glauber dynamics and the timedependent Ginzburg-Landau (TDGL)…
This paper proposes a novel optimization framework for discrete phase shifts of a reconfigurable intelligent surface (RIS) using a coherent Ising machine (CIM). Unlike conventional methods based on iterative convex approximation or…
How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between planar and non-planar interaction graphs, and thus fails to…
In Directed Multiway Cut(Dir-MC) the input is an edge-weighted directed graph $G=(V,E)$ and a set of $k$ terminal nodes $\{s_1,s_2,\ldots,s_k\} \subseteq V$; the goal is to find a min-weight subset of edges whose removal ensures that there…
Recently proposed analog solvers based on dynamical systems, such as Ising machines, are promising platforms for large-scale combinatorial optimization. Yet, given the heuristic nature of the field, there is very limited insight on…
Many combinatorial problems can be mapped to Ising machines, i.e., networks of coupled oscillators that settle to a minimum-energy ground state, from which the problem solution is inferred. This work proposes DROID, a novel event-driven…
The spin system of the $2d$ Ising model having a hexagonal-lattice is simulated using non-deterministic Cellular Automata. The method to implement this program is outlined and our results show a good approximation to the exact analytic…
We investigate a kinetic Ising model with several single-spin flip dynamics (including Metropolis and heat-bath) on quenched and annealed random regular graphs. As expected, on the quenched structures all proposed algorithms reproduce the…
We investigate the nonequilibrium behavior of the d-dimensional Ising model with purely dissipative dynamics during its critical relaxation from a magnetized initial configuration. The universal scaling forms of the two-time response and…
Finding a ground state of a given Hamiltonian of an Ising model on a graph $G=(V,E)$ is an important but hard problem. The standard approach for this kind of problem is the application of algorithms that rely on single-spin-flip Markov…
A degenerate optical parametric oscillator network is proposed to solve the NP-hard problem of finding a ground state of the Ising model. The underlying operating mechanism originates from the bistable output phase of each oscillator and…
Lattice models, also known as generalized Ising models or cluster expansions, are widely used in many areas of science and are routinely applied to alloy thermodynamics, solid-solid phase transitions, magnetic and thermal properties of…
Ising machines are purported to be better at solving large-scale combinatorial optimisation problems better than conventional von Neumann computers. However, these Ising machines are widely believed to be heuristics, whose promise is…
The stacking problem is approached by computational mechanics, using an Ising next nearest neighbor model. Computational mechanics allows to treat the stacking arrangement as an information processing system in the light of a symbol…
Discontinuous dynamical systems with grazing solutions are discussed. The group property, continuation of solutions, continuity and smoothness of motions are thoroughly analyzed. A variational system around a grazing solution which depends…