Related papers: Efficient continuous-time quantum Monte Carlo algo…
Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based…
There has been much recent progress in the understanding and reduction of the computational cost of the Hybrid Monte Carlo algorithm for Lattice QCD as the quark mass parameter is reduced. In this letter we present a new solution to this…
This article outlines how the quantum Monte Carlo directed loop update recently introduced can be applied to a wide class of quantum lattice models. Several models are considered: Spin-S XXZ models with longitudinal and transverse magnetic…
Quantum algorithms offer the potential for significant computational advantages; however, in many cases, it remains unclear how these advantages can be practically realized. Causal Set Theory is a discrete, Lorentz-invariant approach to…
Quantum Monte Carlo methods are powerful tools for studying quantum many-body systems but face difficulties in accessing excited states and in treating sign problems. We present a continuous-time path-integral Monte Carlo method for…
The Quantum Monte Carlo (QMC) method can yield the imaginary-time dependence of a correlation function $C(\tau)$ of an operator $\hat O$. The analytic continuation to real-time proceeds by means of a "numerical inversion" of these data to…
We present a new approach for Monte Carlo simulations of lattice quantum spin systems which is able to eliminate the negative sign problem. Its complexity is linear in the volume of the lattice. Its efficiency is tested on a simple…
An efficient continuous-time path-integral Quantum Monte Carlo algorithm for the lattice polaron is presented. It is based on Feynman's integration of phonons and subsequent simulation of the resulting single-particle self-interacting…
We propose a quantum Monte Carlo (QMC) algorithm for non-equilibrium dynamics in a system with a parameter varying as a function of time. The method is based on successive applications of an evolving Hamiltonian to an initial state and…
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the…
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…
In the absence of a fermion sign problem, auxiliary field (or determinantal) quantum Monte Carlo (DQMC) approaches have long been the numerical method of choice for unbiased, large-scale simulations of interacting many-fermion systems. More…
Gaussian Quantum Monte Carlo (GQMC) is a stochastic phase space method for fermions with positive weights. In the example of the Hubbard model close to half filling it fails to reproduce all the symmetries of the ground state leading to…
We present results for lattice QCD with staggered fermions in the limit of infinite gauge coupling, obtained from a worm-type Monte Carlo algorithm on a discrete spatial lattice but with continuous Euclidean time. This is obtained by…
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…
To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
Quantum computing offers an alternative paradigm for addressing combinatorial optimization problems compared to classical computing. Despite recent hardware improvements, the execution of empirical quantum optimization experiments at scales…
We present results for lattice QCD in the limit of infinite gauge coupling, obtained from a worm-type Monte Carlo algorithm on a discrete spatial lattice but with continuous Euclidean time. This is obtained by sending both the anisotropy…
Some algorithms for the numerically exact treatment of fermion determinants are summarised. This is not supposed to be a review, rather a concise handbook. The audience is expected to have a basic understanding of how to put fermions on a…