Shuvro Chowdhury
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shuvro Chowdhury has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Kerem Yunus Camsari
Department of Electrical and Computer Engineering University of California 93106 Santa Barbara Santa Barbara CA USA
11 shared publications - Navid Anjum Aadit
Department of Electrical and Computer Engineering, University of California, Santa Barbara, USA
5 shared publications - Supriyo Datta
Purdue University
5 shared publications Kerem Y. Camsari
Department of Electrical and Computer Engineering, University of California Santa Barbara, Santa Barbara, USA
4 shared publications- Luke Theogarajan
Department of Electrical and Computer Engineering, UCSB, Santa Barbara, CA, USA
3 shared publications - Shaila Niazi
Department of Electrical and Computer Engineering, University of California at Santa Barbara, Santa Barbara, CA, USA
3 shared publications
Latest Publications
- 15 October 2026
- Published by Springer Nature in Nature Reviews Electrical Engineering
- Vol. 3 (11) , 722-733
Probabilistic algorithms for Ising machines from optimization to generative AI
- 15 October 2026
- Published by Springer Nature in Nature Reviews Electrical Engineering
- Vol. 3 (11) , 722-733
Probabilistic algorithms for Ising machines from optimization to generative AI
- Open Access
- 1 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
- Vol. 12, 86-94
A CMOS Probabilistic Computing Chip With Hardware-Aware Learning
This work demonstrates a compact probabilistic computing system based on a physics-inspired p-bit architecture with 440 interacting spins configured in a Chimera graph and occupying 0.44 mm² of silicon area. Area efficiency is achieved through a current-mode neuron update circuit and a mixed-signal design approach that integrates pitch-matched standard-cell analog blocks with digital logic and a shared power supply network. Device mismatch and process variations arising from this tightly coupled mixed-signal implementation are addressed using a hardware-aware contrastive divergence training framework. By incorporating non-ideal circuit behavior directly into the training loop, the system achieves reliable stochastic dynamics without requiring per-device calibration. Measurement results validate robust probabilistic operation across all spins. The chip is evaluated on probabilistic logic functions, including logic gates and full adders, and on combinatorial optimization problems such as Max-Cut. These results demonstrate that learning-enabled compensation of hardware non-idealities enables scalable probabilistic computing architectures. The proposed system demonstrates effective cross-layer co-design across circuit, architectural, and algorithmic levels, supporting emerging non-von Neumann computing paradigms.
- 1 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
- Vol. 12, 86-94
Open AccessA CMOS Probabilistic Computing Chip With Hardware-Aware Learning
This work demonstrates a compact probabilistic computing system based on a physics-inspired p-bit architecture with 440 interacting spins configured in a Chimera graph and occupying 0.44 mm² of silicon area. Area efficiency is achieved through a current-mode neuron update circuit and a mixed-signal design approach that integrates pitch-matched standard-cell analog blocks with digital logic and a shared power supply network. Device mismatch and process variations arising from this tightly coupled mixed-signal implementation are addressed using a hardware-aware contrastive divergence training framework. By incorporating non-ideal circuit behavior directly into the training loop, the system achieves reliable stochastic dynamics without requiring per-device calibration. Measurement results validate robust probabilistic operation across all spins. The chip is evaluated on probabilistic logic functions, including logic gates and full adders, and on combinatorial optimization problems such as Max-Cut. These results demonstrate that learning-enabled compensation of hardware non-idealities enables scalable probabilistic computing architectures. The proposed system demonstrates effective cross-layer co-design across circuit, architectural, and algorithmic levels, supporting emerging non-von Neumann computing paradigms.
- Open Access
- 8 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Generalized Probabilistic Approximate Optimization Algorithm
We introduce the generalized Probabilistic Approximate Optimization Algorithm (PAOA), a classical variational Monte Carlo framework that extends and formalizes the recently introduced PAOA, enabling parameterized and fast sampling on present-day Ising machines and probabilistic computers. PAOA operates by iteratively modifying the couplings of a network of binary stochastic units, guided by cost evaluations from independent samples. We establish a direct correspondence between derivative-free updates and the gradient of the full Markov flow over the exponentially large state space, showing that PAOA admits a principled variational formulation. Simulated annealing emerges as a limiting case under constrained parameterizations, and we implement this regime on an FPGA-based probabilistic computer with on-chip annealing to solve large 3D spin-glass problems. Benchmarking PAOA against QAOA on the canonical 26-spin Sherrington–Kirkpatrick model with matched parameters reveals superior performance for PAOA. We show that PAOA naturally extends simulated annealing by optimizing multiple temperature profiles, leading to improved performance over SA on heavy-tailed problems such as SK–Lévy.
- 8 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Open AccessGeneralized Probabilistic Approximate Optimization Algorithm
We introduce the generalized Probabilistic Approximate Optimization Algorithm (PAOA), a classical variational Monte Carlo framework that extends and formalizes the recently introduced PAOA, enabling parameterized and fast sampling on present-day Ising machines and probabilistic computers. PAOA operates by iteratively modifying the couplings of a network of binary stochastic units, guided by cost evaluations from independent samples. We establish a direct correspondence between derivative-free updates and the gradient of the full Markov flow over the exponentially large state space, showing that PAOA admits a principled variational formulation. Simulated annealing emerges as a limiting case under constrained parameterizations, and we implement this regime on an FPGA-based probabilistic computer with on-chip annealing to solve large 3D spin-glass problems. Benchmarking PAOA against QAOA on the canonical 26-spin Sherrington–Kirkpatrick model with matched parameters reveals superior performance for PAOA. We show that PAOA naturally extends simulated annealing by optimizing multiple temperature profiles, leading to improved performance over SA on heavy-tailed problems such as SK–Lévy.
- Open Access
- 16 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-10
Pushing the boundary of quantum advantage in hard combinatorial optimization with probabilistic computers
Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet their advantage for real-world problems remains an open question. Here, we show that probabilistic computers, co-designed with hardware to implement Monte Carlo algorithms, provide a scalable classical pathway for solving hard optimization problems. We focus on two algorithms applied to three-dimensional spin glasses: discrete-time simulated quantum annealing and adaptive parallel tempering. We benchmark these methods against a leading quantum annealer. For simulated quantum annealing, increasing replicas improves residual energy scaling, consistent with extreme value theory. Adaptive parallel tempering, supported by non-local isoenergetic cluster moves, scales more favorably and outperforms simulated quantum annealing. Field Programmable Gate Arrays or specialized chips can implement these algorithms in modern hardware, leveraging massive parallelism to accelerate them while improving energy efficiency. Our results establish a rigorous classical baseline for assessing practical quantum advantage and present probabilistic computers as a scalable platform for real-world optimization challenges.
- 16 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-10
Open AccessPushing the boundary of quantum advantage in hard combinatorial optimization with probabilistic computers
Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet their advantage for real-world problems remains an open question. Here, we show that probabilistic computers, co-designed with hardware to implement Monte Carlo algorithms, provide a scalable classical pathway for solving hard optimization problems. We focus on two algorithms applied to three-dimensional spin glasses: discrete-time simulated quantum annealing and adaptive parallel tempering. We benchmark these methods against a leading quantum annealer. For simulated quantum annealing, increasing replicas improves residual energy scaling, consistent with extreme value theory. Adaptive parallel tempering, supported by non-local isoenergetic cluster moves, scales more favorably and outperforms simulated quantum annealing. Field Programmable Gate Arrays or specialized chips can implement these algorithms in modern hardware, leveraging massive parallelism to accelerate them while improving energy efficiency. Our results establish a rigorous classical baseline for assessing practical quantum advantage and present probabilistic computers as a scalable platform for real-world optimization challenges.
- 2 July 2025
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 24 (1)
Scalable connectivity for Ising machines: Dense to sparse
- 2 July 2025
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 24 (1)
Scalable connectivity for Ising machines: Dense to sparse
- Open Access
- 22 January 2025
- Published by Springer Nature in Communications Physics
- Vol. 8 (1) , 1-11
Noise-augmented chaotic Ising machines for combinatorial optimization and sampling
Ising machines are hardware accelerators for combinatorial optimization and probabilistic sampling, using stochasticity to explore spin configurations and avoid local minima. We refine the previously proposed coupled chaotic bits (c-bits), which operate deterministically, by introducing noise. This improves performance in combinatorial optimization, achieving algorithmic scaling comparable to probabilistic bits (p-bits). We show that c-bits follow the quantum Boltzmann law in a 1D transverse field Ising model. Furthermore, c-bits exhibit critical dynamics similar to p-bits in 2D Ising and 3D spin glass models. Finally, we propose a noise-augmented c-bit approach via the adaptive parallel tempering algorithm (APT), which outperforms fully deterministic c-bits running simulated annealing. Analog Ising machines with coupled oscillators could draw inspiration from our approach, as running replicas at constant temperature eliminates the need for global modulation of coupling strengths. Ultimately, mixing stochasticity with deterministic c-bits yields a powerful hybrid computing scheme that can offer benefits in asynchronous, massively parallel hardware implementations.
- 22 January 2025
- Published by Springer Nature in Communications Physics
- Vol. 8 (1) , 1-11
Open AccessNoise-augmented chaotic Ising machines for combinatorial optimization and sampling
Ising machines are hardware accelerators for combinatorial optimization and probabilistic sampling, using stochasticity to explore spin configurations and avoid local minima. We refine the previously proposed coupled chaotic bits (c-bits), which operate deterministically, by introducing noise. This improves performance in combinatorial optimization, achieving algorithmic scaling comparable to probabilistic bits (p-bits). We show that c-bits follow the quantum Boltzmann law in a 1D transverse field Ising model. Furthermore, c-bits exhibit critical dynamics similar to p-bits in 2D Ising and 3D spin glass models. Finally, we propose a noise-augmented c-bit approach via the adaptive parallel tempering algorithm (APT), which outperforms fully deterministic c-bits running simulated annealing. Analog Ising machines with coupled oscillators could draw inspiration from our approach, as running replicas at constant temperature eliminates the need for global modulation of coupling strengths. Ultimately, mixing stochasticity with deterministic c-bits yields a powerful hybrid computing scheme that can offer benefits in asynchronous, massively parallel hardware implementations.
- Top Cited PapersOpen Access
- 17 October 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-11
All-to-all reconfigurability with sparse and higher-order Ising machines
Domain-specific hardware to solve computationally hard optimization problems has generated tremendous excitement. Here, we evaluate probabilistic bit (p-bit) based Ising Machines (IM) on the 3-Regular 3-Exclusive OR Satisfiability (3R3X), as a representative hard optimization problem. We first introduce a multiplexed architecture that emulates all-to-all network functionality while maintaining highly parallelized chromatic Gibbs sampling. We implement this architecture in a single Field-Programmable Gate Array (FPGA) and show that running the adaptive parallel tempering algorithm demonstrates competitive algorithmic and prefactor advantages over alternative IMs by D-Wave, Toshiba, and Fujitsu. We also implement higher-order interactions that lead to better prefactors without changing algorithmic scaling for the XORSAT problem. Even though FPGA implementations of p-bits are still not quite as fast as the best possible greedy algorithms accelerated on Graphics Processing Units (GPU), scaled magnetic versions of p-bit IMs could lead to orders of magnitude improvements over the state of the art for generic optimization.
- 17 October 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-11
Top Cited PapersOpen AccessAll-to-all reconfigurability with sparse and higher-order Ising machines
Domain-specific hardware to solve computationally hard optimization problems has generated tremendous excitement. Here, we evaluate probabilistic bit (p-bit) based Ising Machines (IM) on the 3-Regular 3-Exclusive OR Satisfiability (3R3X), as a representative hard optimization problem. We first introduce a multiplexed architecture that emulates all-to-all network functionality while maintaining highly parallelized chromatic Gibbs sampling. We implement this architecture in a single Field-Programmable Gate Array (FPGA) and show that running the adaptive parallel tempering algorithm demonstrates competitive algorithmic and prefactor advantages over alternative IMs by D-Wave, Toshiba, and Fujitsu. We also implement higher-order interactions that lead to better prefactors without changing algorithmic scaling for the XORSAT problem. Even though FPGA implementations of p-bits are still not quite as fast as the best possible greedy algorithms accelerated on Graphics Processing Units (GPU), scaled magnetic versions of p-bit IMs could lead to orders of magnitude improvements over the state of the art for generic optimization.
- Top Cited Papers
- 17 June 2024
- Published by Springer Nature in Nature Electronics
- Vol. 7 (7) , 610-619
Training deep Boltzmann networks with sparse Ising machines
- 17 June 2024
- Published by Springer Nature in Nature Electronics
- Vol. 7 (7) , 610-619
Top Cited PapersTraining deep Boltzmann networks with sparse Ising machines
- Open Access
Mean-Field Assisted Deep Boltzmann Learning with Probabilistic Computers
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 models of BMs with restricted intralayer connections or layer-by-layer training of deep BMs. Recent developments in domain-specific hardware -- specifically probabilistic computers (p-computer) with probabilistic bits (p-bit) -- may change established wisdom on the tractability of deep BMs. In this paper, we show that deep and unrestricted BMs can be trained using p-computers generating hundreds of billions of Markov Chain Monte Carlo (MCMC) samples per second, on sparse networks developed originally for use in D-Wave's annealers. To maximize the efficiency of learning the p-computer, we introduce two families of Mean-Field Theory assisted learning algorithms, or xMFTs (x = Naive and Hierarchical). The xMFTs are used to estimate the averages and correlations during the positive phase of the contrastive divergence (CD) algorithm and our custom-designed p-computer is used to estimate the averages and correlations in the negative phase. A custom Field-Programmable-Gate Array (FPGA) emulation of the p-computer architecture takes up to 45 billion flips per second, allowing the implementation of CD-$n$ where $n$ can be of the order of millions, unlike RBMs where $n$ is typically 1 or 2. Experiments on the full MNIST dataset with the combined algorithm show that the positive phase can be efficiently computed by xMFTs without much degradation when the negative phase is computed by the p-computer. Our algorithm can be used in other scalable Ising machines and its variants can be used to train BMs, previously thought to be intractable.Open AccessMean-Field Assisted Deep Boltzmann Learning with Probabilistic Computers
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 models of BMs with restricted intralayer connections or layer-by-layer training of deep BMs. Recent developments in domain-specific hardware -- specifically probabilistic computers (p-computer) with probabilistic bits (p-bit) -- may change established wisdom on the tractability of deep BMs. In this paper, we show that deep and unrestricted BMs can be trained using p-computers generating hundreds of billions of Markov Chain Monte Carlo (MCMC) samples per second, on sparse networks developed originally for use in D-Wave's annealers. To maximize the efficiency of learning the p-computer, we introduce two families of Mean-Field Theory assisted learning algorithms, or xMFTs (x = Naive and Hierarchical). The xMFTs are used to estimate the averages and correlations during the positive phase of the contrastive divergence (CD) algorithm and our custom-designed p-computer is used to estimate the averages and correlations in the negative phase. A custom Field-Programmable-Gate Array (FPGA) emulation of the p-computer architecture takes up to 45 billion flips per second, allowing the implementation of CD-$n$ where $n$ can be of the order of millions, unlike RBMs where $n$ is typically 1 or 2. Experiments on the full MNIST dataset with the combined algorithm show that the positive phase can be efficiently computed by xMFTs without much degradation when the negative phase is computed by the p-computer. Our algorithm can be used in other scalable Ising machines and its variants can be used to train BMs, previously thought to be intractable. - Open Access
Emulating Quantum Interference with Generalized Ising Machines
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 one of two values 0 and 1. The first $n$ p-bits represent the input qubits, while the other p-bits represent the qubits after the application of successive gating operations. We can view this structure as a Boltzmann machine whose states each represent a Feynman path leading from an initial configuration of qubits to a final configuration. Each such path has a complex amplitude $\psi$ which can be associated with a complex energy. The real part of this energy can be used to generate samples of Feynman paths in the usual way, while the imaginary part is accounted for by treating the samples as complex entities, unlike ordinary Boltzmann machines where samples are positive. Quantum gates often have purely imaginary energy functions for which all configurations have the same probability and one cannot take advantage of sampling techniques. However, if we can use suitable transformations to introduce a real part in the energy function then powerful sampling algorithms like Gibbs sampling can be harnessed to get acceptable results with far fewer samples and perhaps even escape the exponential scaling with $nd$. This algorithmic acceleration can then be supplemented with special-purpose hardware accelerators like Ising Machines which can obtain a very large number of samples per second through a combination of massive parallelism, pipelining, and clockless mixed-signal operation made possible by codesigning circuits and architectures to match the algorithm. Our results for mapping an arbitrary quantum circuit to a Boltzmann machine with a complex energy function should help push the boundaries of the simulability of quantum circuits with probabilistic resources and compare them with NISQ-era quantum computers.Open AccessEmulating Quantum Interference with Generalized Ising Machines
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 one of two values 0 and 1. The first $n$ p-bits represent the input qubits, while the other p-bits represent the qubits after the application of successive gating operations. We can view this structure as a Boltzmann machine whose states each represent a Feynman path leading from an initial configuration of qubits to a final configuration. Each such path has a complex amplitude $\psi$ which can be associated with a complex energy. The real part of this energy can be used to generate samples of Feynman paths in the usual way, while the imaginary part is accounted for by treating the samples as complex entities, unlike ordinary Boltzmann machines where samples are positive. Quantum gates often have purely imaginary energy functions for which all configurations have the same probability and one cannot take advantage of sampling techniques. However, if we can use suitable transformations to introduce a real part in the energy function then powerful sampling algorithms like Gibbs sampling can be harnessed to get acceptable results with far fewer samples and perhaps even escape the exponential scaling with $nd$. This algorithmic acceleration can then be supplemented with special-purpose hardware accelerators like Ising Machines which can obtain a very large number of samples per second through a combination of massive parallelism, pipelining, and clockless mixed-signal operation made possible by codesigning circuits and architectures to match the algorithm. Our results for mapping an arbitrary quantum circuit to a Boltzmann machine with a complex energy function should help push the boundaries of the simulability of quantum circuits with probabilistic resources and compare them with NISQ-era quantum computers.