Papers › Multilevel Monte Carlo for quantum mechanics on a lattice
Multilevel Monte Carlo for quantum mechanics on a lattice
Karl Jansen, Eike Hermann Müller, Robert Scheichl
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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. This causes a strong increase in the number of lattice configurations that have to be generated to obtain statistically significant results. This paper discusses hierarchical sampling methods to tame the growth in autocorrelations. Combined with multilevel variance reduction, this significantly reduces the computational cost of simulations for given tolerances ϵ_(disc) on the discretisation error and ϵₛₜₐₜ on the statistical error. For observables with lattice errors of order α and integrated autocorrelation times that grow like τᵢₙₜ∝a⁻ᶻ, multilevel Monte Carlo (MLMC) reduces the cost from 𝒪(ϵₛₜₐₜ⁻²ϵ_(disc)^(-(1+z)/α)) to 𝒪(ϵₛₜₐₜ⁻²|logϵ_(disc) |²+ϵ_(disc)^(-1/α)) or 𝒪(ϵₛₜₐₜ⁻²+ϵ_(disc)^(-1/α)). Higher gains are expected for simulations of quantum field theories in D dimensions. The efficiency of the approach is demonstrated on two model systems, including a topological oscillator that is badly affected by critical slowdown from topological charge freezing. On fine lattices, the new methods are orders of magnitude faster than standard Hybrid Monte Carlo sampling. For high resolutions, MLMC can be used to accelerate even the cluster algorithm for the topological oscillator. Performance is further improved through perturbative matching which guarantees efficient coupling of theories on the multilevel hierarchy.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections