Related papers: Computational complexity and fundamental limitatio…
Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…
Building on recent solutions of the fermion sign problem for specific models we present two continuous-time quantum Monte Carlo methods for efficient simulation of mass-imbalanced Hubbard models on bipartite lattices at half-filling. For…
Determinant quantum Monte Carlo (DQMC), formulated in complex-fermion representation, has played a key role in studying strongly-correlated fermion systems. However, its applicability is limited due to the requirement of particle-number…
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…
Quantum Monte Carlo (QMC) methods are powerful tools for simulating quantum many-body systems, yet their applicability is limited by the infamous sign problem. We approach this challenge through the lens of Vanishing Geometric Phases (VGP)…
The "sign problem" (SP) is the fundamental limitation to simulations of strongly correlated materials in condensed matter physics, solving quantum chromodynamics at finite baryon density, and computational studies of nuclear matter. As a…
The Monte Carlo evaluation of path integrals is one of a few general purpose methods to approach strongly coupled systems. It is used in all branches of Physics, from QCD/nuclear physics to the correlated electron systems. However, many…
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…
A method is proposed to handle the sign problem in the simulation of systems having indefinite or complex-valued measures. In general, this new approach, which is based on renormalisation blocking, is shown to yield statistical errors…
We discuss the Fermion sign problem and, by examining a very general Hubbard-Stratonovich (HS) transformation, argue that the sign problem cannot be solved with such methods. We propose a different kind of transformation which, while not…
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the…
The canonical approach, which was developed for solving the sign problem, may suffer from a new type of sign problem. In the canonical approach, the grand partition function is written as a fugacity expansion: $Z_G(\mu,T) = \sum_n Z_C(n,T)…
A powerful way to guarantee the absence of a sign problem in determinantal quantum Monte Carlo simulations is imposing a particular type of anti-unitary symmetries. It is shown that these same symmetries give rise to constraints on…
To tackle the sign problem in the simulations of systems having indefinite or complex-valued measures, we propose a new approach which yields statistical errors smaller than the crude Monte Carlo using absolute values of the original…
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 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…
Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of…
Current nonequilibrium Monte Carlo methods suffer from a dynamical sign problem that makes simulating real-time dynamics for long times exponentially hard. We propose a new `Inchworm Algorithm', based on iteratively reusing information…
Recently, we have proposed a novel approach (arxiv:1205.3996) to deal with the sign problem that hinders Monte Carlo simulations of many quantum field theories (QFTs). The approach consists in formulating the QFT on a Lefschetz thimble. In…
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…