Probability-Preserving Transformer for the Time-Dependent Schr"odinger Equation
Not on the map. Why?
Abstract (arXiv)
Solving the time-dependent Schr"odinger equation (TDSE) via traditional numerical methods is computationally intensive. Transformer models offer a compelling alternative, but standard implementations rely on soft constraints that cannot rigorously guarantee probability conservation. Here, we introduce a Transformer architecture that enforces TDSE probability conservation as a hard constraint. The design intrinsically ensures unitarity across temporal evolution without requiring repeated retraining. Our empirical findings show that this hard-constraint approach is not only physically exact but also computationally superior to conventional soft-constraint methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 38 references that are in the map. First posted on arXiv 15 Aug 2026.
Builds on
7 of 38 references.
References · 7
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,908
- 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 2,018
- 2021Choose a Transformer: Fourier or Galerkincited by 343
- 2019Ab-Initio Solution of the Many-Electron Schr"odinger Equation with Deep Neural Networkscited by 200
- 2017Sobolev Training for Neural Networkscited by 143
Built on by
Not cited yet.