A sufficient condition for the absence of the sign problem in the fermionic quantum Monte-Carlo algorithm [electronic resource].
- Washington, D.C. : United States. Dept. of Energy, 2010.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
- Physical Description:
- 15 pages : digital, PDF file
- Additional Creators:
- Stanford Linear Accelerator Center, United States. Department of Energy, and United States. Department of Energy. Office of Scientific and Technical Information
- Restrictions on Access:
- Free-to-read Unrestricted online access
- Quantum Monte-Carlo (QMC) simulations involving fermions have the notorious sign problem. Some well-known exceptions of the auxiliary field QMC algorithm rely on the factorizibility of the fermion determinant. Recently, a fermionic QMC algorithm has been found in which the fermion determinant may not necessarily factorizable, but can instead be expressed as a product of complex conjugate pairs of eigenvalues, thus eliminating the sign problem for a much wider class of models. In this paper, we present general conditions for the applicability of this algorithm and point out that it is deeply related to the time reversal symmetry of the fermion matrix. We apply this method to various models of strongly correlated systems at all doping levels and lattice geometries, and show that many novel phases can be simulated without the sign problem.
- Report Numbers:
- E 1.99:slac-pub-13902
- Other Subject(s):
- Published through SciTech Connect.
Zhang, Shou-Cheng; Wu, Congjun.
- Funding Information:
View MARC record | catkey: 14706629