Hybrid grid/basis set discretizations of the Schrödinger equation

Abstract

We present a new kind of basis function for discretizing the Schrödinger equation in electronic structure calculations, called a gausslet, which has wavelet-like features but is composed of a sum of Gaussians. Gausslets are placed on a grid and combine advantages of both grid and basis set approaches. They are orthogonal, infinitely smooth, symmetric, polynomially complete, and with a high degree of locality. Because they are formed from Gaussians, they are easily combined with traditional atom-centered Gaussian bases. We also introduce diagonal approximations which dramatically reduce the computational scaling of two-electron Coulomb terms in the Hamiltonian.

16 pages, 9 figures

References in corpus (1)

• Efficient Tree Tensor Network States (TTNS) for Quantum Chemistry: Generalizations of the Density Matrix Renormalization Group Algorithm

Cited by in corpus (8)

• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Hybrid gausslet/Gaussian basis sets
• Engineering analog quantum chemistry Hamiltonians using cold atoms in optical lattices
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Tensorized orbitals for computational chemistry
• Riemannian quantum circuit optimization based on matrix product operators
• Basis set generation and optimization in the NISQ era with Quiqbox.jl
• A Reusable Library for Second-Order Orbital Optimization Using the Trust Region Method