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

arXiv:cond-mat/0402181 · The Journal of Physical Chemistry B

A Multigrid Algorithm for Sampling Imaginary-Time Paths in Quantum Monte Carlo Simulations

Chi H. Mak, S. P. Zakharov

Published Feb 17, 2004• 6 citations
arXivHTMLPDF

Abstract

We describe a novel simulation method that eliminates the slowing-down problem in the Monte Carlo (MC) simulations of imaginary-time path integrals near the continuum limit. This method combines a stochastic blocking procedure with the multigrid method to rapidly accelerate the sampling of paths in a quantum MC simulation, making its dynamics more ergodic. The effectiveness and efficiency of this method are demonstrated for several one-dimensional quantum systems and compared to other standard and accelerated methods.

DOI
10.1021/jp0371027

Related papers

Multigrid Monte Carlo Simulations

Fung-kiu Chow, P. Kevin MacKeown

With a view to eventually studying quantum effects in the thermal behaviour of Lennard-Jones clusters, we investigate the extent to which the limitations of quasi-ergodicity and critical slowing down can be overcome in the evaluation of imaginary time path integrals using the Multigrid method. We show the power of the method by looking at the correlation times for a 2 Ar atom Lennard Jones cluster along the lines described in Janke & Sauer's paper.1)

Progress of Theoretical Physics Supplement•Jan 1, 2000•0 citations

Metropolis Methods for Quantum Monte Carlo Simulations

David M. Ceperley

Since its first description fifty years ago, the Metropolis Monte Carlo method has been used in a variety of different ways for the simulation of continuum quantum many‐body systems. This paper will consider some of the generalizations of the Metropolis algorithm employed in quantum Monte Carlo: Variational Monte Carlo, dynamical methods for projector monte carlo (i.e. diffusion Monte Carlo with rejection), multilevel sampling in path integral Monte Carlo, the sampling of permutations, cluster methods for lattice models, the penalty method for coupled electron‐ionic systems and the Bayesian analysis of imaginary time correlation functions.

arXiv:physics/0306182•AIP conference proceedings•Jan 1, 2003•23 citations

Faster Quantum Monte Carlo Simulation by Random Compilation

John M. Martyn, Joshua Lin, Neill C. Warrington +2 more

Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.

quant-pharXiv:2609.10486•Sep 10, 2026•1 citation

Multiscale Monte Carlo Algorithms in Statistical Mechanics and Quantum Field Theory

P.G. Lauwers

Conventional Monte Carlo simulation algorithms for models in statistical mechanics and quantum field theory are afflicted by problems caused by their locality. They become highly inefficient if investigations of critical or nearly-critical systems, i.e., systems with important large scale phenomena, are undertaken. We present two types of multiscale approaches that alleveate problems of this kind: stochastic cluster algorithms and multigrid Monte Carlo simulation algorithms. Another formidable computational problem in simulations of phenomenologically relevant field theories with fermions is the need for frequently inverting the Dirac operator. This inversion can be accelerated considerably by means of deterministic multigrid methods, very similar to the ones used for the numerical solution of differential equations. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Basel eBooks•Jan 1, 1991•1 citation

Simulating Stochastic Diffusions by Quantum Walks

Yan Wang

Stochastic differential equation (SDE) and Fokker-Planck equation (FPE) are two general approaches to describe the stochastic drift-diffusion processes. Solving SDEs relies on the Monte Carlo samplings of individual system trajectory, whereas FPEs describe the time evolution of overall distributions via path integral alike methods. The large state space and required small step size are the major challenges of computational efficiency in solving FPE numerically. In this paper, a generic continuous-time quantum walk formulation is developed to simulate stochastic diffusion processes. Stochastic diffusion in one-dimensional state space is modeled as the dynamics of an imaginary-time quantum system. The proposed quantum computational approach also drastically accelerates the path integrals with large step sizes. The new approach is compared with the traditional path integral method and the Monte Carlo trajectory sampling.

ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (IDETC/CIE)•Aug 4, 2013•6 citations

Simulations without critical slowing down

Daniel Kandel, Eytan Domany, Dorit Ron +2 more

We have developed a novel simulation method that combines a multigrid technique with a stochastic blocking procedure. Our algorithm eliminates critical slowing down completely, as demonstrated by simulations of the two-dimensional Ising model at criticality.

Physical Review Letters•Apr 18, 1988•97 citations
We describe a novel simulation method that eliminates the slowing-down problem in the Monte Carlo (MC) simulations of imaginary-time path integrals near the continuum limit. This method combines a stochastic blocking procedure with the multigrid method to rapidly accelerate the sampling of paths in a quantum MC simulation, making its dynamics more ergodic. The effectiveness and efficiency of this method are demonstrated for several one-dimensional quantum systems and compared to other standard and accelerated methods.
Since its first description fifty years ago, the Metropolis Monte Carlo method has been used in a variety of different ways for the simulation of continuum quantum many‐body systems. This paper will consider some of the generalizations of the Metropolis algorithm employed in quantum Monte Carlo: Variational Monte Carlo, dynamical methods for projector monte carlo (i.e. diffusion Monte Carlo with rejection), multilevel sampling in path integral Monte Carlo, the sampling of permutations, cluster methods for lattice models, the penalty method for coupled electron‐ionic systems and the Bayesian analysis of imaginary time correlation functions.
Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.
Conventional Monte Carlo simulation algorithms for models in statistical mechanics and quantum field theory are afflicted by problems caused by their locality. They become highly inefficient if investigations of critical or nearly-critical systems, i.e., systems with important large scale phenomena, are undertaken. We present two types of multiscale approaches that alleveate problems of this kind: stochastic cluster algorithms and multigrid Monte Carlo simulation algorithms. Another formidable computational problem in simulations of phenomenologically relevant field theories with fermions is the need for frequently inverting the Dirac operator. This inversion can be accelerated considerably by means of deterministic multigrid methods, very similar to the ones used for the numerical solution of differential equations. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Stochastic differential equation (SDE) and Fokker-Planck equation (FPE) are two general approaches to describe the stochastic drift-diffusion processes. Solving SDEs relies on the Monte Carlo samplings of individual system trajectory, whereas FPEs describe the time evolution of overall distributions via path integral alike methods. The large state space and required small step size are the major challenges of computational efficiency in solving FPE numerically. In this paper, a generic continuous-time quantum walk formulation is developed to simulate stochastic diffusion processes. Stochastic diffusion in one-dimensional state space is modeled as the dynamics of an imaginary-time quantum system. The proposed quantum computational approach also drastically accelerates the path integrals with large step sizes. The new approach is compared with the traditional path integral method and the Monte Carlo trajectory sampling.