Related papers: Mitigating the Sign Problem Through Basis Rotation…
Although quantum Monte Carlo is, in principal, an exact method for solving the Schroedinger equation, it is well-known that systems of Fermions still pose a challenge. Thus far all solutions to the "sign problem" remain inefficient (or…
This article provides an introduction to the ideas behind the multilevel blocking (MLB) approach to the fermion sign problem in path-integral Monte Carlo simulations, and also gives a detailed discussion of MLB results for quantum dots. MLB…
Although stoquastic Hamiltonians are known to be simulable via sign-problem-free quantum Monte Carlo (QMC) techniques, the non-stoquasticity of a Hamiltonian does not necessarily imply the existence of a QMC sign problem. We give a…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
The Fermi sign structure plays a crucial role for a Landau's Fermi liquid. In this work, we identify the exact sign structure for the bipartite Hubbard model at an arbitrary strength of the on-site Coulomb repulsion $U$. This general sign…
We present a general strategy to solve the notorious fermion sign problem using cluster algorithms. The method applies to various systems in the Hubbard model family as well as to relativistic fermions. Here it is illustrated for…
We develop a GPU-accelerated hybrid quantum Monte Carlo (QMC) algorithm to solve the fundamental yet difficult problem of $U(1)$ gauge field coupled to fermions, which gives rise to a $U(1)$ Dirac spin liquid state under the description of…
The conventional second-order Path Integral Monte Carlo method is plagued with the sign problem in solving many-fermion systems. This is due to the large number of anti-symmetric free fermion propagators that are needed to extract the…
Ultracold-atom simulations of the Hubbard model provide insights into the character of charge and spin correlations in and out of equilibrium. The corresponding numerical simulations, on the other hand, remain a significant challenge. We…
Non-stoquastic Hamiltonians have both positive and negative signs in off-diagonal elements in their matrix representation in the standard computational basis and thus cannot be simulated efficiently by the standard quantum Monte Carlo…
Two formidable bottlenecks to the applicability of QMC include: (1) the sign problem and (2) algorithmic update inefficiencies. In this thesis, I overcome both these difficulties for a class of problems by extending the fermion bag approach…
The Sign Learning Kink (SiLK) based Quantum Monte Carlo (QMC) method is used to calculate the ab initio ground state energies for multiple geometries of the H$_{2}$O, N$_2$, and F$_2$ molecules. The method is based on Feynman's path…
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,…
Lattice field theory with the $\theta$ term suffers from the sign problem. The sign problem appears as flattening of the free energy. As an alternative to the conventional method, the Fourier transform method (FTM), we apply the maximum…
Simulation of fermionic systems is one of the most promising applications of quantum computers. It spans problems in quantum chemistry, high-energy physics and condensed matter. Underpinning the core steps of any quantum simulation…
We consider the numerical analysis of the inchworm Monte Carlo method, which is proposed recently to tackle the numerical sign problem for open quantum systems. We focus on the growth of the numerical error with respect to the simulation…
We provide a new approach to error mitigation for quantum chemistry simulation that uses a Bravyi-Kitaev Superfast encoding to implement a quantum error detecting code within the fermionic encoding. Our construction has low-weight parity…
We apply recently developed smooth boundary conditions to the quantum Monte Carlo simulation of the two-dimensional Hubbard model. At half-filling, where there is no sign problem, we show that the thermodynamic limit is reached more rapidly…
A restricted path integral method is proposed to simulate a type of quantum system or Hamiltonian called a sum of controlled few-fermions on a classical computer using Monte Carlo without a numerical sign problem. Then a universality is…
Cluster algorithms have been recently used to eliminate sign problems that plague Monte-Carlo methods in a variety of systems. In particular such algorithms can also be used to solve sign problems associated with the permutation of fermion…