Related papers: Fermion Bag Approach to Fermion Sign Problems
We formulate the physics of two species of non-relativistic hard-core bosons with attractive or repulsive delta function interactions on a space-time lattice in the worldline approach. We show that worm algorithms can efficiently sample the…
We demonstrate, by considering the triangular lattice spin-1/2 Heisenberg model, that Monte Carlo sampling of skeleton Feynman diagrams within the fermionization framework offers a universal first-principles tool for strongly correlated…
The notorious fermion sign problem, arising from fermion statistics, presents a fundamental obstacle to the numerical simulation of quantum many-body systems. Here, we introduce a framework that circumvents the sign problem in the studies…
Quantum Monte Carlo (QMC) methods offer exact solutions for quantum many-body systems but face severe limitations in fermionic systems like atomic nuclei due to the sign problem. While sign-problem-free QMC algorithms exist and provide…
Naive intuition about scale decoupling breaks down in the presence of fermion masses. Kinematic enhancements can greatly extend the range where one needs to keep a finite mass in calculations to obtain a correct result at even the O(1)…
The fermion sign problem poses a formidable challenge to the use of Monte Carlo methods for lattice gauge theories with dynamical fermionic matter fields. A meron cluster algorithm recently formulated for gauge fields represented as…
Ground state properties of the Hubbard model are of fundamental importance to understand the mechanism of unconventional superconductivity in the high-T_c cuprates and other materials. One of the most powerful numerical methods for strongly…
It has become increasingly feasible to use quantum Monte Carlo (QMC) methods to study correlated fermion systems for realistic Hamiltonians. We give a summary of these techniques targeted at researchers in the field of correlated electrons,…
The path optimization method with machine learning is applied to the one-dimensional massive lattice Thirring model, which has the sign problem caused by the fermion determinant. This study aims to investigate how the path optimization…
The infamous sign problem leads to an exponential complexity in Monte Carlo simulations of generic many-body quantum systems. Nevertheless, many phases of matter are known to admit a sign-problem-free representative, allowing efficient…
We study the physics of two species of non-relativistic hard-core bosons with attractive or repulsive delta function interactions on a spacetime lattice using the worldline formulation. By tuning the chemical potential carefully we show…
We introduce a new numerical technique -- bosonic auxiliary-field Monte Carlo (bAFMC) -- which allows to calculate the thermal properties of large lattice-boson systems within a systematically improvable semiclassical approach, and which is…
The recent solution to the fermion sign problem allows, for the first time, the use of cluster algorithm techniques to compute certain fermionic path integrals. To illustrate the underlying ideas behind the progress, a cluster algorithm is…
The calculation of the ground state and thermodynamics of mass-imbalanced Fermi systems is a challenging many-body problem. Even in one spatial dimension, analytic solutions are limited to special configurations and numerical progress with…
We study the utility of a complex Langevin (CL) equation as an alternative for the Monte Carlo (MC) procedure in the evaluation of expectation values occurring in fermionic many-body problems. We find that a CL approach is natural in cases…
In lattice field theory, the interactions of elementary particles can be computed via high-dimensional integrals. Markov-chain Monte Carlo (MCMC) methods based on importance sampling are normally efficient to solve most of these integrals.…
We formulate a path-integral Monte Carlo algorithm for simulating lattice systems consisting of fictitious particles governed by a generalized exchange statistics. This method, initially proposed for continuum systems, introduces a…
The Monte Carlo calculation of R\'enyi entanglement entropies $S^{}_n$ of interacting fermions suffers from a well-known signal-to-noise problem, even for a large number of situations in which the infamous sign problem is absent. A few…
Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Meron-cluster algorithms lead to an efficient solution of sign problems for both fermionic and bosonic models. Here we apply the meron concept to…
Many-electron problems pose some of the greatest challenges in computational science, with important applications across many fields of modern science. Fermionic quantum Monte Carlo (QMC) methods are among the most powerful approaches to…