Related papers: Worm Improved Estimators in Continuous-time Quantu…
We show that high-temperature expansions may serve as a basis for the novel approach to efficient Monte Carlo simulations. "Worm" algorithms utilize the idea of updating closed path configurations (produced by high-temperature expansions)…
We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient…
A detailed description is provided of a new Worm Algorithm, enabling the accurate computation of thermodynamic properties of quantum many-body systems in continuous space, at finite temperature. The algorithm is formulated within the…
Quantum Monte Carlo algorithms based on a world-line representation such as the worm algorithm and the directed loop algorithm are among the most powerful numerical techniques for the simulation of non-frustrated spin models and of bosonic…
We derive the equations for calculating the high-frequency asymptotics of the local two-particle vertex function for a multi-orbital impurity model. These relate the asymptotics for a general local interaction to equal-time two-particle…
Based on the worm algorithm in the path-integral representation, we propose a general quantum Monte Carlo algorithm suitable for parallelizing on a distributed-memory computer by domain decomposition. Of particular importance is its…
We present a worm sampling method for calculating one- and two-particle Green's functions using continuous-time quantum Monte Carlo simulations in the hybridization expansion (CT-HYB). Instead of measuring Green's functions by removing…
The Fermi gas at unitarity is a particularly interesting system of cold atoms, being dilute and strongly interacting at the same time. It can be studied non-perturbatively with Monte Carlo methods, like the recently developed worm…
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…
The worm algorithm is a versatile technique in the Markov chain Monte Carlo method for both classical and quantum systems. The algorithm substantially alleviates critical slowing down and reduces the dynamic critical exponents of various…
We investigate in this work a recently proposed diagrammatic quantum Monte Carlo method --- the inchworm Monte Carlo method --- for open quantum systems. We establish its validity rigorously based on resummation of Dyson series. Moreover,…
We develop a method to improve on the statistical errors for higher moments using machine learning techniques. We present here results for the dual representation of the Ising model with an external field, derived via the high temperature…
We study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, the…
We discuss the implementation of a directed geometrical worm algorithm for the study of quantum link-current models. In this algorithm Monte Carlo updates are made through the biased reptation of a worm through the lattice. A directed…
The entanglement entropy probing novel phases and phase transitions numerically via quantum Monte Carlo has made great achievements in large-scale interacting spin/boson systems. In contrast, the numerical exploration in interacting fermion…
We apply a worm algorithm to simulate the quantum transverse-field Ising model in a path-integral representation of which the expansion basis is taken as the spin component along the external-field direction. In such a representation, a…
We propose efficient measurement procedures for the self-energy and vertex function of the Anderson impurity model within the hybridization expansion continuous-time quantum Monte Carlo algorithm. The method is based on the measurement of…
A quantum Monte Carlo method with non-local update scheme is presented. The method is based on a path-integral decomposition and a worm operator which is local in imaginary time. It generates states with a fixed number of particles and…
Using the complex $\phi^4$-model as a prototype for a system which is simulated by a worm algorithm, we show that not only the charged correlator $<\phi^{*}(x)\phi(y)>$, but also more general correlators such as $<|\phi(x)||\phi(y)|>$ or…
Variational quantum algorithms are poised to have significant impact on high-dimensional optimization, with applications in classical combinatorics, quantum chemistry, and condensed matter. Nevertheless, the optimization landscape of these…