Ising Computing Application

• Isingcomputation uses energy transfer between magnets to reach global minima
• A network of coupled oscillators can solve many combinatorial problems with intractable computation times
• Finding global minima requires annealing techniques

Motivation

• NP-hard combinatorial optimization problems (COPs) can be solved by a network of coupled oscillators where the global minima is the solution

Goals of This Project

• Demonstrate a large scale coupled-oscillator network with programmable weights and automated phase readout using circuit boards
• Compare hardware results with software based solutions
• Map real-world NP-hard problems (e.g. max cut, traveling salesman, graph coloring) onto real hardware

Poster & results achieved

Source Code:
https://github.com/Yahya-alhinai/oscillatorComputing