Probability-Preserving Transformer for the Time-Dependent Schrödinger Equation
Organizations: Department of Physics, Division of Science and Technology, University of Education Lahore, Pakistan · Department of Physics, Xiamen University, Xiamen 361005, China
Abstract
Solving the time-dependent Schrödinger 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.
Figures & tables
| Test | Total Probability ( ) |
|---|---|
| Sample 0 | 1.039418 |
| Sample 1 | 1.041417 |
| Sample 2 | 1.043455 |
| Sample 3 | 1.045530 |
| Performance Metric | CNM | Multi-token PPT |
|---|---|---|
| Minimum Total Probability ( ) | ||
| Maximum Total Probability ( ) | ||
| Mean Total Probability ( ) | ||
| Probability Deviation / Std. Dev. ( ) | ||
| Mean Squared Error (MSE) | ||
| Root Mean Squared Error (RMSE) |
| Prediction Horizon ( ) | Crank–Nicolson Sequential (s) | PPT Batched (s) | PPT Constant-Time (s) | Speedup |
| 10 | 0.000612 | 0.000897 | 0.000579 | 1.06 |
| 20 | 0.003159 | 0.001589 | 0.000636 | 4.96 |
| 50 | 0.003158 | 0.002209 | 0.000561 | 5.63 |
| 100 | 0.009180 | 0.003832 | 0.000589 | 15.58 |
Transformer
Transformers are neural architectures that use attention to model relationships among sequence elements in language, vision, and scientific data.
See all 540 papers