Scalable Emulation of Sign-Problem$-$Free Hamiltonians with Room Temperature p-bits

Abstract

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 realization along with challenging coherent coupling techniques for entangling them. By contrast, a probabilistic bit or a p-bit is a robust classical entity that fluctuates between 0 and 1, and can be implemented at room temperature using present-day technology. Here, we show that a probabilistic coprocessor built out of room temperature p-bits can be used to accelerate simulations of a special class of quantum many-body systems that are sign-problem$-$free or stoquastic, leveraging the well-known Suzuki-Trotter decomposition that maps a $d$-dimensional quantum many body Hamiltonian to a $d$+1-dimensional classical Hamiltonian. This mapping allows an efficient emulation of a quantum system by classical computers and is commonly used in software to perform Quantum Monte Carlo (QMC) algorithms. By contrast, we show that a compact, embedded MTJ-based coprocessor can serve as a highly efficient hardware-accelerator for such QMC algorithms providing several orders of magnitude improvement in speed compared to optimized CPU implementations. Using realistic device-level SPICE simulations we demonstrate that the correct quantum correlations can be obtained using a classical p-circuit built with existing technology and operating at room temperature. The proposed coprocessor can serve as a tool to study stoquastic quantum many-body systems, overcoming challenges associated with physical quantum annealers.

arXiv commentFixed minor typos and expanded Appendix

References in corpus (32)

• Ising formulations of many NP problems
• Quantum Annealing in the Transverse Ising Model
• Adiabatic Quantum Computing
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Quantum annealing with more than one hundred qubits
• Theory of Quantum Annealing of an Ising Spin Glass
• Measurement of the Spin-Transfer-Torque Vector in Magnetic Tunnel Junctions
• Thermally assisted magnetization reversal in the presence of a spin-transfer torque
• Stochastic p-bits for Invertible Logic
• Quantum Boltzmann Machine
• What is the Computational Value of Finite Range Tunneling?
• Intrinsic optimization using stochastic nanomagnets
• Quantum annealing of the Traveling Salesman Problem
• Demonstration of a scaling advantage for a quantum annealer over simulated annealing
• Quantum versus Classical Annealing of Ising Spin Glasses
• A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
• Simple universal models capture all classical spin physics
• Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
• Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
• Hardware emulation of stochastic p-bits for invertible logic
• Low Barrier Nanomagnets as p-bits for Spin Logic
• Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines
• Large-angle, gigahertz-rate random telegraph switching induced by spin-momentum transfer
• Implementing Bayesian Networks with Embedded Stochastic MRAM
• Efficient CMOS Invertible Logic Using Stochastic Computing
• Low Barrier Magnet Design for Efficient Hardware Binary Stochastic Neurons
• Efficiency of quantum versus classical annealing in non-convex learning problems
• Temperature scaling law for quantum annealing optimizers
• A building block for hardware belief networks
• Composable Probabilistic Inference Networks Using MRAM-based Stochastic Neurons
• Modular Compact Modeling of Magnetic Tunnel Junction Devices
• Parallel Tempering Simulation of the three-dimensional Edwards-Anderson Model with Compact Asynchronous Multispin Coding on GPU

Cited by in corpus (22)

• The promise of spintronics for unconventional computing
• A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms
• Probabilistic computing with p-bits
• Autonomous Probabilistic Coprocessing with Petaflips per Second
• Subnanosecond Fluctuations in Low-Barrier Nanomagnets
• Accelerated Quantum Monte Carlo with Probabilistic Computers
• Hardware Design for Autonomous Bayesian Networks
• Probabilistic-Bits based on Ferroelectric Field-Effect Transistors for Stochastic Computing
• Probabilistic Circuits for Autonomous Learning: A simulation study
• Lanthanide molecular nanomagnets as probabilistic bits
• Double-Free-Layer Stochastic Magnetic Tunnel Junctions with Synthetic Antiferromagnets
• Noise-augmented Chaotic Ising Machines for Combinatorial Optimization and Sampling
• Scalable Connectivity for Ising Machines: Dense to Sparse
• Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers
• Emulating Quantum Interference with Generalized Ising Machines
• Nonvolatile bistable memory and Ising machine based on Micro-Electro-Mechanical Systems
• Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
• Electrically Tunable Picosecond-scale Octupole Fluctuations in Chiral Antiferromagnets
• Superparamagnetic and Stochastic-Write Magnetic Tunnel Junctions for High-Speed True Random Number Generation in Advanced Computing
• Sub-universal variational circuits for combinatorial optimization problems
• Metrics for spin-based computing
• Building Reservoir Computing Hardware Using Low Energy-Barrier Magnetics