2016
DOI: 10.1103/physrevlett.117.197203
|View full text |Cite
|
Sign up to set email alerts
|

Sign-Problem-Free Monte Carlo Simulation of Certain Frustrated Quantum Magnets

Abstract: We introduce a quantum Monte Carlo (QMC) method for efficient sign-problem-free simulations of a broad class of frustrated S=1/2 antiferromagnets using the basis of spin eigenstates of clusters to avoid the severe sign problem faced by other QMC methods. We demonstrate the utility of the method in several cases with competing exchange interactions and flag important limitations as well as possible extensions of the method.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
63
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 49 publications
(64 citation statements)
references
References 64 publications
(77 reference statements)
1
63
0
Order By: Relevance
“…Closing this section with a brief technical summary, we perform stochastic series expansion [44] QMC simulations in the dimer basis [29,30] with directed loop updates [45,46] to compute the thermodynamic properties of the Shastry-Sutherland model (1) and to characterize the sign problem in the extended model (2). These simulations perform an unrestricted sampling of the configuration space, meaning one not constrained to any subset of the Hilbert space defined by the S z and D z operators of the total system.…”
Section: The Modelsmentioning
confidence: 99%
“…Closing this section with a brief technical summary, we perform stochastic series expansion [44] QMC simulations in the dimer basis [29,30] with directed loop updates [45,46] to compute the thermodynamic properties of the Shastry-Sutherland model (1) and to characterize the sign problem in the extended model (2). These simulations perform an unrestricted sampling of the configuration space, meaning one not constrained to any subset of the Hilbert space defined by the S z and D z operators of the total system.…”
Section: The Modelsmentioning
confidence: 99%
“…1, frustrated quantum spin models have been identified where the sign problem can indeed be overcome, and their number continues to grow. Leading methods for tackling the sign problem to date include meron and nested cluster algorithms [27,28,30] and a suitable choice of simulation basis [25,26,29,[31][32][33][34][35]68]. For the frustrated ladder, we follow the latter approach, taking the rung basis as a natural choice for the rewritten Hamiltonian (4).…”
Section: 1 Sign Problemmentioning
confidence: 99%
“…For the example of a frustrated ladder, the clusters correspond to the ladder rungs. In the present manuscript, we will go away from the case of perfect frustration, where the sign problem can be eliminated completely [33,34]. We will show that, although a sign problem remains present, it is so mild that the cluster basis allows efficient QMC simulations at all points in the phase diagram of the frustrated antiferromagnetic spin-1/2 ladder.The structure of this article is as follows.…”
mentioning
confidence: 94%
“…The "negative sign problem," or simply the "sign problem," is the single most important unresolved challenge in quantum manybody simulations, preventing physicists, chemists, and material scientists alike from a true understanding of many of the most profound macroscopic quantum physical phenomena of Nature-in areas as diverse as material design and high temperature superconductivity through the physics of neutron stars to lattice quantum chromodynamics, and more. [1][2][3][4] The sign problem slows down quantum Monte Carlo (QMC) algorithms, [5][6][7] which are in many cases the only tool available to us for studying large quantum many-body systems, to the point where these schemes become practically useless. QMC algorithms allow us to evaluate thermal averages of physical observables by sampling the configuration space of the model in question via the decomposition of the partition function into a sum of efficiently computable terms, which are in turn interpreted as probabilities in a Markov process.…”
Section: Introductionmentioning
confidence: 99%