2019
DOI: 10.48550/arxiv.1906.02309
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Easing the Monte Carlo sign problem

Dominik Hangleiter,
Ingo Roth,
Daniel Nagaj
et al.
Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(13 citation statements)
references
References 47 publications
0
13
0
Order By: Relevance
“…Note added. During the completion of this manuscript we became aware of a similar work [28] on the complexity of easing the sign problem in quantum Monte Carlo.…”
Section: Discussionmentioning
confidence: 99%
“…Note added. During the completion of this manuscript we became aware of a similar work [28] on the complexity of easing the sign problem in quantum Monte Carlo.…”
Section: Discussionmentioning
confidence: 99%
“…In the rotated basis in which Z i ↔ X i the same Hamiltonian will be written as H = i<j J ij X i X j and will possess a sign problem [2]. Thus, often times curing the sign problem boils down to finding a transformation U to the Hamiltonian such that the decomposition of the partition function of the rotated Hamiltonian H to positive-valued terms is known [2,3,20,21]. It should be noted nonetheless that since in QMC some physical observables are more easily accessible than others depending on whether or not they are diagonal, curing the sign problem via rotation is not always a practical resolution as observables in the rotated frame may be inaccessible as compared to those in the original frame.…”
Section: Curing the Sign Problemmentioning
confidence: 99%
“…Note: During the final stages of this work, a number of related works appeared on the arXiv [34], [35], and [36].…”
Section: Acknowledgementsmentioning
confidence: 99%