Related papers: Deconvolving the components of the sign problem
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…
Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Important examples include QCD and other field theories at non-zero chemical potential, at non-zero vacuum angle, or with an odd number of flavors, as…
As an intrinsically-unbiased approach, quantum Monte Carlo (QMC) is of vital importance in understanding correlated phases of matter. Unfortunately, it often suffers notorious sign problem when simulating interacting fermion models. Here,…
We study the discretized worldsheet of Type IIB strings in the Gubser-Klebanov-Polyakov background in a new setup, which eliminates a complex phase previously detected in the fermionic determinant. A sign ambiguity remains, which a study of…
Determinants are useful to represent the state of an interacting system of (effectively) repulsive and independent elements, like fermions in a quantum system and training samples in a learning problem. A computationally challenging problem…
Quantum annealing is a generic solver of the optimization problem that uses fictitious quantum fluctuation. Its simulation in classical computing is often performed using the quantum Monte Carlo simulation via the Suzuki--Trotter…
We present a new Monte Carlo algorithm for simulating quantum spin systems which is able to suppress the negative sign problem. This algorithm has only a linear complexity in the lattice size used for the simulation. A general description…
In this work we solve the sign problem of a frustrated quantum impurity model consisting of three quantum spin-half chains interacting through an anti-ferromagnetic Heisenberg interaction at one end. We first map the model into a repulsive…
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 main difficulty for path integral Monte Carlo studies of Fermi systems results from the requirement of antisymmetrization of the density matrix and is known in literature as the 'sign problem'. To overcome this issue the new numerical…
Quantum Monte Carlo (QMC) methods for the frustrated quantum spin systems occasionally suffer from the negative sign problem, which makes simulations exponentially harder for larger systems at lower temperatures and severely limits QMC's…
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…
We tutorially review the determinantal Quantum Monte Carlo method for fermionic systems, using the Hubbard model as a case study. Starting with the basic ingredients of Monte Carlo simulations for classical systems, we introduce aspects…
We study the sign problem in the Hubbard model on the hexagonal lattice away from half-filling using the Lefschetz thimbles method. We identify the saddle points, reduce their amount, and perform quantum Monte Carlo (QMC) simulations using…
We study the sign problem of the fermion determinant at nonzero baryon chemical potential. For this purpose we apply a simple model derived from Quantum Chromodynamics, in the limit of large chemical potential and mass. For SU(2) color,…
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 negative-sign problem in one-dimensional frustrated quantum spin systems is solved. We can remove negative signs of the local Boltzmann weights by using a dimer basis that has the spin-reversal symmetry. Validity of this new basis is…
The fermion sign problem remains the primary obstacle in simulating the thermodynamic properties of various fermionic systems. In this work, we present a sign-blocking method to mitigate the numerical instability inherent in the sign…
We present a solution to the sign problem in dynamical random matrix simulations of a two-matrix model at nonzero chemical potential. The sign problem, caused by the complex fermion determinants, is solved by gathering the matrices into…
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem'' when applied to fermions - causing an exponential increase of the computing time with the number of particles. A polynomial time…