4.7 Article

Multilevel Monte Carlo algorithm for quantum mechanics on a lattice

Journal

PHYSICAL REVIEW D
Volume 102, Issue 11, Pages -

Publisher

AMER PHYSICAL SOC
DOI: 10.1103/PhysRevD.102.114512

Keywords

-

Ask authors/readers for more resources

Monte Carlo simulations of quantum field theories on a lattice become increasingly expensive as the continuum limit is approached since the cost per independent sample grows with a high power of the inverse lattice spacing. Simulations on fine lattices suffer from critical slowdown, the rapid growth of autocorrelations in the Markov chain with decreasing lattice spacing a. This causes a strong increase in the number of lattice configurations that have to be generated to obtain statistically significant results. In this paper, hierarchical sampling methods to tame this growth in autocorrelations are discussed. Combined with multilevel variance reduction techniques, this significantly reduces the computational cost of simulations for given tolerances epsilon(disc) on the discretization error and epsilon(stat) on the statistical error. For an observable with lattice errors of order alpha and an integrated autocorrelation time that grows like tau(int) proportional to a(-z), multilevel Monte Carlo can reduce the cost from O(epsilon(-)(2)(stat)epsilon(-(1+z)/alpha)(disc)) to O(epsilon(-)(2)(stat)vertical bar log epsilon(disc)vertical bar(2) + epsilon(-1/alpha)(disc)) or O(epsilon(-)(2)(stat) + epsilon(-)(1/alpha)(disc)). Even higher performance gains are expected for nonperturbative simulations of quantum field theories in D-dimensions. The efficiency of the approach is demonstrated on two nontrivial model systems in quantum mechanics, including a topological oscillator that is badly affected by critical slowdown due to freezing of the topological charge. On fine lattices, the new methods are several orders of magnitude faster than standard, single-level sampling based on hybrid Monte Carlo. For high resolutions, multilevel Monte Carlo can be used to accelerate even the cluster algorithm for the topological oscillator. Performance is further improved through perturbative matching. This guarantees efficient coupling of theories on the multilevel lattice hierarchy, which have a natural interpretation in terms of effective theories obtained by renormalization group transformations.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available