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

Computer Physics Communications

Quantum Monte Carlo on graphical processing units

Amos G. Anderson, William A. Goddard, Peter Schröder

Published Apr 2, 2007• 109 citations
Publisher
DOI
10.1016/j.cpc.2007.03.004

Related papers

Graphics Processing Unit Accelerated Hirsch-Fye Quantum Monte Carlo

Conrad Moore, Sameer Abu Asal, Kaushik Rajagoplan +7 more

Bulletin of the American Physical Society•Mar 1, 2012•0 citations

Quantum Chemistry on Graphics Processing Units

Andreas W. Götz, Thorsten Wölfle, Ross C. Walker

Annual reports in computational chemistry•Jan 1, 2010•38 citations

Counting defects in quantum computers with Graphics Processing Units

Bartłomiej Gardas, Andrzej Ptok

Journal of Computational Physics•Apr 9, 2018•2 citations

Accelerating Quantum Monte Carlo via Graphics Processing Units

Benjamin Himberg, Adrian Del Maestro

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.

Bulletin of the American Physical Society•Mar 5, 2018•0 citations

Quantum Monte Carlo simulations

Hyeonseong Jung, Shiho Kim

Advances in computers•Aug 18, 2025•0 citations

Graphical Processing Units for Quantum Chemistry

Todd J. Martı́nez

Bulletin of the American Physical Society•Mar 22, 2011•0 citations
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.