Efficient optimization with higher-order Ising machines
Abstract A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables. Most Ising machines leverage second-order interactions although important classes of optimization prob...
Main Authors: | Connor Bybee, Denis Kleyko, Dmitri E. Nikonov, Amir Khosrowshahi, Bruno A. Olshausen, Friedrich T. Sommer |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2023-09-01
|
Series: | Nature Communications |
Online Access: | https://doi.org/10.1038/s41467-023-41214-9 |
Similar Items
-
On separating long- and short-term memories in hyperdimensional computing
by: Jeffrey L. Teeters, et al.
Published: (2023-01-01) -
Principled neuromorphic reservoir computing
by: Denis Kleyko, et al.
Published: (2025-01-01) -
All-to-all reconfigurability with sparse and higher-order Ising machines
by: Srijan Nikhar, et al.
Published: (2024-10-01) -
Designing Ising machines with higher order spin interactions and their application in solving combinatorial optimization
by: Mohammad Khairul Bashar, et al.
Published: (2023-06-01) -
Efficient sampling of ground and low-energy Ising spin configurations with a coherent Ising machine
by: Edwin Ng, et al.
Published: (2022-01-01)