Learning structural balance of graphs from quantum spectral features

arXiv:2609.11736 · quant-ph, cond-mat.dis-nn, cs.LG, cs.SI · Submitted 2026-09-10 · Read on arXiv

quant-ph, cond-mat.dis-nn, cs.LG, cs.SI

Submitted: 2026-09-10

Updated: 2026-09-10

Comments: 12 pages, 6 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Frustration — 2× in this paper · explained in 2 episodes
• Trace — 2× in this paper · explained in 2 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Clustering — 1× in this paper · explained in 2 episodes
• Feature Extraction — 1× in this paper · explained in 2 episodes

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity