Pith. sign in

REVIEW 1 cited by

Efficient ab initio auxiliary-field quantum Monte Carlo calculations in Gaussian bases via low-rank tensor decomposition

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 1810.01549 v2 pith:KJ7WKMCW submitted 2018-10-03 physics.comp-ph physics.chem-ph

Efficient ab initio auxiliary-field quantum Monte Carlo calculations in Gaussian bases via low-rank tensor decomposition

classification physics.comp-ph physics.chem-ph
keywords calculationsafqmcalgorithmauxiliary-fieldbasescarlocostdecomposition
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We describe an algorithm to reduce the cost of auxiliary-field quantum Monte Carlo (AFQMC) calculations for the electronic structure problem. The technique uses a nested low-rank factorization of the electron repulsion integral (ERI). While the cost of conventional AFQMC calculations in Gaussian bases scales as $\mathcal{O}(N^4)$ where $N$ is the size of the basis, we show that ground-state energies can be computed through tensor decomposition with reduced memory requirements and sub-quartic scaling. The algorithm is applied to hydrogen chains and square grids, water clusters, and hexagonal BN. In all cases we observe significant memory savings and, for larger systems, reduced, sub-quartic simulation time.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers

    quant-ph 2026-06 unverdicted novelty 5.0

    An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for qua...