Related papers: A sign-blocking method for mitigating the fermion …
We show how the sign problem occurring in dynamical simulations of random matrices at nonzero chemical potential can be avoided by judiciously combining matrices into subsets. For each subset the sum of fermionic determinants is real and…
At nonzero quark chemical potential dynamical lattice simulations of QCD are hindered by the sign problem caused by the complex fermion determinant. The severity of the sign problem can be assessed by the average phase of the fermion…
The quantum theory of antiferromagnetism in metals is necessary for our understanding of numerous intermetallic compounds of widespread interest. In these systems, a quantum critical point emerges as external parameters (such as chemical…
We investigate the minus-sign problem that afflicts quantum Monte Carlo (QMC) simulations of frustrated quantum spin systems, focusing on spin S=1/2, two spatial dimensions, and the extended Shastry-Sutherland model. We show that…
The fermion sign problem constitutes a fundamental computational bottleneck across a plethora of research fields in physics, quantum chemistry and related disciplines. Recently, it has been suggested to alleviate the sign problem in…
We show that solutions to fermion sign problems in the CT-INT formulation can be extended to systems involving fermions interacting with dynamical quantum spins. While these sign problems seem unsolvable in the auxiliary field approach,…
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…
Heavy-Dense QCD (HDQCD) is a popular theory to investigate the sign problem in quantum field theory. Besides its physical applications, HDQCD is relatively easy to implement numerically: the fermionic degrees of freedom are integrated out,…
Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing…
A precise dynamical characterization of quantum impurity models with multiple interacting orbitals is challenging. In quantum Monte Carlo methods, this is embodied by sign problems. A dynamical sign problem makes it exponentially difficult…
Explicit treatment of many-body Fermi statistics in path integral Monte Carlo (PIMC) results in exponentially scaling computational cost due to the near cancellation of contributions to observables from even and odd permutations. Through…
We discuss the sign problem arising in Monte Carlo simulations of frustrated quantum spin systems. We show that for a class of ``semi-frustrated'' systems (Heisenberg models with ferromagnetic couplings $J_z(r) < 0$ along the $z$-axis and…
The Green's function Monte Carlo (GFMC) method provides accurate solutions to the nuclear many-body problem and predicts properties of light nuclei starting from realistic two- and three-body interactions. Controlling the GFMC fermion-sign…
Diagrammatic Monte Carlo (DiagMC) is a numeric technique that allows one to calculate quantities specified in terms of diagrammatic expansions, the latter being a standard tool of many-body quantum statistics. The sign problem that is…
Ground state properties of the Hubbard model on a two-dimensional square lattice are studied by the auxiliary-field quantum Monte Carlo method. Accurate results for energy, double occupancy, effective hopping, magnetization, and momentum…
A continuous-time path integral Quantum Monte Carlo method using the directed-loop algorithm is developed to simulate the Anderson single-impurity model in the occupation number basis. Although the method suffers from a sign problem at low…
Many experimentally-accessible, finite-sized interacting quantum systems are most appropriately described by the canonical ensemble of statistical mechanics. Conventional numerical simulation methods either approximate them as being coupled…
The sign problem is a widespread numerical hurdle preventing us from simulating the equilibrium behavior of various problems at the forefront of physics. Focusing on an important sub-class of such problems, bosonic $(2+1)$-dimensional…
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…
Standard lattice fermion algorithms run into the well-known sign problem at real chemical potential. In this paper we investigate the possibility of using imaginary chemical potential, and argue that it has advantages over other methods,…