activity
20232026
most cited3SAT on an All-to-All-Connected CMOS Ising Solver Chip

22 citations · 22 across the 7 of their papers we have counts for

collaborators

7 papers

cs.ET2026

An FPGA-ASIC Co-Design Framework for Capacity-Constrained Physics-Based Ising Chips

Ruihong Yin, Yue Zheng, Chaohui Li +6

When a problem exceeds an analog Ising machine's spin capacity it cannot be solved in one shot: a digital orchestration layer must iteratively decompose the graph, clamp boundary s…

cs.LG2026

Extractive summarization on a CMOS Ising machine

Ziqing Zeng, Abhimanyu Kumar, Ahmet Efe +4

Extractive summarization (ES) aims to generate a concise summary by selecting a subset of sentences from a document while maximizing relevance and minimizing redundancy. Although m…

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.ET2025

DROID: Discrete-Time Simulation for Ring-Oscillator-Based Ising Design

Abhimanyu Kumar, Ramprasath S., Chris H. Kim +2

Many combinatorial problems can be mapped to Ising machines, i.e., networks of coupled oscillators that settle to a minimum-energy ground state, from which the problem solution is…

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…

cs.ET2023★ 22 cited

3SAT on an All-to-All-Connected CMOS Ising Solver Chip

Hüsrev Cılasun, Ziqing Zeng, Ramprasath S +6

This work solves 3SAT, a classical NP-complete problem, on a CMOS-based Ising hardware chip with all-to-all connectivity. The paper addresses practical issues in going from algorit…