Related papers: OIM: Oscillator-based Ising Machines for Solving C…
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…
Probabilistic computing with pbits is emerging as a computational paradigm for machine learning and for facing combinatorial optimization problems (COPs) with the so-called probabilistic Ising machines (PIMs). From a hardware point of view,…
Recently, the coherent Ising machine (CIM) as a degenerate optical parametric oscillator (DOPO) network has been researched to solve Ising combinatorial optimization problems. We formulate a theoretical model for the CIM with discrete-time…
Networks of coupled nonlinear oscillators can display a wide range of emergent behaviours under variation of the strength of the coupling. Network equations for pairs of coupled oscillators where the dynamics of each node is described by…
Ising machines are emerging as a powerful physical alternative to digital processors for solving combinatorial optimization problems. Among them, spatial photonic Ising machines (SPIMs) offer compact, room-temperature hardware with…
A network of optical parametric oscillators is used to simulate classical Ising and XY spin chains. The collective nonlinear dynamics of this network, driven by quantum noise rather than thermal fluctuations, seeks out the Ising / XY ground…
Many combinatorial optimization problems can be reformulated as finding the ground state of the Ising model. Existing Ising solvers are mostly inspired by simulated annealing. Although annealing techniques offer scalability, they lack…
Optimal MIMO detection has been one of the most challenging and computationally inefficient tasks in wireless systems. We show that the new analog computing techniques like Coherent Ising Machines (CIM) are promising candidates for…
The equivalence between the natural minimization of energy in a dynamical system and the minimization of an objective function characterizing a combinatorial optimization problem offers a promising approach to designing dynamical…
This paper formalizes connections between stability of polynomials and convergence rates of Markov Chain Monte Carlo (MCMC) algorithms. We prove that if a (multivariate) partition function is nonzero in a region around a real point…
We propose a neural network model, which, with appropriate assignment of the stability of its equilibrium points (EPs), achieves Hopfield-like associative memory. The oscillator Ising machine (OIM) is an ideal candidates for such a model,…
An interesting problem in synchronization is the study of coupled oscillators, wherein oscillators with different natural frequencies synchronize to a common frequency and equilibrium phase difference. In this paper, we investigate the…
Ising machines are physical platforms designed to minimize the energy of classical Ising Hamiltonians, yet accessing specific excited states remains an open challenge of both fundamental and practical relevance. In this letter we show that…
Ising Machine is a promising computing approach for solving combinatorial optimization problems. It is naturally suited for energy-saving and compact in-memory computing implementations with emerging memories. A na\"ive in-memory computing…
Ising machines are effective solvers for complex combinatorial optimization problems. The idea is mapping the optimal solution(s) to a combinatorial optimization problem to the minimum energy state(s) of a physical system, which naturally…
We study the optimal design of a conductance network as a means for synchronizing a given set of oscillators. Synchronization is achieved when all oscillator voltages reach consensus, and performance is quantified by the mean-square…
We aim at an understanding of the dynamical properties of a periodically driven damped harmonic oscillator coupled to a Random Field Ising Model (RFIM) at zero temperature, which is capable to show complex hysteresis. The system is a…
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…
Second harmonic injection (SHI) has emerged as a critical mechanism in enabling networks of coupled oscillators to function as Oscillator Ising Machines (OIMs), capable of minimizing the Ising Hamiltonian. While SHI facilitates phase…
Ising machines based on analog systems have the potential of acceleration in solving ubiquitous combinatorial optimization problems. Although some artificial spins to support large-scale Ising machine is reported, e.g. superconducting…