Related papers: Mitigating the sign problem by quantum computing
The recently proposed full configuration interaction quantum Monte Carlo method allows access to essentially exact ground-state energies of systems of interacting fermions substantially larger than previously tractable without knowledge of…
Quantum computers have the potential to expand the utility of lattice gauge theory to investigate non-perturbative particle physics phenomena that cannot be accessed using a standard Monte Carlo method due to the sign problem. Thanks to the…
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 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…
It is believed that not all quantum systems can be simulated efficiently using classical computational resources. This notion is supported by the fact that in quantum Monte Carlo (QMC) simulations for a large number of important problems it…
We propose a mechanism for solving the `negative sign problem'---the inability to assign non-negative weights to quantum Monte Carlo configurations---for a toy model consisting of a frustrated triplet of spin-$1/2$ particles interacting…
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…
We show how the effects of large numbers of measurements on many-body quantum ground and thermal states can be studied using Quantum Monte Carlo (QMC). Density matrices generated by measurement in this setting feature products of many local…
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…
The quantum Monte Carlo method on asymptotic Lefschetz thimbles is a numerical algorithm devised specifically for alleviation of the sign problem appearing in the simulations of quantum many-body systems. In this method, the sign problem is…
Quantum many-body systems whose Hamiltonians are non-stoquastic, i.e., have positive off-diagonal matrix elements in a given basis, are known to pose severe limitations on the efficiency of Quantum Monte Carlo algorithms designed to…
Quantum Monte Carlo simulations of fermions are hampered by the notorious sign problem whose most striking manifestation is an exponential growth of sampling errors with the number of particles. With the sign problem known to be an NP-hard…
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…
A method is presented to tackle the sign problem in the simulations of systems having indefinite or complex-valued measures. In general, this new approach is shown to yield statistical errors smaller than the crude Monte Carlo using…
Density matrix quantum Monte Carlo (DMQMC) is a recently-developed method for stochastically sampling the $N$-particle thermal density matrix to obtain exact-on-average energies for model and \emph{ab initio} systems. We report a systematic…
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…
Quantum Monte Carlo is one of the most powerful numerical tools for studying nonpeturbative properties of quantum many-body systems. However, its application to real-time problems is limited since the complex and highly-oscillating…
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…
Finding the ground state of a fermionic Hamiltonian using quantum Monte Carlo is a very difficult problem, due to the Fermi sign problem. While still scaling exponentially, full configuration-interaction Monte Carlo (FCI-QMC) mitigates some…
Quantum Monte Carlo (QMC) simulations constitute nowadays one of the most powerful methods to study strongly correlated quantum systems, provided that no "sign problem" arises. However, many systems of interest, including highly frustrated…