SOURCE-LINKED INTELLIGENCE

Learning structural balance of graphs from quantum spectral features

arXiv · AI, language, vision and robotics · article · Sep 10, 2026 · UTC

We develop a quantum approach to spectral feature extraction from the density of states (DOS) of a problem-dependent Hamiltonian, and apply it to machine learning on signed graphs. We propose to embed a signed graph as an Ising model instance with positive and negative interactions, and use the standardized moments of the Ising DOS as features for learning. We show that these moments count signed closed walks, are switching-invariant, and are size-free by construction. As a benchmark, we target learning the frustration index, an NP-hard measure of structural balance that can be labeled exactly

Read original source ↗ Open in workspace

recordType

paper

region

Global