A Simple GPU-Accelerated Solver for the Schr\"odinger Operator with Applications to Ground States and Hamiltonian Simulation
Xinyu Liu, Xiangxiong Zhang

TL;DR
This paper introduces a GPU-accelerated solver for the Schrödinger operator that efficiently handles separable and non-separable potentials, enabling fast ground state calculations and Hamiltonian simulations in high dimensions.
Contribution
The authors extend a tensor-product solver to the Schrödinger operator, providing efficient inversion, exponentiation, and preconditioning techniques on GPUs with theoretical guarantees.
Findings
Solver performs in less than one second for 10^9 degrees of freedom in 3D.
Preconditioned conjugate gradient method has mesh- and domain-independent iteration counts.
Applied to ground state computation and Hamiltonian simulation in high dimensions.
Abstract
We extend the tensor-product direct solver from the Laplacian to the Schr\"odinger operator . When the potential is separable, the operator is inverted or exponentiated at cost in dimensions via per-axis eigendecomposition. On a single NVIDIA A100 GPU, this costs less than one second for degrees of freedom in 3D. For non-separable potentials , the same solver provides a preconditioner for the preconditioned conjugate gradient (PCG) method and a propagator for operator-splitting time integrators. For bounded , 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 is a confining potential. This explains the mesh-…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
