3 papers
quant-ph2025
Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers
Shuvro Chowdhury, Navid Anjum Aadit, Andrea Grimaldi +12
Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet whether they can deliver an advantage for practical real-world problems remains…
cs.ET2025
Scalable Connectivity for Ising Machines: Dense to Sparse
M Mahmudul Hasan Sajeeb, Navid Anjum Aadit, Shuvro Chowdhury +7
In recent years, hardware implementations of Ising machines have emerged as a viable alternative to quantum computing for solving hard optimization problems among other application…
cs.DC2024
Next-generation Probabilistic Computing Hardware with 3D MOSAICs, Illusion Scale-up, and Co-design
Tathagata Srimani, Robert Radway, Masoud Mohseni +2
The vast majority of 21st century AI workloads are based on gradient-based deterministic algorithms such as backpropagation. One of the key reasons for the dominance of determinist…