Accelerated quantum Monte Carlo with probabilistic computers
In this paper, we provide a benchmark study of probabilistic computing to emulate quantum systems.
Postdoctoral Scholar
Harold Frank Hall
University of California Santa Barbara
Santa Barbara, CA 93106, USA
schowdhury@ucsb.edu
Hello! Thank you for visiting my page. Currently, I am working as a postdoctoral scholar with Kerem Y. Camsari at OPUS lab in the University of California, Santa Barabara, CA, USA. Here, I have been primarily working on the hardware acceleration of the machine learning of classical and quantum many-body sytems with probabilistic bits (p-bits). p-bits are classical and robust entities that continously fluctuates between two logic states. This fluctuation can also be tuned via an external input signal. p-bits are room-temperature operable and can be manufactured with some simple modifications of existing fabrication technologies. My research interest includes probabilistic and quantum computing, modeling nanoscale devices, and machine learning. I am an active member of IEEE.
I received my Ph.D. from the Elmore Family School of Electrical and Computer Engineering of Purdue University. Under the supervision of Supriyo Datta, my Ph.D. work focused on quantum emulation with probabilistic computers. Our approach was inspried from Feynman's observation:
"The only difference between a probabilistic classical world and the equations of the quantum world is that somehow or other it appears as if the probabilities would have to go negative ... "
Quantum computation in principle should be able to take advantag by manipulating this negative probability intelligently but as of today, the practical quantum computing still remains elusive.
In this paper, we provide a benchmark study of probabilistic computing to emulate quantum systems.
In this paper, we offer a general and exact mapping of quantum circuits into probabilistic computers.
Here we offer a full-stack view of probabilistic computing.
In this work, we propose a p-bit based hardware accelerator for quantum Monte Carlo (QMC).
Here in this work, we discuss a probabilistic approach to quantum inspired algorithms. (QMC).