Papers
Topics
Authors
Recent
Search
2000 character limit reached

Gradient-based stochastic estimation of the density matrix

Published 28 Nov 2017 in cond-mat.stat-mech | (1711.10570v2)

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){ij}$ decay rapidly with distance $r{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)/2d}$, where $d$ is the dimension and $S$ is a prefactor to the computational cost. The convergence becomes exponential if the system is at finite temperature or is insulating.

Citations (38)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.