Ising machines as hardware solvers of combinatorial optimization problems
Ising machines are hardware solvers that aim to find the absolute or approximate ground
states of the Ising model. The Ising model is of fundamental computational interest because …
states of the Ising model. The Ising model is of fundamental computational interest because …
Coherent SAT solvers: a tutorial
The coherent Ising machine (CIM) is designed to solve the NP-hard Ising problem quickly
and energy efficiently. Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are …
and energy efficiently. Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are …
Experimental investigation of performance differences between coherent Ising machines and a quantum annealer
Physical annealing systems provide heuristic approaches to solving combinatorial
optimization problems. Here, we benchmark two types of annealing machines—a quantum …
optimization problems. Here, we benchmark two types of annealing machines—a quantum …
Formulating and solving routing problems on quantum computers
The determination of vehicle routes fulfilling connectivity, time, and operational constraints is
a well-studied combinatorial optimization problem. The NP-hard complexity of vehicle …
a well-studied combinatorial optimization problem. The NP-hard complexity of vehicle …
OIM: Oscillator-based Ising machines for solving combinatorial optimisation problems
We present a new way to make Ising machines, ie, using networks of coupled self-sustaining
nonlinear oscillators. Our scheme is theoretically rooted in a novel result that establishes …
nonlinear oscillators. Our scheme is theoretically rooted in a novel result that establishes …
Solving combinatorial optimisation problems using oscillator based Ising machines
Abstract We present OIM (Oscillator Ising Machines), a new way to make Ising machines
using networks of coupled self-sustaining nonlinear oscillators. OIM is theoretically rooted in …
using networks of coupled self-sustaining nonlinear oscillators. OIM is theoretically rooted in …
Efficient optimization with higher-order Ising machines
A prominent approach to solving combinatorial optimization problems on parallel hardware
is Ising machines, ie, hardware implementations of networks of interacting binary spin …
is Ising machines, ie, hardware implementations of networks of interacting binary spin …
FPGA-based simulated bifurcation machine
Since many combinatorial optimization problems can be mapped onto ground-state search
problems of Ising models, special-purpose machines for Ising problems have attracted …
problems of Ising models, special-purpose machines for Ising problems have attracted …
A continuous-time MaxSAT solver with high analog performance
Many real-life optimization problems can be formulated in Boolean logic as MaxSAT, a class
of problems where the task is finding Boolean assignments to variables satisfying the …
of problems where the task is finding Boolean assignments to variables satisfying the …
A survey on analog models of computation
A Survey on Analog Models of Computation Page 1 Chapter 6 A Survey on Analog Models of
Computation Olivier Bournez and Amaury Pouly Abstract We present a survey on analog …
Computation Olivier Bournez and Amaury Pouly Abstract We present a survey on analog …