Training an ising machine with equilibrium propagation

J Laydevant, D Marković, J Grollier - Nature Communications, 2024 - nature.com
Ising machines, which are hardware implementations of the Ising model of coupled spins,
have been influential in the development of unsupervised learning algorithms at the origins …

A Review of Ising Machines Implemented in Conventional and Emerging Technologies

T Zhang, Q Tao, B Liu, A Grimaldi… - IEEE Transactions …, 2024 - ieeexplore.ieee.org
Ising machines have received growing interest as efficient and hardware-friendly solvers for
combinatorial optimization problems (COPs). They search for the absolute or approximate …

Computing with oscillators from theoretical underpinnings to applications and demonstrators

A Todri-Sanial, C Delacour, M Abernot… - Npj unconventional …, 2024 - nature.com
Networks of coupled oscillators have far-reaching implications across various fields,
providing insights into a plethora of dynamics. This review offers an in-depth overview of …

All-to-all reconfigurability with sparse and higher-order Ising machines

S Nikhar, S Kannan, NA Aadit, S Chowdhury… - Nature …, 2024 - nature.com
Abstract Domain-specific hardware to solve computationally hard optimization problems has
generated tremendous excitement. Here, we evaluate probabilistic bit (p-bit) based Ising …

3SAT on an all-to-all-connected CMOS Ising solver chip

H Cılasun, Z Zeng, A Kumar, H Lo, W Cho, W Moy… - Scientific reports, 2024 - nature.com
This work solves 3SAT, a classical NP-complete problem, on a CMOS-based Ising hardware
chip with all-to-all connectivity. The paper addresses practical issues in going from …

DS-GL: Advancing Graph Learning via Harnessing Nature's Power within Scalable Dynamical Systems

R Song, C Wu, C Liu, A Li, M Huang… - 2024 ACM/IEEE 51st …, 2024 - ieeexplore.ieee.org
With the rapid digitization of the world, an increasing number of real-world applications are
turning to non-Euclidean data, modeled as graphs. Due to their intrinsic high complexity and …

Improved time complexity for spintronic oscillator ising machines compared to a popular classical optimization algorithm for the Max-Cut problem

N Garg, S Singhal, N Aggarwal, A Sadashiva… - …, 2024 - iopscience.iop.org
Solving certain combinatorial optimization problems like Max-Cut becomes challenging
once the graph size and edge connectivity increase beyond a threshold, with brute-force …

Neuro-Symbolic Computing: Advancements and Challenges in Hardware-Software Co-Design

X Yang, Z Wang, XS Hu, CH Kim, S Yu… - … on Circuits and …, 2023 - ieeexplore.ieee.org
The rapid progress of artificial intelligence (AI) has led to the emergence of a highly
promising field known as neuro-symbolic (NeSy) computing. This approach combines the …

PASS: An Asynchronous Probabilistic Processor for Next Generation Intelligence

S Patel, P Canoza, A Datar, S Lu, C Garg… - arXiv preprint arXiv …, 2024 - arxiv.org
New computing paradigms are required to solve the most challenging computational
problems where no exact polynomial time solution exists. Probabilistic Ising Accelerators …

Design of a Mixed-Signal Compute-in-Memory Ising Solver With Sub-s Time-to-Solution and Optimal Decaying Noise Profile

AM Dee, D Vuong, K Bennett… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Combinatorial and discrete optimization problems are prevalent in fields such as artificial
intelligence, supply chain management, and wireless communications. The Ising machine, a …