Related papers: Annealing by simulating the coherent Ising machine
Quantum annealing is typically regarded as a tool for combinatorial optimization, but its coherent dynamics also offer potential for machine learning. We present a model that encodes classical data into an Ising Hamiltonian, evolves it on a…
The past decade has seen the emergence of Ising machines targeting hard combinatorial optimization problems by minimizing the Ising Hamiltonian with spins represented by continuous dynamical variables. However, capabilities of these…
The coherent Ising machine (CIM) is a nonconventional hardware architecture for finding approximate solutions to large-scale combinatorial optimization problems. It operates by annealing a laser gain parameter to adiabatically deform a…
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…
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…
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,…
A promising paradigm of quantum computing for achieving practical quantum advantages is quantum annealing or quantum approximate optimization algorithm, where the classical problems are encoded in Ising interactions. However, it is…
Recently, spatial photonic Ising machines (SPIMs) have demonstrated the abilities to compute the Ising Hamiltonian of large-scale spin systems, with the advantages of ultrafast speed and high power efficiency. However, such optical…
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…
Quantum computers use quantum resources to carry out computational tasks and may outperform classical computers in solving certain computational problems. Special-purpose quantum computers such as quantum annealers employ quantum adiabatic…
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…
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,…
We evaluate the performance of different algorithms in minimizing the Hamiltonian of a spatial-photonic Ising machine (SPIM). We then encode the number-partitioning problem on the SPIM and adiabatically arrive at good solutions for the…
We investigate the minimization of Ising Hamiltonians, comparing the performance of gain-based computing paradigms based on the dynamics of semi-classical soft-spin models with quantum annealing. We systematically analyze how the energy…
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…
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…
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…
Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by…
Quantum phase transitions (QPTs) in coherent Ising machines (CIMs) are studied via a spectral mapping between the one-dimensional XY spin model and a network of degenerate optical parametric oscillators (DOPOs). This exact correspondence…
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…