2020
DOI: 10.1126/sciadv.abb8341
|View full text |Cite
|
Sign up to set email alerts
|

Easing the Monte Carlo sign problem

Abstract: Quantum Monte Carlo (QMC) methods are the gold standard for studying equilibrium properties of quantum many-body systems. However, in many interesting situations, QMC methods are faced with a sign problem, causing the severe limitation of an exponential increase in the runtime of the QMC algorithm. In this work, we develop a systematic, generally applicable, and practically feasible methodology for easing the sign problem by efficiently computable basis changes and use it to rigorously assess the sign problem.… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
54
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 80 publications
(56 citation statements)
references
References 68 publications
(95 reference statements)
2
54
0
Order By: Relevance
“…The ability to discover a local basis where the average sign of a quantum state becomes substantially higher is particularly relevant for the alleviation of the sign problem in quantum Monte Carlo simulations [24][25][26][27]. In this context, our positivization algorithm could be repurposed to increase the "stoquasticity" of a target Hamiltonian [28].…”
Section: Discussionmentioning
confidence: 99%
“…The ability to discover a local basis where the average sign of a quantum state becomes substantially higher is particularly relevant for the alleviation of the sign problem in quantum Monte Carlo simulations [24][25][26][27]. In this context, our positivization algorithm could be repurposed to increase the "stoquasticity" of a target Hamiltonian [28].…”
Section: Discussionmentioning
confidence: 99%
“…That is, despite the sign problem, it may still be possible to access large enough systems to extract the relevant physics. Moreover, there are several recent works focusing on easing the sign problem to bring a larger set of problems within the reach of current technology [68,69]. The application of machine learning techniques has also found success beyond QMC for systems with a fermionic sign problem [70,71].…”
Section: Discussionmentioning
confidence: 99%
“…The severity of a sign problem is quantified by the smallness of the average sign of the QMC weights p with respect to the distribution |p|, i.e., sgn := p/ |p|. Since sgn can be viewed as the ratio of two partition functions, it obeys the generic scaling sgn ∼ e − βN , with 0, as βN → ∞ [2,10]. A sign problem exists when > 0, in which case QMC simulations require exponential computational resources, and this is what the intrinsic sign problem we identified implies for "most" chiral topological phases of matter.…”
Section: Discussion and Outlookmentioning
confidence: 99%
“…Conceptually, the sign problem can be understood as an obstruction to mapping quantum systems to classical systems, and accordingly, from a number of complexity theoretic perspectives, a generic curing algorithm in polynomial time is not believed to exist [2,[6][7][8][9][10]. In many-body physics, however, one is mostly interested in universal phenomena, i.e., phases of matter and the transitions between them, and therefore representative Hamiltonians which are sign-free often suffice [11].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation