English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Quantum Monte-Carlo (QMC) simulations involving fermions have the notorioussign problem. Some well-known exceptions of the auxiliary field QMC algorithmrely on the factorizibility of the fermion determinant. Recently, a fermionicQMC algorithm [1] has been found in which the fermion determinant may notnecessarily factorizable, but can instead be expressed as a product of complexconjugate pairs of eigenvalues, thus eliminating the sign problem for a muchwider class of models. In this paper, we present general conditions for theapplicability of this algorithm and point out that it is deeply related to thetime reversal symmetry of the fermion matrix. We apply this method to variousmodels of strongly correlated systems at all doping levels and latticegeometries, and show that many novel phases can be simulated without the signproblem.Comment: 14 pages, 7 figures, to appear in Phys. Rev.

Sufficient condition for absence of the sign problem in the fermionic quantum Monte Carlo algorithm