Related papers: Local Simulation Algorithms for Coulombic Interact…
On the base of a Feynman-Kac--type formula involving Poisson stochastic processes, recently a Monte Carlo algorithm has been introduced, which describes exactly the real- or imaginary-time evolution of many-body lattice quantum systems. We…
An efficient Monte Carlo algorithm for the simulation of spin models with long-range interactions is discussed. Its central feature is that the number of operations required to flip a spin is independent of the number of interactions…
We develop a classical Monte Carlo algorithm based on a quasi-classical approximation for a pseudospin S=1 Hamiltonian in real space to construct a phase diagram of a model cuprate with a high Tc. A model description takes into account both…
We present a fast, hierarchical, and adaptive algorithm for Metropolis Monte Carlo simulations of systems with long-range interactions that reproduces the dynamics of a standard implementation exactly, i.e., the generated configurations and…
L\"uscher's local bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions is applied to the simulation of a possibly supersymmetric Yang-Mills theory with a Majorana fermion in the adjoint representation.…
We describe collective-move Monte Carlo algorithms designed to approximate the overdamped dynamics of self-assembling nanoscale components equipped with strong, short-ranged and anisotropic interactions. Conventional Monte Carlo simulations…
Using a dual representation of lattice fermion models that is based on spin-charge transformation and fermionisation of the original description, I derive an algorithm for diagrammatic Monte Carlo simulation of strongly correlated systems.…
Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each…
We simulate TIP3P water using a constrained Monte Carlo algorithm to generate electrostatic interactions eliminating the need to sum over long ranged Coulomb interactions. We study discretization errors when interpolating charges using…
We develop a Monte Carlo wave function algorithm for the quantum linear Boltzmann equation, a Markovian master equation describing the quantum motion of a test particle interacting with the particles of an environmental background gas. The…
We present an exact version of the local bosonic algorithm for the simulation of dynamical quarks in lattice QCD. This version is based on a non-hermitian polynomial approximation of the inverse of the quark matrix. A Metropolis test…
We present an exact local bosonic algorithm for the simulation of dynamical fermions in lattice QCD. It is based on a non-hermitian polynomial approximation of the inverse of the quark matrix and a global Metropolis accept/reject correction…
We review efficient Monte Carlo methods for simulating quantum systems which couple to a dissipative environment. A brief introduction of the Caldeira-Leggett model and the Monte Carlo method will be followed by a detailed discussion of…
Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this…
This article describes Monte-Carlo algorithms for charged systems using constrained updates for the electric field. The method is generalized to treat inhomogeneous dielectric media, electrolytes via the Poisson-Boltzmann equation and…
Monte Carlo (MC) simulations of lattice models are a widely used way to compute thermodynamic properties of substitutional alloys. A limitation to their more widespread use is the difficulty of driving a MC simulation in order to obtain the…
The Metropolis Monte Carlo algorithm with the Finite Element method applied to compute electrostatic interaction energy between charge densities is described in this work. By using the Finite Element method to integrate numerically the…
We propose a fast and general predecision scheme for Metropolis Monte Carlo simulation of $d$-dimensional long-range interacting lattice models. For potentials of the form $V(r)=r^{-d-\sigma}$, this reduces the computational complexity from…
The problem of simulating the thermal behavior of quantum systems remains a central open challenge in quantum computing. Unlike well-established quantum algorithms for unitary dynamics, \emph{provably efficient} algorithms for preparing…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…