Papers āŗ Machine learning meets š°š²(n) Lie algebra: Enhancing quantum dynamics learning with...
Machine learning meets š°š²(n) Lie algebra: Enhancing quantum dynamics learning with exact trace conservation
Arif Ullah, Jeremy O. Richardson
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Machine learning (ML) has emerged as a promising tool for simulating quantum dissipative dynamics. However, existing methods often struggle to enforce key physical constraints, such as trace conservation, when modeling reduced density matrices (RDMs). While Physics-Informed Neural Networks (PINN) aim to address these challenges, they frequently fail to achieve full physical consistency. In this work, we introduce a novel approach that leverages the š°š²(n) Lie algebra to represent RDMs as a combination of an identity matrix and nĀ² - 1 Hermitian, traceless, and orthogonal basis operators,where n is the system's dimension. By learning only the coefficients associated with this basis, our framework inherently ensures exact trace conservation, as the traceless nature of the basis restricts the trace contribution solely to the identity matrix. This eliminates the need for explicit trace-preserving penalty terms in the loss function, simplifying optimization and improving learning efficiency. We validate our approach on two benchmark quantum systems: the spin-boson model and the Fenna-Matthews-Olson complex. By comparing the performance of four neural network (NN) architectures -- Purely Data-driven Physics-Uninformed Neural Networks (PUNN), š°š²(n) Lie algebra-based PUNN (š°š²(n)-PUNN), traditional PINN, and š°š²(n) Lie algebra-based PINN (š°š²(n)-PINN) -- we highlight the limitations of conventional methods and demonstrate the superior accuracy, robustness, and efficiency of our approach in learning quantum dissipative dynamics.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change Ā· a person checks every report against the paper or source before anything changes; decisions are listed on /corrections