Skip to content
aiqbench takeAI + Quantum

aiqbench analysis

This research introduces a Transformer architecture that enforces probability conservation as a hard constraint when solving the time-dependent Schrödinger equation, addressing a critical limitation in standard soft-constraint implementations. By intrinsically ensuring unitarity across temporal evolution without repeated retraining, the method achieves both physical exactness and computational efficiency over conventional approaches. The work represents a significant convergence of deep learning architectures with fundamental quantum mechanical principles to solve complex physics problems more effectively.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Probability-Preserving Transformer for the Time-Dependent Schr\"odinger Equation

arXiv1 min read

arXiv:2608.15112v1 Announce Type: new Abstract: 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.

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.

Machine Learning (cs.LG); Mathematical Physics (math-ph); Quantum Physics (quant-ph)

arXiv:2608.15112 [cs.LG]

(or arXiv:2608.15112v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2608.15112 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 180 words

Related coverage