Related papers: Simulating thimble regularization of lattice quant…
We follow up the work, where in light of the Picard-Lefschetz thimble approach, we split up the real-time path integral into two parts: the initial density matrix part which can be represented via an ensemble of initial conditions, and the…
We extend the Worldline Monte Carlo approach to computationally simulating the Feynman path integral of non-relativistic multi-particle quantum-mechanical systems. We show how to generate an arbitrary number of worldlines distributed…
Recent applications of machine-learned normalizing flows to sampling in lattice field theory suggest that such methods may be able to mitigate critical slowing down and topological freezing. However, these demonstrations have been at the…
We present a new method for calculating quantum tunneling rates using lattice Monte Carlo simulations in imaginary time. This method is designed with the goal of studying false vacuum decay non-perturbatively on the lattice. We derive a new…
By including elements of the density matrix formalism, the semiclassical ensemble Monte Carlo method for carrier transport is extended to incorporate incoherent tunneling, known to play an important role in quantum cascade lasers (QCLs). In…
An accurate algorithm is proposed to improve the prediction of a particle in collision with a moving wall within the direct simulation Monte Carlo (DSMC) framework for the simulation of unsteady rarefied flows. This algorithm is able to…
The great majority of algorithms employed in the study of lattice field theory are based on Monte Carlo's importance sampling method, i.e. on probability interpretation of the Boltzmann weight. Unfortunately in many theories of interest one…
High-dimensional multimodal sampling problems from lattice field theory (LFT) have become important benchmarks for machine learning assisted sampling methods. We show that GPU-accelerated particle methods, Sequential Monte Carlo (SMC) and…
In simulations of crystals, unlike liquids or gases, it may happen that the properties of the studied system depend not only on the volume of the simulation cell but also on its shape. For such cases it is desirable to change the shape of…
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based…
Developments in algorithms over the past decade suggest that there is a new computational approach to a class of quantum field theories. This approach is based on rewriting the partition function in a representation similar to the…
We consider generalizations of the classical inverse problem to Bayesien type estimators, where the result is not one optimal parameter but an optimal probability distribution in parameter space. The practical computational tool to compute…
Monte Carlo sampling is a powerful toolbox of algorithmic techniques widely used for a number of applications wherein some noisy quantity, or summary statistic thereof, is sought to be estimated. In this paper, we survey the literature for…
The effect of surface roughness on the structure of liquid crystalline fluids near solid substrates is studied by Monte Carlo simulations. The liquid crystal is modelled as a fluid of soft ellipsoidal molecules and the substrate is modelled…
We propose a new Monte Carlo algorithm for the numerical study of general lattice models in Hamiltonian form. The algorithm is based on an initial Ansatz for the ground state wave function depending on a set of free parameters which are…
The tempered Lefschetz thimble method is a parallel-tempering algorithm towards solving the numerical sign problem. It uses the flow time of the gradient flow as a tempering parameter and is expected to tame both the sign and multimodal…
By precisely writing down the matrix element of the local Boltzmann operator, we have proposed a new path integral formulation for quantum field theory and developed a corresponding Monte Carlo algorithm. With current formula, the…
Random batch algorithms are constructed for quantum Monte Carlo simulations. The main objective is to alleviate the computational cost associated with the calculations of two-body interactions, including the pairwise interactions in the…
This project investigates the applicability of quasi-Monte Carlo methods to Euclidean lattice systems in order to improve the asymptotic error scaling of observables for such theories. The error of an observable calculated by averaging over…
We point out that Monte Carlo simulations of theories with severe sign problems can be profitably performed over manifolds in complex space different from the one with fixed imaginary part of the action. We describe a family of such…