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

Computers in Physics

Quantum Monte Carlo on a Lattice

Jan Tobochnik, G. G. Batrouni, Harvey Gould

Published Nov 1, 1992• 5 citations
Publisher
DOI
10.1063/1.4823122

Related papers

Quantum Monte Carlo for Lattice Fermions

Alejandro Muramatsu

Springer eBooks•Jan 1, 1999•7 citations

INVESTIGATIONS IN QUANTUM MONTE CARLO

Matthew Clifford Wilson

•Feb 2, 2007•0 citations

Load-balanced diffusion Monte Carlo method with lattice regularization

Kousuke Nakano, Sandro Sorella, Michele Casula

Ab initio quantum Monte Carlo (QMC) is a stochastic approach for solving the many-body Schrödinger equation without resorting to one-body approximations. QMC algorithms are readily parallelizable via ensembles of Nw walkers, making them well suited to large-scale high-performance computing. Among the QMC techniques, diffusion Monte Carlo (DMC) is widely regarded as the most reliable since it provides the projection onto the ground state of a given Hamiltonian under the fixed-node approximation. One practical realization of DMC is the lattice regularized diffusion Monte Carlo (LRDMC) method, which discretizes the Hamiltonian within the Green's function Monte Carlo framework. DMC methods-including LRDMC-employ the so-called branching technique to stabilize walker weights and populations. At the branching step, walkers must be synchronized globally; any imbalance in per-walker workload can leave central processing unit (CPU) or graphics processing unit (GPU) cores idle, thereby degrading overall hardware utilization. The conventional LRDMC algorithm intrinsically suffers from such load imbalance, which grows as log(Nw), rendering it less efficient on modern parallel architectures. In this work, we present an LRDMC algorithm that inherently addresses the load imbalance issue and achieves significantly improved weak-scaling parallel efficiency. Using the binding energy calculation of a water-methane complex as a test case, we demonstrated that the conventional and load-balanced LRDMC algorithms yield consistent results. Furthermore, by utilizing the Leonardo supercomputer equipped with NVIDIA A100 GPUs, we demonstrated that the load-balanced LRDMC algorithm can maintain extremely high parallel efficiency (∼98%) up to 512 GPUs (corresponding to Nw = 51 200), together with a speedup of ×1.24 if directly compared with the conventional LRDMC algorithm with the same number of walkers. The speedup stays sizable, i.e., × 1.18, even if the number of walkers is reduced to Nw = 400.

arXiv:2508.12033•The Journal of Chemical Physics•Nov 21, 2025•1 citation

Efficient continuous-time quantum Monte Carlo algorithm for fermionic lattice models

Mauro Iazzi, Matthias Troyer

Efficient continuous-time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state of the art for most discrete quantum models. They have not been widely used yet for fermionic quantum lattice models, such as the Hubbard model, nor other fermionic lattice systems due to a suboptimal scaling of $O({\ensuremath{\beta}}^{3})$ with inverse temperature $\ensuremath{\beta}$, compared to the linear scaling of discrete-time algorithms. Here we present a CT-QMC algorithm for fermionic lattice systems that matches the scaling of discrete-time methods but is more efficient and free of time discretization errors. This provides an efficient simulation scheme that is free from the systematic errors opening an avenue to more precise studies of large systems at low and zero temperature.

arXiv:1411.0683•Physical Review B•Jun 30, 2015•35 citations

METHODS IN QUANTUM MONTE CARLO

Malvin H. Kalos, G.A. Mikhailov

De Gruyter eBooks•Dec 31, 1987•0 citations

Quantum Monte Carlo Methods: Algorithms for Lattice Models

James E. Gubernatis, Naoki Kawashima, Philipp Werner

Featuring detailed explanations of the major algorithms used in quantum Monte Carlo simulations, this is the first textbook of its kind to provide a pedagogical overview of the field and its applications. The book provides a comprehensive introduction to the Monte Carlo method, its use, and its foundations, and examines algorithms for the simulation of quantum many-body lattice problems at finite and zero temperature. These algorithms include continuous-time loop and cluster algorithms for quantum spins, determinant methods for simulating fermions, power methods for computing ground and excited states, and the variational Monte Carlo method. Also discussed are continuous-time algorithms for quantum impurity models and their use within dynamical mean-field theory, along with algorithms for analytically continuing imaginary-time quantum Monte Carlo data. The parallelization of Monte Carlo simulations is also addressed. This is an essential resource for graduate students, teachers, and researchers interested in quantum Monte Carlo techniques.

Cambridge University Press eBooks•Jan 31, 2016•237 citations
Ab initio quantum Monte Carlo (QMC) is a stochastic approach for solving the many-body Schrödinger equation without resorting to one-body approximations. QMC algorithms are readily parallelizable via ensembles of Nw walkers, making them well suited to large-scale high-performance computing. Among the QMC techniques, diffusion Monte Carlo (DMC) is widely regarded as the most reliable since it provides the projection onto the ground state of a given Hamiltonian under the fixed-node approximation. One practical realization of DMC is the lattice regularized diffusion Monte Carlo (LRDMC) method, which discretizes the Hamiltonian within the Green's function Monte Carlo framework. DMC methods-including LRDMC-employ the so-called branching technique to stabilize walker weights and populations. At the branching step, walkers must be synchronized globally; any imbalance in per-walker workload can leave central processing unit (CPU) or graphics processing unit (GPU) cores idle, thereby degrading overall hardware utilization. The conventional LRDMC algorithm intrinsically suffers from such load imbalance, which grows as log(Nw), rendering it less efficient on modern parallel architectures. In this work, we present an LRDMC algorithm that inherently addresses the load imbalance issue and achieves significantly improved weak-scaling parallel efficiency. Using the binding energy calculation of a water-methane complex as a test case, we demonstrated that the conventional and load-balanced LRDMC algorithms yield consistent results. Furthermore, by utilizing the Leonardo supercomputer equipped with NVIDIA A100 GPUs, we demonstrated that the load-balanced LRDMC algorithm can maintain extremely high parallel efficiency (∼98%) up to 512 GPUs (corresponding to Nw = 51 200), together with a speedup of ×1.24 if directly compared with the conventional LRDMC algorithm with the same number of walkers. The speedup stays sizable, i.e., × 1.18, even if the number of walkers is reduced to Nw = 400.
Efficient continuous-time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state of the art for most discrete quantum models. They have not been widely used yet for fermionic quantum lattice models, such as the Hubbard model, nor other fermionic lattice systems due to a suboptimal scaling of $O({\ensuremath{\beta}}^{3})$ with inverse temperature $\ensuremath{\beta}$, compared to the linear scaling of discrete-time algorithms. Here we present a CT-QMC algorithm for fermionic lattice systems that matches the scaling of discrete-time methods but is more efficient and free of time discretization errors. This provides an efficient simulation scheme that is free from the systematic errors opening an avenue to more precise studies of large systems at low and zero temperature.
Featuring detailed explanations of the major algorithms used in quantum Monte Carlo simulations, this is the first textbook of its kind to provide a pedagogical overview of the field and its applications. The book provides a comprehensive introduction to the Monte Carlo method, its use, and its foundations, and examines algorithms for the simulation of quantum many-body lattice problems at finite and zero temperature. These algorithms include continuous-time loop and cluster algorithms for quantum spins, determinant methods for simulating fermions, power methods for computing ground and excited states, and the variational Monte Carlo method. Also discussed are continuous-time algorithms for quantum impurity models and their use within dynamical mean-field theory, along with algorithms for analytically continuing imaginary-time quantum Monte Carlo data. The parallelization of Monte Carlo simulations is also addressed. This is an essential resource for graduate students, teachers, and researchers interested in quantum Monte Carlo techniques.