activity
20182026
most citedA full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms

136 citations · 367 across the 19 of their papers we have counts for

collaborators

20 papers

cs.LG2026

Probabilistic Algorithms for Ising Machines from Optimization to Generative AI

Corentin Delacour, Xiuqi Zhang, Abdelrahman S. Abdelrahman +4

Ising machines have emerged as promising hardware accelerators for intractable optimization and sampling problems, yet their practical impact increasingly hinges on the co-design o…

cond-mat.dis-nn2026

Extreme-Scale Ising Machines with Cluster Mean-Field Theory

Xiuqi Zhang, Shuvro Chowdhury, Shaila Niazi +3

Scaling analog and digital Ising machines to larger problems requires overcoming finite device capacity and the cost of communication between devices. We present cluster mean-field…

cs.DC2026

Programmable Probabilistic Computer with 1,000,000 p-bits

Navid Anjum Aadit, Xiuqi Zhang, Shuvro Chowdhury +10

Probabilistic computers built from p-bits have been proposed as hardware accelerators for sampling and optimizing Ising models, but existing systems have been confined to a single…

cs.ET2026

Probabilistic approximate optimization using single-photon avalanche diode arrays

Ziyad Alswaidan, Abdelrahman S. Abdelrahman, Md Sakibur Sajal +9

Combinatorial optimization problems are central to science and engineering and specialized hardware from quantum annealers to classical Ising machines are being actively developed…

quant-ph2025

Probabilistic Computers for Neural Quantum States

Shuvro Chowdhury, Jasper Pieterse, Navid Anjum Aadit +3

Neural quantum states efficiently represent many-body wavefunctions with neural networks, but the cost of Monte Carlo sampling limits their scaling to large system sizes. Here we a…

cs.LG2025

IsingFormer: Augmenting Parallel Tempering With Learned Proposals

Saleh Bunaiyan, Corentin Delacour, Shuvro Chowdhury +3

Generative models have been extensively used to accelerate MCMC mixing for sampling and optimization, but their effective integration with standard MCMC remains an open question. H…

cond-mat.dis-nn2025★ 2 cited

Generalized Probabilistic Approximate Optimization Algorithm

Abdelrahman S. Abdelrahman, Shuvro Chowdhury, Flaviano Morone +1

We introduce a generalized \textit{Probabilistic Approximate Optimization Algorithm (PAOA)}, a classical variational Monte Carlo framework that extends and formalizes prior work by…

cs.AR2025★ 1 cited

A CMOS Probabilistic Computing Chip With In-situ hardware Aware Learning

Jinesh Jhonsa, William Whitehead, David McCarthy +3

This paper demonstrates a probabilistic bit physics inspired solver with 440 spins configured in a Chimera graph, occupying an area of 0.44 mm^2. Area efficiency is maximized throu…

quant-ph2025★ 9 cited

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★ 10 cited

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…

cond-mat.dis-nn2024★ 11 cited

Noise-augmented Chaotic Ising Machines for Combinatorial Optimization and Sampling

Kyle Lee, Shuvro Chowdhury, Kerem Y. Camsari

Ising machines, hardware accelerators for combinatorial optimization and probabilistic sampling problems, have gained significant interest recently. A key element is stochasticity,…

cs.ET2024

Mean-Field Assisted Deep Boltzmann Learning with Probabilistic Computers

Shuvro Chowdhury, Shaila Niazi, Kerem Y. Camsari

Despite their appeal as physics-inspired, energy-based and generative nature, general Boltzmann Machines (BM) are considered intractable to train. This belief led to simplified mod…

cs.DC2023★ 31 cited

All-to-all reconfigurability with sparse and higher-order Ising machines

Srijan Nikhar, Sidharth Kannan, Navid Anjum Aadit +2

Domain-specific hardware to solve computationally hard optimization problems has generated tremendous excitement. Here, we evaluate probabilistic bit (p-bit) based Ising Machines (…

cs.ET2023★ 4 cited

Machine Learning Quantum Systems with Magnetic p-bits

Shuvro Chowdhury, Kerem Y. Camsari

The slowing down of Moore's Law has led to a crisis as the computing workloads of Artificial Intelligence (AI) algorithms continue skyrocketing. There is an urgent need for scalabl…

cs.ET2023★ 136 cited

A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms

Shuvro Chowdhury, Andrea Grimaldi, Navid Anjum Aadit +9

The transistor celebrated its 75 birthday in 2022. The continued scaling of the transistor defined by Moore's Law continues, albeit at a slower pace. Meanwhile, compu…

cs.ET2023★ 52 cited

Training Deep Boltzmann Networks with Sparse Ising Machines

Shaila Niazi, Navid Anjum Aadit, Masoud Mohseni +3

The slowing down of Moore's law has driven the development of unconventional computing paradigms, such as specialized Ising machines tailored to solve combinatorial optimization pr…

quant-ph2022★ 32 cited

Accelerated Quantum Monte Carlo with Probabilistic Computers

Shuvro Chowdhury, Kerem Y. Camsari, Supriyo Datta

Quantum Monte Carlo (QMC) techniques are widely used in a variety of scientific problems and much work has been dedicated to developing optimized algorithms that can accelerate QMC…

cond-mat.mes-hall2020★ 22 cited

The Non-Equilibrium Green Function (NEGF) Method

Kerem Y. Camsari, Shuvro Chowdhury, Supriyo Datta

The Non-Equilibrium Green Function (NEGF) method was established in the 1960's through the classic work of Schwinger, Kadanoff, Baym, Keldysh and others using many-body perturbatio…

cond-mat.dis-nn2020★ 9 cited

Emulating Quantum Interference with Generalized Ising Machines

Shuvro Chowdhury, Kerem Y. Camsari, Supriyo Datta

The primary objective of this paper is to present an exact and general procedure for mapping any sequence of quantum gates onto a network of probabilistic p-bits which can take on…

quant-ph2018★ 48 cited

Scalable Emulation of Sign-ProblemFree Hamiltonians with Room Temperature p-bits

Kerem Y. Camsari, Shuvro Chowdhury, Supriyo Datta

The growing field of quantum computing is based on the concept of a q-bit which is a delicate superposition of 0 and 1, requiring cryogenic temperatures for its physical realizatio…