3 papers
cs.ET2025
On the Limits of Ising Machines for Circuit-Derived SAT
Ahmet Efe, Hüsrev Cılasun, Abhimanyu Kumar +9
Emerging Ising machines are promising for solving computationally hard optimization problems, yet their limits on structured, circuit-derived satisfiability (SAT) problems remain p…
physics.comp-ph2025
Supporting Higher-Order Interactions in Practical Ising Machines
Nafisa Sadaf Prova, Hüsrev Cılasun, Abhimanyu Kumar +3
Ising machines as hardware solvers of combinatorial optimization problems (COPs) can efficiently explore large solution spaces due to their inherent parallelism and physics-based d…
cs.ET2024
HETRI: Heterogeneous Ising Multiprocessing
Ahmet Efe, Hüsrev Cılasun, Abhimanyu Kumar +4
Ising machines are effective solvers for complex combinatorial optimization problems. The idea is mapping the optimal solution(s) to a combinatorial optimization problem to the min…