arrow
Return

Non-binary dynamical Ising machines for combinatorial optimization

delete2025-06-23
delete0
delete
OA
AI
A
Aditya Shukla
M
Mikhail Erementchouk
P
Pinaki Mazumder
DOI:10.1016/j.physd.2025.134809delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Dynamical Ising machines achieve accelerated solving of complex combinatorial optimization problems by remapping the convergence to the ground state of the classical spin networks to the evolution of specially constructed continuous dynamical systems. The main adapted principle guiding the design of such systems is based on requiring that, on the one hand, the system converges to a binary state and, on the other hand, the system’s energy in such states mimics the classical Ising Hamiltonian. The emergence of binary-like states is regarded to be an indispensable feature of dynamical Ising machines as it establishes the relation between the machine’s continuous terminal state and the inherently discrete solution of a combinatorial optimization problem. This is emphasized by problems where the unknown quantities are represented by spin complexes, for example, the graph coloring problem. In such cases, an imprecise mapping of continuous states to spin configurations may lead to invalid solutions requiring intensive post-processing. In contrast to this approach, we show that there exists a class of non-binary dynamical Ising machines without the incongruity between the continuous character of the machine’s states and the discreteness of the spin states. We demonstrate this feature by applying such a machine to the problems of finding the proper graph coloring, constructing Latin squares, and solving Sudoku puzzles. Thus, we demonstrate that the information characterizing discrete states can be unambiguously presented in essentially continuous dynamical systems. This opens new opportunities for the realization of scalable electronic accelerators of combinatorial optimization.

Journal

P
Physica D - Nonlinear Phenomena
IF:
2.9
Papers:
389
Citations:
1.5W

Organization

No organization information available
Cited Papers

Cited Papers

Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
err4OR
IF0
err2019-11-26
err0
PREAI
errFred Glover; Gary Kochenberger; Yu Du
errShare
errSave
Network of time-multiplexed optical parametric oscillators as a coherent Ising machine
err2014-10-26
err404
PREAI
errMarandi, Alireza; Wang, Zhe; Takata, Kenta; Byer, Robert L.; Yamamoto, Yoshihisa
errShare
errSave
Order-of-magnitude differences in computational performance of analog Ising machines induced by the choice of nonlinearity
err2021-07-01
err33
errOAAI
errBohm, Fabian; Van Vaerenbergh, Thomas; Verschaffelt, Guy; Van der Sande, Guy
errShare
errSave
Stability of oscillator Ising machines: Not all solutions are created equal
err2023-10-09
err0
errOAAI
errMohammad Khairul Bashar; Zongli Lin; Nikhil Shukla
errShare
errSave
errShare
errSave
A coherent Ising machine for 2000-node optimization problems
err2016-11-04
err0
errOAAI
errTakahiro Inagaki; Yoshitaka Haribara; Koji Igarashi; Tomohiro Sonobe; Shuhei Tamate; Toshimori Honjo; Alireza Marandi; Peter L. McMahon; Takeshi Umeki; Koji Enbutsu; Osamu Tadanaga; Hirokazu Takenouchi; Kazuyuki Aihara; Ken-ichi Kawarabayashi; Kyo Inoue; Shoko Utsunomiya; Hiroki Takesue
errShare
errSave
Coherent Ising machines-optical neural networks operating at the quantum limit
err2017-12-15
err159
errOAAI
errYamamoto, Yoshihisa; Aihara, Kazuyuki; Leleu, Timothee; Kawarabayashi, Ken-ichi; Kako, Satoshi; Fejer, Martin; Inoue, Kyo; Takesue, Hiroki
errShare
errSave
errShare
errSave
Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems
err2024-04-24
err7
errOAAI
errSi, Jia; Yang, Shuhan; Cen, Yunuo; Chen, Jiaer; Huang, Yingna; Yao, Zhaoyang; Kim, Dong-Jun; Cai, Kaiming; Yoo, Jerald; Fong, Xuanyao; Yang, Hyunsoo
errShare
errSave
researcher View more