The sign problem in density matrix quantum Monte Carlo
Hayley R. Petras, William Z. Van Benschoten, Sai Kumar Ramadugu, James, J. Shepherd

TL;DR
This paper investigates the sign problem in density matrix quantum Monte Carlo (DMQMC), comparing it with FCIQMC and exploring modifications like IP-DMQMC to reduce computational costs and improve scalability.
Contribution
The study provides a systematic analysis of the sign problem in DMQMC, establishing relationships between critical walker populations and proposing IP-DMQMC as a more efficient alternative.
Findings
N_c for DMQMC is the square of N_c for FCIQMC.
IP-DMQMC's N_c is directly proportional to FCIQMC's N_c.
Asymmetric propagation in IP-DMQMC reduces stochastic error.
Abstract
Density matrix quantum Monte Carlo (DMQMC) is a recently-developed method for stochastically sampling the -particle thermal density matrix to obtain exact-on-average energies for model and \emph{ab initio} systems. We report a systematic numerical study of the sign problem in DMQMC based on simulations of atomic and molecular systems. In DMQMC, the density matrix is written in an outer product basis of Slater determinants and has a size of space which is the square of the number of Slater determinants. In principle this means DMQMC needs to sample a space which scales in the system size, , as . In practice, there is a system-dependent critical walker population () which must be exceeded in order to remove the sign problem, and this imposes limitations by way of storage and computer time. We establish that for DMQMC is the square of for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
