A Simple GPU-Accelerated Solver for the Schrödinger Operator with Applications to Ground States and Hamiltonian Simulation
Abstract
We extend the tensor-product direct solver from the Laplacian to the Schrödinger operator -Δ+ V. When the potential V1 is separable, the operator -Δ+ V1 is inverted or exponentiated at cost O(N1+1/d) in d dimensions via per-axis eigendecomposition. On a single NVIDIA A100 GPU, this costs less than one second for 109 degrees of freedom in 3D. For non-separable potentials V = V1 + V2, the same solver provides a preconditioner (-Δ+ V1)-1 for the preconditioned conjugate gradient (PCG) method and a propagator for operator-splitting time integrators. For bounded V2, we prove that the preconditioned operator has a bounded condition number and a clustered spectrum with at most finitely many outlier eigenvalues, independently of the mesh size, and also independently of the domain size when V1 is a confining potential. This explains the mesh- and domain-independent PCG iteration counts observed in practice. We apply this method to ground state computation via inverse iteration for linear problems and via the au gradient flow for Gross--Pitaevskii energy in 3D, and also Hamiltonian simulation via the approximated qHOP and Magnus-2 splitting methods from 3D to 9D on a single NVIDIA GH200 GPU.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.