English

Gradient-based stochastic estimation of the density matrix

Statistical Mechanics 2018-04-17 v2

Abstract

Fast estimation of the single-particle density matrix is key to many applications in quantum chemistry and condensed matter physics. The best numerical methods leverage the fact that the density matrix elements f(H)ijf(H)_{ij} decay rapidly with distance rijr_{ij} between orbitals. This decay is usually exponential. However, for the special case of metals at zero temperature, algebraic decay of the density matrix appears and poses a significant numerical challenge. We introduce a gradient-based probing method to estimate all local density matrix elements at a computational cost that scales linearly with system size. For zero-temperature metals the stochastic error scales like S(d+2)/2dS^{-(d+2)/2d}, where dd is the dimension and SS is a prefactor to the computational cost. The convergence becomes exponential if the system is at finite temperature or is insulating.

Keywords

Cite

@article{arxiv.1711.10570,
  title  = {Gradient-based stochastic estimation of the density matrix},
  author = {Zhentao Wang and Gia-Wei Chern and Cristian D. Batista and Kipton Barros},
  journal= {arXiv preprint arXiv:1711.10570},
  year   = {2018}
}
R2 v1 2026-06-22T23:00:06.438Z