Ising machines are dedicated hardware solvers designed to solve NP-hard combinatorial optimization problems (COPs) by mapping them to the Ising model. These non-von Neumann architectures, including oscillator, quantum, heuristic, and classical digital systems, often outperform traditional solvers in faster computation for problems in planning, logistics, manufacturing, and finance. Physics-based Ising machines, in particular, demonstrate superior efficiency, delivering faster solutions with lower energy consumption.
However, their practical implementation faces key limitations. Current implementations are restricted by bit precision and problem size that can distort the transformed solution space, deviating significantly from the original solution space. This seminar offers a comprehensive overview of the diverse Ising solvers present in current literature, including a newly proposed solver. Additionally, it examines strategies to address hardware-related constraints while preserving solution accuracy.
12/6/2026 11:00 - 12:00
ESAT Aula R
