The fast sampling algorithm for Lie-Trotter products
Abstract
A fast algorithm for path sampling in path integral Monte Carlo simulations is proposed. The algorithm utilizes the Levy-Ciesielski implementation of Lie-Trotter products to achieve a mathematically proven computational cost of n*log2(n) with the number of time slices n, despite the fact that each path variable is updated separately, for reasons of optimality. In this respect, we demonstrate that updating a group of random variables simultaneously results in loss of efficiency.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.