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 quantum and classical interconnects.
Efficient ab initio auxiliary-field quantum Monte Carlo calculations in Gaussian bases via low-rank tensor decomposition
1 Pith paper cite this work. Polarity classification is still indexing.
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.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
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 quantum and classical interconnects.