Operator Learning for Schrödinger Equation: Unitarity, Error Bounds, and Time Generalization

Yash Patel, Unique Subedi, Ambuj Tewari
5/23/2025
stat.MLcs.LG

No official code found. Best implementation: yashpatel5400/schrodinger_op (1 star, MIT, last commit 2025-11-03).

Abstract

We consider the problem of learning the evolution operator for the time-dependent Schrödinger equation, where the Hamiltonian may vary with time. Existing neural network-based surrogates often ignore fundamental properties of the Schrödinger equation, such as linearity and unitarity, and lack theoretical guarantees on prediction error or time generalization. To address this, we introduce a linear estimator for the evolution operator that preserves a weak form of unitarity. We establish both upper and lower bounds on the prediction error that hold uniformly over all sufficiently smooth initial wave functions. Additionally, we derive time generalization bounds that quantify how the estimator extrapolates beyond the time points seen during training. Experiments across real-world Hamiltonians -- including hydrogen atoms, ion traps for qubit design, and optical lattices -- show that our estimator achieves relative errors $10^{-2}$ to $10^{-3}$ times smaller than state-of-the-art methods such as the Fourier Neural Operator and DeepONet.

View on arXivView PDF

Code Implementations(1)

MIT

Linear operator learning for time-dependent Schrodinger eqn

11Python, Jupyter NotebookFeb 18, 202511 months agoMIT

Similar Papers

Cite this paper

@article{patel2025operator,
  title  = {Operator Learning for Schrödinger Equation: Unitarity, Error Bounds, and Time Generalization},
  author = {Yash Patel and Unique Subedi and Ambuj Tewari},
  year   = {2025},
  eprint = {2505.18288},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.18288v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.18288.svg)](https://codeofpaper.com/paper/2505.18288)

Discussion