Pith. sign in

REVIEW

Gradient-based stochastic estimation of the density matrix

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1711.10570 v2 pith:QHDTB7MR submitted 2017-11-28 cond-mat.stat-mech

classification cond-mat.stat-mech
keywords densitymatrixdecaycomputationalcostelementsestimationexponential
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools