Vector alignment in matrix Lie groups
math.NA, cs.NA, hep-lat, math-ph, math.MP
Submitted: 2026-06-29
Updated: 2026-11-04
Comments: 44 pages
Code: https://github.com/JuliaDiff/ReverseDiff.jl
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Many measurements in physics determine a linear transformation from pairs of input and output vectors, where the transformation is known in advance to belong to a matrix Lie group…
Terminology
Abstract
Many measurements in physics determine a linear transformation from pairs of input and output vectors, where the transformation is known in advance to belong to a matrix Lie group, for example the Lorentz group for the four-momenta measured by two inertial observers, or the unitary group for the states produced by a quantum circuit. Among the classical groups, only the rotation and unitary groups have a well-known closed form solution, given by the Kabsch and Horn algorithms and by the polar decomposition. We extend our previously proposed Lie algebra method from the image of the matrix exponential to the entire Lie group. We derive the projection in closed form for the classical groups over the real and complex numbers, including the indefinite orthogonal and unitary, symplectic, spin, special Euclidean and similarity groups, and we give conditions under which the method is exact for noiseless data, with examples in which it fails otherwise and an extension by a data dependent involution which is exact on the whole group. For noisy data, we bound the error of the method to first order in the noise, and we show that, for the orthogonal and unitary groups, it agrees with the least squares solution over the group to first order when the input vectors are isotropic, but not otherwise. We apply the method to an eight-qubit quantum circuit and to the rigid registration of point clouds, and compare it with Gauss--Newton refinement and direct minimization. A Julia implementation is provided.
Sources
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers