Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Accelerating Quantum Monte Carlo via Graphics Processing Units

Benjamin Himberg, Adrian Del Maestro

Published Mar 5, 2018• 0 citations
OpenAlex

Abstract

An exact quantum Monte Carlo algorithm for interacting particles in the spatial continuum is extended to exploit the massive parallelism offered by graphics processing units. Its efficacy is tested on the Calogero-Sutherland model describing a system of bosons interacting in one spatial dimension via an inverse square law. Due to the long range nature of the interactions, this model has proved difficult to simulate via conventional path integral Monte Carlo methods running on conventional processors. Using Graphics Processing Units, optimal speedup factors of up to 640 times are obtained for N = 126 particles. The known results for the ground state energy are confirmed and, for the first time, the effects of thermal fluctuations at finite temperature are explored.

Related papers

GPU-based Implementation of the Variational Path Integral Method

Shanthan Mudhasani

Any system in the world is comprised of particles like electrons. To analyze the behaviors of these systems the behavior of these particles must be predicted. The ground state energy of a molecule is important information about a molecule and can be calculated by solving the Schrodinger equation. As the number of atoms increase, the number of variables (coordinates of each atom) that the equation represents increases by three times. Due to the large state space and the nonlinear nature of the Schrodinger equation, it is very difficult to solve this equation. Quantum Monte Carlo (QMC) is a very efficient method to solve the Schrodinger equation for accurate results. This method uses random numbers to sample the complex equation and get very accurate results. Due to the large data involved in this method, it exhibits a rich amount of data parallelism. Variational path integral (VPI) simulations are a class of QMC methods that permit direct computation of expectation values of coordinate-space observables for the nodeless ground states of many-body quantum systems. The high degree of data parallelism involved in this method facilitates the use of Graphical Processing Units (GPUs), a powerful type of processor well known to computer gamers. In

•Jan 1, 2011•1 citation

Path-integral Monte Carlo method for Rényi entanglement entropies

C. M. Herdman, Stephen Inglis, Pierre–Nicholas Roy +2 more

We introduce a quantum Monte Carlo algorithm to measure the Rényi entanglement entropies in systems of interacting bosons in the continuum. This approach is based on a path-integral ground state method that can be applied to interacting itinerant bosons in any spatial dimension with direct relevance to experimental systems of quantum fluids. We demonstrate how it may be used to compute spatial mode entanglement, particle partitioned entanglement, and the entanglement of particles, providing insights into quantum correlations generated by fluctuations, indistinguishability, and interactions. We present proof-of-principle calculations and benchmark against an exactly soluble model of interacting bosons in one spatial dimension. As this algorithm retains the fundamental polynomial scaling of quantum Monte Carlo when applied to sign-problem-free models, future applications should allow for the study of entanglement entropy in large-scale many-body systems of interacting bosons.

arXiv:1404.7104•Physical Review E•Jul 25, 2014•46 citations

Quantum simulations with graphics processing units

Steven Gregory Smith

This document aims to describe the methodology of quantum lattice gas algorithm based quantum physics simulations with details on implementation using graphics processing units. A variety of examples illustrating the general application of these methods are included. These examples are used to highlight topics such as scaling, potentials, momentums, multiple particle and dimensions, and various Hamiltonians in quantum simulations. Although intended to fullfill the doctor of philosophy degree requirement, this document is well suited as an introduction to this approach to modeling physics. In recent times parallelization has significantly improved the available computational power. Graphics processing units (GPUs) are a shining example of this, with thousands of compute cores and continually improved general computational capabilities, these processors can outshine their central processing unit (CPU) counterparts by orders of magnitude. Presented here are a number of examples of efficient computational methods for simulating physics using GPUs. Our quantum simulation method involves the quantum lattice gas model of quantum computation [59, 68, 64], however much of the parallel technology implementation is applicable to other numerical approaches. The quantum lattice gas model of computation is based on a unitary stream-collide quantum algorithm applied repeatedly over time upon an ordered array of qubits [53, 56, 68, 61, 63, 67]. The stream-collide quantum algorithm represents local quantum evolution of the system of quantum particles whose motion is constrained to reside on a spacetime lattice. Each particle in the system undergoes a quantum walk, interacting locally with other particles in the system that may reside on the same point. We will first mathematically describe the basic idea of quantum lattice gas algorithms. Next we will discuss GPUs and the basic features needed for implementation. We will then describe several examples of quantum lattice gas algorithm approach to illustrate the various applications and implementation challenges. Of particular interest is a look at modeling time-dependent many-body quantum mechanics using quantum lattice gas methods. For practical purposes we focus on the case of two fermions governed by the nonrelativistic Schrödinger equation. Numerical comparisons to analytic prediction show the high accuracy of these methods. Quantum lattice gas methods are chosen as a unitary algorithm for time dependent quantum simulation as they are efficient, accurate, and avoid the Fermi sign problem. Our findings from two-particle simulations under various conditions include the physics of the one and two particle systems diverging in their respective time-dependent behavior with increasing entanglement. We also confirm the multiple particle extension of the Ehrenfest theorem. Using the examples discussed throughout this document, we will then describe our specific computational implementation utilizing the computational power of GPUs through Nvidia’s compute unified device architecture (CUDA) language. Here we will discuss the open source software our group is developing based on these methods, along with some implementation verification and debugging concepts. Education is another application peripherally connected to this work and our software. The applications of this type of modeling as a learning tool is not fully explored yet, but the opportunities are promising.

•Jan 1, 2020•0 citations

Many-body computing on Field Programmable Gate Arrays

Songtai Lv, Yang Liang, Yuchen Meng +5 more

Improving many-body computational efficiency is crucial for exploring condensed matter systems. However, existing acceleration methods are limited and mostly based on von Neumann-like architectures. Here we leverage the capabilities of Field Programmable Gate Arrays for conducting quantum many-body calculations and realize a tenfold speedup over Central Processing Unit-based computation for a Monte Carlo algorithm. By using a supercell structure and simulating the hardware architecture with High-Level Synthesis, we achieve $$O(1)$$ scaling for the time of one sweep, regardless of the overall system size. We also demonstrate the utilization of programmable hardware to accelerate a typical tensor network algorithm for ground-state calculations. Additionally, we show that the current hardware computing acceleration is on par with that of multi-threaded Graphics Processing Unit parallel processing. Our findings highlight the advantages of hardware implementation and pave the way for efficient many-body computations. This work leverages the capabilities of Field Programmable Gate Arrays (FPGAs) for quantum many-body calculations. By designing appropriate schemes for Monte Carlo and tensor network methods, the authors utilize FPGAs’ parallel processing power and implement hardware acceleration for two algorithms.

arXiv:2402.06415•Communications Physics•Mar 25, 2025•4 citations

Continuous-Time Quantum Monte Carlo Algorithm for the Lattice Polaron

P. E. Kornilovitch

An efficient continuous-time path-integral quantum Monte Carlo algorithm for the lattice polaron is presented. It is based on Feynman's integration of phonons and subsequent simulation of the resulting single-particle self-interacting system. The method is free from the finite-size and finite-time-step errors and works in any dimensionality and for any range of electron-phonon interaction. The ground-state energy and effective mass of the polaron are calculated for several models. The polaron spectrum can be measured directly by Monte Carlo, which is of general interest.

arXiv:cond-mat/9808155•Physical Review Letters•Dec 14, 1998•140 citations

Architectural Comparisons for a Quantum Monte Carlo Application

Akila Gothandaraman, Rick Weber, Gregory D. Peterson +2 more

Recent technological advances have led to a number of emerging platforms such as multi-cores, reconfigurable computing, and graphics processing units. We present a comparative study of multi-cores, field-programmable gate arrays, and graphics processing units for a Quantum Monte Carlo chemistry application. The speedups of these implementations are measured relative to a multi-core implementation and the accuracy of each implementation compared against the double-precision CPU implementation. The Brook+ AMD implementation shows the best overall speedup and accuracy, with the mixed-precision NVIDIA CUDA implementation outperforming the Brook+ implementation for larger atomic clusters with a slightly lower accuracy than the Brook+ and FPGA implementations. KeywordsQuantum Monte Carlo, Field-Programmable Gate Arrays, Multi-core processors, Graphics Processing Units.

•Jan 1, 2011•1 citation
An exact quantum Monte Carlo algorithm for interacting particles in the spatial continuum is extended to exploit the massive parallelism offered by graphics processing units. Its efficacy is tested on the Calogero-Sutherland model describing a system of bosons interacting in one spatial dimension via an inverse square law. Due to the long range nature of the interactions, this model has proved difficult to simulate via conventional path integral Monte Carlo methods running on conventional processors. Using Graphics Processing Units, optimal speedup factors of up to 640 times are obtained for N = 126 particles. The known results for the ground state energy are confirmed and, for the first time, the effects of thermal fluctuations at finite temperature are explored.
Any system in the world is comprised of particles like electrons. To analyze the behaviors of these systems the behavior of these particles must be predicted. The ground state energy of a molecule is important information about a molecule and can be calculated by solving the Schrodinger equation. As the number of atoms increase, the number of variables (coordinates of each atom) that the equation represents increases by three times. Due to the large state space and the nonlinear nature of the Schrodinger equation, it is very difficult to solve this equation. Quantum Monte Carlo (QMC) is a very efficient method to solve the Schrodinger equation for accurate results. This method uses random numbers to sample the complex equation and get very accurate results. Due to the large data involved in this method, it exhibits a rich amount of data parallelism. Variational path integral (VPI) simulations are a class of QMC methods that permit direct computation of expectation values of coordinate-space observables for the nodeless ground states of many-body quantum systems. The high degree of data parallelism involved in this method facilitates the use of Graphical Processing Units (GPUs), a powerful type of processor well known to computer gamers. In
We introduce a quantum Monte Carlo algorithm to measure the Rényi entanglement entropies in systems of interacting bosons in the continuum. This approach is based on a path-integral ground state method that can be applied to interacting itinerant bosons in any spatial dimension with direct relevance to experimental systems of quantum fluids. We demonstrate how it may be used to compute spatial mode entanglement, particle partitioned entanglement, and the entanglement of particles, providing insights into quantum correlations generated by fluctuations, indistinguishability, and interactions. We present proof-of-principle calculations and benchmark against an exactly soluble model of interacting bosons in one spatial dimension. As this algorithm retains the fundamental polynomial scaling of quantum Monte Carlo when applied to sign-problem-free models, future applications should allow for the study of entanglement entropy in large-scale many-body systems of interacting bosons.
This document aims to describe the methodology of quantum lattice gas algorithm based quantum physics simulations with details on implementation using graphics processing units. A variety of examples illustrating the general application of these methods are included. These examples are used to highlight topics such as scaling, potentials, momentums, multiple particle and dimensions, and various Hamiltonians in quantum simulations. Although intended to fullfill the doctor of philosophy degree requirement, this document is well suited as an introduction to this approach to modeling physics. In recent times parallelization has significantly improved the available computational power. Graphics processing units (GPUs) are a shining example of this, with thousands of compute cores and continually improved general computational capabilities, these processors can outshine their central processing unit (CPU) counterparts by orders of magnitude. Presented here are a number of examples of efficient computational methods for simulating physics using GPUs. Our quantum simulation method involves the quantum lattice gas model of quantum computation [59, 68, 64], however much of the parallel technology implementation is applicable to other numerical approaches. The quantum lattice gas model of computation is based on a unitary stream-collide quantum algorithm applied repeatedly over time upon an ordered array of qubits [53, 56, 68, 61, 63, 67]. The stream-collide quantum algorithm represents local quantum evolution of the system of quantum particles whose motion is constrained to reside on a spacetime lattice. Each particle in the system undergoes a quantum walk, interacting locally with other particles in the system that may reside on the same point. We will first mathematically describe the basic idea of quantum lattice gas algorithms. Next we will discuss GPUs and the basic features needed for implementation. We will then describe several examples of quantum lattice gas algorithm approach to illustrate the various applications and implementation challenges. Of particular interest is a look at modeling time-dependent many-body quantum mechanics using quantum lattice gas methods. For practical purposes we focus on the case of two fermions governed by the nonrelativistic Schrödinger equation. Numerical comparisons to analytic prediction show the high accuracy of these methods. Quantum lattice gas methods are chosen as a unitary algorithm for time dependent quantum simulation as they are efficient, accurate, and avoid the Fermi sign problem. Our findings from two-particle simulations under various conditions include the physics of the one and two particle systems diverging in their respective time-dependent behavior with increasing entanglement. We also confirm the multiple particle extension of the Ehrenfest theorem. Using the examples discussed throughout this document, we will then describe our specific computational implementation utilizing the computational power of GPUs through Nvidia’s compute unified device architecture (CUDA) language. Here we will discuss the open source software our group is developing based on these methods, along with some implementation verification and debugging concepts. Education is another application peripherally connected to this work and our software. The applications of this type of modeling as a learning tool is not fully explored yet, but the opportunities are promising.
Improving many-body computational efficiency is crucial for exploring condensed matter systems. However, existing acceleration methods are limited and mostly based on von Neumann-like architectures. Here we leverage the capabilities of Field Programmable Gate Arrays for conducting quantum many-body calculations and realize a tenfold speedup over Central Processing Unit-based computation for a Monte Carlo algorithm. By using a supercell structure and simulating the hardware architecture with High-Level Synthesis, we achieve O(1)O(1)O(1) scaling for the time of one sweep, regardless of the overall system size. We also demonstrate the utilization of programmable hardware to accelerate a typical tensor network algorithm for ground-state calculations. Additionally, we show that the current hardware computing acceleration is on par with that of multi-threaded Graphics Processing Unit parallel processing. Our findings highlight the advantages of hardware implementation and pave the way for efficient many-body computations. This work leverages the capabilities of Field Programmable Gate Arrays (FPGAs) for quantum many-body calculations. By designing appropriate schemes for Monte Carlo and tensor network methods, the authors utilize FPGAs’ parallel processing power and implement hardware acceleration for two algorithms.
An efficient continuous-time path-integral quantum Monte Carlo algorithm for the lattice polaron is presented. It is based on Feynman's integration of phonons and subsequent simulation of the resulting single-particle self-interacting system. The method is free from the finite-size and finite-time-step errors and works in any dimensionality and for any range of electron-phonon interaction. The ground-state energy and effective mass of the polaron are calculated for several models. The polaron spectrum can be measured directly by Monte Carlo, which is of general interest.
Recent technological advances have led to a number of emerging platforms such as multi-cores, reconfigurable computing, and graphics processing units. We present a comparative study of multi-cores, field-programmable gate arrays, and graphics processing units for a Quantum Monte Carlo chemistry application. The speedups of these implementations are measured relative to a multi-core implementation and the accuracy of each implementation compared against the double-precision CPU implementation. The Brook+ AMD implementation shows the best overall speedup and accuracy, with the mixed-precision NVIDIA CUDA implementation outperforming the Brook+ implementation for larger atomic clusters with a slightly lower accuracy than the Brook+ and FPGA implementations. KeywordsQuantum Monte Carlo, Field-Programmable Gate Arrays, Multi-core processors, Graphics Processing Units.