Abstract
AbstractGain-dissipative Ising machines (GIMs) are dedicated devices that can rapidly solve combinatorial optimization problems. The noise intensity in traditional GIMs should be significantly smaller than its saturated fixed-point amplitude, indicating a lower noise margin. To overcome the existing limit, this work proposes an overdamped bistability-based GIM (OBGIM). Numerical test on uncoupled spin network show that the OBGIM has a different bifurcation dynamics from that of the traditional GIM. Moreover, the domain clustering dynamics on non-frustrated network proves that the overdamped bistability enables the GIM to suppress noise-induced random spin-state switching effectively; thus, it can function normally in an environment with a relatively large noise level. Besides, some prevalent frustrated graphs from the SuiteSparse Matrix Collection were adopted as MAXCUT benchmarks. The results show that the OBGIM can induce stochastic resonance phenomenon when solving difficult benchmarks. Compared with the traditional GIM, this characteristic makes the OBGIM achieve comparable solution accuracy in larger noise environment, thus achieving strong noise robustness.
Funder
JST-CREST
Japan AMED
Japan Society for the Promotion of Science
The University of Tokyo
Publisher
Springer Science and Business Media LLC
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献