Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.25625

Basic linear algebra methods for quantum problems

Aaron Dayton·Kiana Gallagher·Sarah E. Huber·Thomas E. Baker
View original source ↗Read source document ↗Export metadata ↓

Abstract

Making new methods for quantum problems often relies on using basic operations in linear algebra. Often these routines are hidden behind well-known libraries that have been optimized over decades. Attempting to improve on those basic routines would be highly time-consuming. We aim in this article to review those basic routines and provide a knowledge foundation for how to perform basic operations on a computer that would be inaccessible with pen and paper. Elementary details on the solutions to linear algebra problems and computational complexity are reviewed. The focus is on solving eigenvalue problems for quantum systems, but the discussion is generic to many other applications. Common matrix forms relevant to quantum systems and their solution strategies are covered. The discussion extends to computational numerical methods for which the most efficient functions exist in freely available libraries. These include eigenvalue, Schur, QR, LU, LDL, Cholesky, and singular value decompositions. The algorithms for obtaining some of these decompositions are discussed, with focus being placed on those used in modern libraries.

Explore related subjects

physics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aaron Dayton, Kiana Gallagher, Sarah E. Huber, Thomas E. Baker. 2026-04-28. Basic linear algebra methods for quantum problems. https://arxiv.org/abs/2604.25625

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bi-Hamiltonian in Semiflexible Polymers built upon Overdamping Process

Quantifying the interaction between a system of interest and its ambient conditions, the memory effect links the states of two distinct Hamiltonians: one for the target system and one for the environment. In this paper, we propose the diffusion process derived from the Smoluchowski equation that can derive the evolution process described by the memory effect integration in a non Markovian regime. The Smoluchowski picture, within the framework of stochastic thermodynamics, justifies a diffusion process incorporated into the equations of motion, and the result of the derivation enables a coarse-grained molecular dynamics simulation with the modified equation of motion to reproduce attenuation from collisions between single walled carbon nanotubes (SWCNTs) under far from equilibrium conditions. The results of the numerical experiments on the collision confirm that heat diffusion compensates for the correlated momentum arising from the memory effect between the two Hamiltonians in both equilibrium and far from equilibrium states.

physics.comp-ph↗
arXiv2026

Translation of transient acoustic fields

A method is presented for the translation of acoustic field data from a source to a target region. Field data are represented as spherical harmonic expansions on spheres surrounding the source and target regions respectively and expansions are translated using a ``point and shoot'' method using the Kirchhoff--Helmholtz integral to carry out an axial translation from one sphere to the other. The principal motivation for the method is its use in a time-domain Fast Multipole Method, and test cases reflective of this application are presented. The method converges to six digits for appropriate values of parameters and for the values of $N$ considered here computational effort scales approximately as $N^{2}$ where $N$ is the order of spherical harmonic expansion for the field data. The method is causal and thus avoids artifacts generated in methods which are not based on intrinsically causal formulations.

physics.comp-ph↗
arXiv2026

Learning continuous reaction paths for transition-state prediction

Transition states are defined by reaction pathways, yet most machine-learning methods predict them as isolated geometries. We introduce MARC-TS, a two-stage framework that learns a continuous, endpoint-conditioned path, queries it at any resolution and uses local path context to refine a transition-state candidate. We construct T1x-IRC-8K, a dataset of 8,209 reactions and 1,088,725 path-resolved geometries. On held-out reactions, the path model reduced complete-path error by 48.4% relative to endpoint interpolation, and the localizer achieved a mean aligned structural error of 0.127 Å. Quantum-chemical optimization and vibrational analysis yielded 405 frequency-confirmed first-order saddle-point candidates from 410 predictions. In a 100-reaction nudged elastic band comparison, learned-path initialization reached a joint geometry-and-force target for 66% of reactions, compared with 12% for geometric interpolation after 100 optimizer steps. By treating the path as a reusable representation rather than an auxiliary output, MARC-TS connects transition-state prediction, mechanistic interpretation and quantum-chemical refinement.

physics.comp-ph↗