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 …
A probabilistic compute fabric based on coupled ring oscillators for solving combinatorial optimization problems
Nondeterministic polynomial time hard (NP-hard) combinatorial optimization problems
(COPs) are intractable to solve using a traditional computer as the time to find a solution …
(COPs) are intractable to solve using a traditional computer as the time to find a solution …
[HTML][HTML] Ultrafast Ising Machines using spin torque nano-oscillators
Combinatorial optimization problems are known for being particularly hard to solve on
traditional von Neumann architectures. This has led to the development of Ising Machines …
traditional von Neumann architectures. This has led to the development of Ising Machines …
STATICA: A 512-spin 0.25 M-weight annealing processor with an all-spin-updates-at-once architecture for combinatorial optimization with complete spin–spin …
This article presents a high-performance annealing processor named STochAsTIc Cellular
automata Annealer (STATICA) for solving combinatorial optimization problems represented …
automata Annealer (STATICA) for solving combinatorial optimization problems represented …
4.6 A 144Kb annealing system composed of 9× 16Kb annealing processor chips with scalable chip-to-chip connections for large-scale combinatorial optimization …
T Takemoto, K Yamamoto, C Yoshimura… - … Solid-State Circuits …, 2021 - ieeexplore.ieee.org
Substantial progress has been made on a new computer architecture, known as an
annealing processor (AP)[1-4]. The AP can effectively solve NP-hard combinatorial …
annealing processor (AP)[1-4]. The AP can effectively solve NP-hard combinatorial …
Amorphica: 4-replica 512 fully connected spin 336MHz metamorphic annealer with programmable optimization strategy and compressed-spin-transfer multi-chip …
Combinatorial optimization (CO) is vital for making wiser decisions and planning in our
society. Annealing computation is a promising CO approach derived from an analogy to …
society. Annealing computation is a promising CO approach derived from an analogy to …
A review of simulation algorithms of classical ising machines for combinatorial optimization
Combinatorial optimization problems are difficult to solve due to the space explosion in an
exhaustive search. Using Ising model-based solvers can efficiently find near-optimal …
exhaustive search. Using Ising model-based solvers can efficiently find near-optimal …
Distance-based clustering using QUBO formulations
In computer science, clustering is a technique for grou** data. Ising machines can solve
distance-based clustering problems described by quadratic unconstrained binary …
distance-based clustering problems described by quadratic unconstrained binary …
Highly reconfigurable oscillator-based Ising Machine through quasiperiodic modulation of coupling strength
Abstract Ising Machines (IMs) have the potential to outperform conventional Von-Neuman
architectures in notoriously difficult optimization problems. Various IM implementations have …
architectures in notoriously difficult optimization problems. Various IM implementations have …
Flexspin: A scalable CMOS Ising machine with 256 flexible spin processing elements for solving complex combinatorial optimization problems
Combinatorial optimization problems (COPs) are ubiquitous in applications such as finance,
logistics, drug discovery, supply chain optimization, and public transportation. However …
logistics, drug discovery, supply chain optimization, and public transportation. However …