Related papers: Worm Algorithm for Continuous-space Path Integral …
The unitary equal-mass Fermi gas with zero-range interactions constitutes a paradigmatic model system that is relevant to atomic, condensed matter, nuclear, particle, and astro physics. This work determines the fourth-order virial…
In dynamic Monte Carlo simulations, using for example the Metropolis dynamic, it is often required to simulate for long times and to simulate large systems. We present an overview of advanced algorithms to simulate for larger times and to…
A possible solution of the notorious sign problem preventing direct Monte Carlo calculations for systems with non-zero chemical potential is to deform the integration region in the complex plane to a Lefschetz thimble. We investigate this…
We provide an extension to lattice systems of the reptation quantum Monte Carlo algorithm, originally devised for continuous Hamiltonians. For systems affected by the sign problem, a method to systematically improve upon the so-called…
Two first-principles simulation techniques, path integral Monte Carlo (PIMC) and density functional molecular dynamics (DFT-MD), are applied to study hot, dense helium in the density-temperature range of 0.387 - 5.35 g/cc and 500 K -…
A path integral Monte Carlo method (PIMC) based on Feynman-Kac formula for mixed boundary conditions of elliptic equations is proposed to solve the forward problem of electrical impedance tomography (EIT) on the boundary to obtain…
Recent research shows that the partition function for a class of models involving fermions can be written as a statistical mechanics of clusters with positive definite weights. This new representation of the model allows one to construct…
Owing to their favorable scaling with dimensionality, Monte Carlo (MC) methods have become the tool of choice for numerical integration across the quantitative sciences. Almost invariably, efficient MC integration schemes are strictly…
We report lattice simulations of $\phi^4_2$ and $O(N)\,\phi^4$ models, performed by means of a Monte Carlo method based on the all-order strong coupling expansion (worm algorithm). The investigation of the non-perturbative features of the…
We introduce two novel quantum Monte Carlo methods and employ them to study the superfluid-insulator transition in a two-dimensional system of hard-core bosons. One of the methods is appropriate for zero temperature and is based upon…
Rendering algorithms typically integrate light paths over path space. However, integrating over this one unified space is not necessarily the most efficient approach, and we show that partitioning path space and integrating each of these…
In this work the path integral formulation for rigid rotors, proposed by M\"user and Berne [Phys. Rev. Lett. {\bf 77}, 2638 (1996)], is described in detail. It is shown how this formulation can be used to perform Monte Carlo simulations of…
We introduce a powerful Monte Carlo (MC) algorithm for the atomistic simulation of bulk models of oligo- and poly-thiophenes by redesigning MC moves originally developed for considerably simpler polymer structures and architectures, such as…
We propose a new decoder for "matchable'' qLDPC codes that uses a Markov Chain Monte Carlo algorithm - called the worm algorithm - to approximately compute the probabilities of logical error classes given a syndrome. The algorithm hence…
We describe an algorithm for dynamic load balancing of geometrically parallelized synchronous Monte Carlo simulations of physical models. This algorithm is designed for a (heterogeneous) multiprocessor system of the MIMD type with…
A general algorithm toward the solution of the fermion sign problem in finite-temperature quantum Monte Carlo simulations has been formulated for discretized fermion path integrals with nearest-neighbor interactions in the Trotter…
One of the open challenges in quantum computing is to find meaningful and practical methods to leverage quantum computation to accelerate classical machine learning workflows. A ubiquitous problem in machine learning workflows is sampling…
We describe a novel simulation method that eliminates the slowing-down problem in the Monte Carlo simulations of imaginary-time path integrals near the continuum limit. This method combines a stochastic blocking procedure with the multigrid…
We propose a new algorithm which works effectively in global updates in Monte Carlo study. We apply it to the quantum spin chain with next-nearest-neighbor interactions. We observe that Monte Carlo results are in excellent agreement with…
The inchworm expansion is a promising approach to solving strongly correlated quantum impurity models due to its reduction of the sign problem in real and imaginary time. However, inchworm Monte Carlo is computationally expensive,…