Related papers: A numerical model for time-multiplexed Ising machi…
Oscillator Ising machines (OIMs) are networks of coupled oscillators that seek the minimum energy state of an Ising model. Since many NP-hard problems are equivalent to the minimization of an Ising Hamiltonian, OIMs have emerged as a…
In this paper, we report new results on a novel Ising machine technology for solving combinatorial optimization problems using networks of coupled self-sustaining oscillators. Specifically, we present several working hardware prototypes…
Ising machines (IM) are physics-inspired alternatives to von Neumann architectures for solving hard optimization tasks. By mapping binary variables to coupled Ising spins, IMs can naturally solve unconstrained combinatorial optimization…
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…
Many combinatorial optimization problems can be mapped to finding the ground states of the corresponding Ising Hamiltonians. The physical systems that can solve optimization problems in this way, namely Ising machines, have been attracting…
Interest in non-algorithmic, unconventional computing is rising in recent years due to more and more apparent short comings of classic stored-program digital computers, such as energy efficiency, degree of parallelism in computations, clock…
We present a new way to make Ising machines, i.e., using networks of coupled self-sustaining nonlinear oscillators. Our scheme is theoretically rooted in a novel result that establishes that the phase dynamics of coupled oscillator systems,…
Finding the ground states of the Ising Hamiltonian [1] maps to various combinatorial optimization problems in biology, medicine, wireless communications, artificial intelligence, and social network. So far no efficient classical and quantum…
The last couple of years have seen an emergence of physics-inspired computing for maximum likelihood MIMO detection. These methods involve transforming the MIMO detection problem into an Ising minimization problem, which can then be solved…
Many tasks in our modern life, such as planning an efficient travel, image processing and optimizing integrated circuit design, are modeled as complex combinatorial optimization problems with binary variables. Such problems can be mapped to…
We explore a case example of networks of classical electronic oscillators evolving towards the solution of complex optimization problems. We show that when driven into subharmonic response, a network of such nonlinear electrical resonators…
Analog Ising machines (IMs) occupy an increasingly prominent area of computer architecture research, offering high-quality and low latency/energy solutions to intractable computing tasks. However, IMs have a fixed capacity, with little to…
A non-equilibrium open-dissipative neural network, such as a coherent Ising machine based on mutually coupled optical parametric oscillators, has been proposed and demonstrated as a novel computing machine for hard combinatorial…
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…
Networks of optical oscillators simulating coupled Ising spins have been recently proposed as a heuristic platform to solve hard optimization problems. These networks, called coherent Ising machines (CIMs), exploit the fact that the…
Oscillator Ising Machines (OIMs) and probabilistic bit (p-bit)-based computing platforms have emerged as promising paradigms for tackling complex combinatorial optimization problems. Although traditionally viewed as distinct approaches,…
Dynamical Ising machines are actively investigated from the perspective of finding efficient heuristics for NP-hard optimization problems. However, the existing data demonstrate super-polynomial scaling of the running time with the system…
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…
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…
Ising machines are hardware solvers which aim to find the absolute or approximate ground states of the Ising model. The Ising model is of fundamental computational interest because it is possible to formulate any problem in the complexity…