S-matrix constrained equivariant graph neural network for Hamiltonian inversion of Kagome and quasiperiodic non-Hermitian systems

Abstract Reconstructing Hamiltonian parameters from noisy scattering data is an ill-posed inverse problem in non-Hermitian quantum systems. We propose an S-matrix Constrained Equivariant Graph Neural Network (SCEGNN) that embeds two architectural hard constraints to reduce the solution ambiguity. An equivariant message-passing encoder incorporates lattice point-group symmetry and permutation-invariant aggregation (for the Aubry–André–Harper quasiperiodic chain), thereby suppressing symmetry-induced parameter variability. A deterministic S-matrix solver serves as a fixed decoder that enforces the scattering equations within the assumed model, eliminating the need for physics-based residual loss terms. Inference is performed via a two-stage hybrid optimisation: offline pre-training on synthetic data, followed by online single-sample fine-tuning in a low-dimensional latent space. On a 48-site Kagome supercell and a 50-site Aubry–André–Harper quasiperiodic chain, using a synthetic dataset of 120,000 samples (100,000 training, 10,000 validation, 10,000 test) with additive white Gaussian noise (0–10%), the mean absolute percentage error of reconstructed parameters remains below 5% for both systems under 10% noise, with per-parameter standard deviations below 7% across 20 independent repetitions. The transmission spectrum reconstruction RMSE is 0.026±0.003 (Kagome) and 0.029±0.003 (Aubry–André–Harper) at 10% noise. Single-sample CPU inference takes 23 s (offline simulation scenario), achieving a 5.6-fold speedup over least-squares fitting with five restarts. Ablation studies confirm that each architectural component contributes to the reported performance. For the AAH quasiperiodic chain, we consider two scenarios: a uniform-dissipation scenario with two independent parameters (V0 and γ), which serves as our primary benchmark. Unless otherwise stated, all numerical results reported in the main text for the AAH chain correspond to the uniform-dissipation scenario.All experiments are conducted on synthetic data; the method is validated as a proof-of-concept for the two benchmark systems under the wide-band approximation and does not claim general applicability to arbitrary non-Hermitian systems or experimental real-time control.

Authors

Institutions

Publication Details

Journal
Machine Learning Science and Technology
Published
2026-11-17
DOI
https://doi.org/10.1088/2632-2153/aec366
Primary Topic
Quantum Mechanics and Non-Hermitian Physics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

S-matrix constrained equivariant graph neural network for Hamiltonian inversion of Kagome and quasiperiodic non-Hermitian systems

Huang Huang, Sivakumar Vengusamy, Dongkai Qi, Yu Li et al.
4 links
Machine Learning Science and Technology
Quantum Mechanics and Non-Hermitian Physics
article

S-matrix constrained equivariant graph neural network for Hamiltonian inversion of Kagome and quasiperiodic non-Hermitian systems

Huang Huang, Sivakumar Vengusamy, Dongkai Qi, Yu Li, Chia Sien Lim, Xiaohong Ye
article en

Abstract

Abstract Reconstructing Hamiltonian parameters from noisy scattering data is an ill-posed inverse problem in non-Hermitian quantum systems. We propose an S-matrix Constrained Equivariant Graph Neural Network (SCEGNN) that embeds two architectural hard constraints to reduce the solution ambiguity. An equivariant message-passing encoder incorporates lattice point-group symmetry and permutation-invariant aggregation (for the Aubry–André–Harper quasiperiodic chain), thereby suppressing symmetry-induced parameter variability. A deterministic S-matrix solver serves as a fixed decoder that enforces the scattering equations within the assumed model, eliminating the need for physics-based residual loss terms. Inference is performed via a two-stage hybrid optimisation: offline pre-training on synthetic data, followed by online single-sample fine-tuning in a low-dimensional latent space. On a 48-site Kagome supercell and a 50-site Aubry–André–Harper quasiperiodic chain, using a synthetic dataset of 120,000 samples (100,000 training, 10,000 validation, 10,000 test) with additive white Gaussian noise (0–10%), the mean absolute percentage error of reconstructed parameters remains below 5% for both systems under 10% noise, with per-parameter standard deviations below 7% across 20 independent repetitions. The transmission spectrum reconstruction RMSE is 0.026±0.003 (Kagome) and 0.029±0.003 (Aubry–André–Harper) at 10% noise. Single-sample CPU inference takes 23 s (offline simulation scenario), achieving a 5.6-fold speedup over least-squares fitting with five restarts. Ablation studies confirm that each architectural component contributes to the reported performance. For the AAH quasiperiodic chain, we consider two scenarios: a uniform-dissipation scenario with two independent parameters (V0 and γ), which serves as our primary benchmark. Unless otherwise stated, all numerical results reported in the main text for the AAH chain correspond to the uniform-dissipation scenario.All experiments are conducted on synthetic data; the method is validated as a proof-of-concept for the two benchmark systems under the wide-band approximation and does not claim general applicability to arbitrary non-Hermitian systems or experimental real-time control.

Machine Learning Science and Technology
Illinois Institute of Technology (US), Asia Pacific University of Technology & Innovation (MY), University of Malaya (MY), Wenzhou Business College (CN)
Quantum Mechanics and Non-Hermitian Physics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon