Related papers: Avoiding the sign-problem in lattice field theory
We investigate the applicability of Quasi-Monte Carlo methods to Euclidean lattice systems for quantum mechanics in order to improve the asymptotic error behavior of observables for such theories. In most cases the error of an observable…
In these proceedings, we review recent advances in applying quantum computing to lattice field theory. Quantum computing offers the prospect to simulate lattice field theories in parameter regimes that are largely inaccessible with the…
Quantum Monte-Carlo (QMC) simulations involving fermions have the notorious sign problem. Some well-known exceptions of the auxiliary field QMC algorithm rely on the factorizibility of the fermion determinant. Recently, a fermionic QMC…
Our knowledge about the QCD phase diagram at finite baryon chemical potential $\mu_{B}$ is limited by the well known sign problem. The path integral measure, in the standard determinantal approach, becomes complex at finite $\mu_{B}$ so…
In master-field simulations of lattice QCD, the expectation values of interest are obtained from a single or at most a few representative gauge-field configurations on very large lattices. If the light quarks are included, the generation of…
The effective residual interaction for a system of hadrons has a long tradition in theoretical physics. It has been mostly addressed in terms of boson exchange models. The aim of this review is to describe approaches based on lattice field…
Quantum field theories underlie all of our understanding of the fundamental forces of nature. The are relatively few first principles approaches to the study of quantum field theories [such as quantum chromodynamics (QCD) relevant to the…
The quantum Monte-Carlo method is applied to two-dimensional electron systems under strong magnetic fields. The negative-sign problem involved by this method can be avoided for certain filling factors by modifying interaction parameters…
I derive a loop representation for the canonical and grand-canonical partition functions for an interacting four-component Fermi gas in one spatial dimension and an arbitrary external potential. The representation is free of the "sign…
Monte Carlo algorithms are barely considered in spin foam quantum gravity. Due to the quantum nature of spin foam amplitudes one cannot readily apply them, and the present sign problem is a threat to convergence and thus efficiency. Yet,…
We argue the sign problem of the fermion determinant at finite density. It is unavoidable not only in Monte-Carlo simulations on the lattice but in the mean-field approximation as well. A simple model deriving from Quantum Chromodynamics…
We present a strategy to alleviate the sign problem in continuous-time quantum Monte Carlo (CTQMC) simulations of the dynamical-mean-field-theory (DMFT) equations for the spin-orbit-coupled multiorbital Hubbard model. We first identify the…
In this note, we study a concatenation of quasi-Monte Carlo and plain Monte Carlo rules for high-dimensional numerical integration in weighted function spaces. In particular, we consider approximating the integral of periodic functions…
The triangular lattice antiferromagnet with $S=1/2$ spins and nearest neighbor interactions is known to have long-range antiferromagnetic order, with nearest-neighbor spins at an angle of 120 degrees. Numerical studies of quantum phases…
The quantum Monte Carlo method on asymptotic Lefschetz thimbles is a numerical algorithm devised specifically for alleviation of the sign problem appearing in the simulations of quantum many-body systems. In this method, the sign problem is…
For important classes of many-fermion problems, quantum Monte Carlo (QMC) methods allow exact calculations of ground-state and finite-temperature properties, without the sign problem. The list spans condensed matter, nuclear physics, and…
Minimum-weight perfect matching (MWPM) has been been the primary classical algorithm for error correction in the surface code, since it is of low runtime complexity and achieves relatively low logical error rates [Phys. Rev. Lett. 108,…
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…
We introduce a Monte Carlo scheme for sampling bold-line diagrammatic series specifying an unknown function in terms of itself. The range of convergence of this bold(-line) diagrammatic Monte Carlo (BMC) is significantly broader than that…
Monte Carlo simulations are useful tools for modeling quantum systems, but in some cases they suffer from a sign problem, leading to an exponential slow down in their convergence to a value. While solving the sign problem is generically…