arXiv Machine Learning

Efficient Prediction of SO(3)-Equivariant Hamiltonian Matrices via SO(2) Local Frames

arXiv:2506. 09398v4 Announce Type: replace Abstract: We consider the task of predicting Hamiltonian matrices to accelerate electronic structure calculations, which plays an important role in physics, chemistry, and materials science.

arXiv Machine Learning
Jun 30

MALOQ: Massively Accelerated Learning of Operators for Quantum Transport

arXiv:2606. 28911v1 Announce Type: new Abstract: Machine-learned (ML) operator models can be trained to predict density functional theory (DFT) Hamiltonian/density matrices at significantly reduced computational cost, thus extending electronic-structure calculations to previously unfeasible scales.

By Manasa Kaniselvan, Alexander Maeder, Denghui Lu, Alexandros Nikolaos Ziogas, Mathieu Luisier
arXiv Machine Learning
Jun 30

Shoot from the HIP: Hessian Interatomic Potentials without derivatives

arXiv:2509. 21624v3 Announce Type: replace Abstract: Fundamental tasks in computational chemistry, from transition state search to vibrational analysis, rely on molecular Hessians, which are the second derivatives of the potential energy.

By Andreas Burger, Luca Thiede, Nikolaj R{\o}nne, Varinia Bernales, Nandita Vijaykumar, Tejs Vegge, Arghya Bhowmik, Alan Aspuru-Guzik
arXiv Machine Learning
Jun 2

Sheaf Neural Networks on SPD Manifolds: Second-Order Geometric Representation Learning

arXiv:2604. 20308v2 Announce Type: replace Abstract: Graph neural networks face two fundamental challenges rooted in the linear structure of Euclidean vector spaces: (1) Current architectures represent geometry through vectors (directions, gradients), yet many tasks require matrix-valued representations that capture relationships between directions-such as how atomic orientations covary in a molecule.

By Yuhan Peng, Junwen Dong, Yuzhi Zeng, Hao Li, Ce Ju, Huitao Feng, Diaaeldin Taha, Anna Wienhard, Kelin Xia
arXiv Machine Learning
Jun 30

Learning the structure of open quantum systems

arXiv:2606. 30358v1 Announce Type: cross Abstract: We design an algorithm for learning the coefficients of an $n$-qubit constant-local Lindbladian to $\varepsilon$ error with $O(g d^2 \log(n) / \varepsilon^2)$ total evolution time, where $g$ is the single-site energy and $d$ is the (approximate) degree of the interaction graph.

By Laura Lewis, Ewin Tang, John Wright