The Sign Problem in Density Matrix Quantum Monte Carlo

[Image: see text] Density matrix quantum Monte Carlo (DMQMC) is a recently developed method for stochastically sampling the N-particle thermal density matrix to obtain exact-on-average energies for model and 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. In principle, this means that DMQMC needs to sample a space that scales in the system size, N, as O[(exp(N))(2)]. In practice, removing the sign problem requires a total walker population that exceeds a system-dependent critical walker population (N(c)), imposing limitations on both storage and compute time. We establish that N(c) for DMQMC is the square of N(c) for FCIQMC. By contrast, the minimum N(c) in the interaction picture modification of DMQMC (IP-DMQMC) is only linearly related to the N(c) for FCIQMC. We find that this difference originates from the difference in propagation of IP-DMQMC versus canonical DMQMC: the former is asymmetric, whereas the latter is symmetric. When an asymmetric mode of propagation is used in DMQMC, there is a much greater stochastic error and is thus prohibitively expensive for DMQMC without the interaction picture adaptation. Finally, we find that the equivalence between IP-DMQMC and FCIQMC seems to extend to the initiator approximation, which is often required to study larger systems with large basis sets. This suggests that IP-DMQMC offers a way to ameliorate the cost of moving between a Slater determinant space and an outer product basis.