Academic Journal
Solving combinatorial optimisation problems using oscillator based Ising machines.
| Taitara: | Solving combinatorial optimisation problems using oscillator based Ising machines. |
|---|---|
| Ngā kaituhi: | Wang, Tianshi, Wu, Leon, Nobel, Parth, Roychowdhury, Jaijeet |
| Puna: | Natural Computing; Jun2021, Vol. 20 Issue 2, p287-306, 20p |
| Whakarāpopotonga: | We present OIM (Oscillator Ising Machines), a new way to make Ising machines using networks of coupled self-sustaining nonlinear oscillators. OIM is theoretically rooted in a novel result that establishes that the phase dynamics of coupled oscillator systems, under the influence of subharmonic injection locking, are governed by a Lyapunov function that is closely related to the Ising Hamiltonian of the coupling graph. As a result, the dynamics of such oscillator networks evolve naturally to local minima of the Lyapunov function. Two simple additional steps (i.e., turning subharmonic locking on and off smoothly, and adding noise) enable the network to find excellent solutions of Ising problems. We demonstrate our method on Ising versions of the MAX-CUT and graph colouring problems, showing that it improves on previously published results on several problems in the G benchmark set. Using synthetic problems with known global minima, we also present initial scaling results. Our scheme, which is amenable to realisation using many kinds of oscillators from different physical domains, is particularly well suited for CMOS IC implementation, offering significant practical advantages over previous techniques for making Ising machines. We report working hardware prototypes using CMOS electronic oscillators. [ABSTRACT FROM AUTHOR] |
| Ngā kupu marau: | HAMILTONIAN graph theory, NONLINEAR oscillators, LYAPUNOV functions, MACHINERY, ELECTRIC oscillators, BENCHMARK problems (Computer science) |
| Copyright of Natural Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| ISSN: | 15677818 |
| DOI: | 10.1007/s11047-021-09845-3 |
| Pātengi raraunga: | Complementary Index |