A CMOS-compatible Ising Machine with Bistable Nodes
arXiv:2007.06665
Abstract
Physical Ising machines rely on nature to guide a dynamical system towards an optimal state which can be read out as a heuristical solution to a combinatorial optimization problem. Such designs that use nature as a computing mechanism can lead to higher performance and/or lower operation costs and hence have attracted research and prototyping efforts from industry and academia. Quantum annealers are a prominent example of such efforts. However, some physics-centric Ising machines require stringent operating conditions that result in significant bulk and energy budget. Such disadvantages may be acceptable if these designs provide some significant intrinsic advantages at a much larger scale in the future, which remains to be seen. But for now, integrated electronic designs of Ising machines allow more immediate applications. We propose one such design that uses bistable nodes, coupled with programmable and variable strengths. The design is fully CMOS compatible for chip-scale applications and demonstrates competitive solution quality and significantly superior execution time and energy.
arXiv comment25 pages, 18 figures, 1 tables, 5 sections,
References in corpus (9)
- Ising formulations of many NP problems
- Characterizing Quantum Supremacy in Near-Term Devices
- Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
- A practical heuristic for finding graph minors
- Heuristic Recurrent Algorithms for Photonic Ising Machines
- Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
- A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems
- Solving maximum cut problems by simulated annealing
- OIM: Oscillator-based Ising Machines for Solving Combinatorial Optimisation Problems