QDAGer is introduced, a quantum-inspired graph-pair Transformer that injects quantum-dynamical features from time series of node occupations and connected two-point correlators directly into the attention mechanism, and applies it to learning Graph Edit Distance, an NP-hard similarity measure.
Abstract
We study the quantum evolution induced by graph-indexed Ising Hamiltonians as a source of structural signal for graph learning. Graph automorphisms preserve symmetries of the Hamiltonian, and these symmetries constrain the quantum evolution in a way that turns time-dependent local measurements into informative probes of graph structure. Leveraging this idea, we introduce QDAGer, a quantum-inspired graph-pair Transformer that injects quantum-dynamical features from time series of node occupations and connected two-point correlators directly into the attention mechanism. We apply QDAGer to learning Graph Edit Distance (GED), an NP-hard similarity measure, using either a direct permutation-invariant embedding discrepancy or an alignment-based surrogate loss. Experiments on multiple GED benchmarks under different edit cost settings show that the proposed dynamical features provide a stronger inductive bias than classical structural alternatives under the same training protocol. In addition, we report ablations where the dynamical signal is replaced by standard random-walk and heat-kernel features while keeping the architecture fixed, highlighting that the gain comes from the injected dynamics rather than model capacity alone.
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...
A GNN based on Continuous-Time Quantum Walks (CTQW) and exploiting two properties of the CTQW propagator, preserving mid- and high-frequency signals for heterophilic graphs while preventing Dirichlet-energy collapse.
Yu-Liang Zhan, Ze-Feng Gao, Jian Li et al.· 0 citations
This work trains machine learning models to predict, for a given graph, which of the two decompositions produces the smaller CX gate count, and uses the dominant signal from n_Pauli, a property of the Hamiltonian decomposition rather than an intrinsic property of the graph.
Results indicate that PIQGNN provides an efficient, scalable, and noise-resilient quantum framework for graph learning, highlighting its practical potential in the noisy intermediate-scale quantum (NISQ) era.
Maoduo Li, Wen Liu, Lei Shi et al.· IEEE Transactions on Neural...· 0 citations
The results demonstrate that neural architectures can accurately capture highly non-trivial entanglement features inaccessible to conventional tensor networks, providing prototypic examples for benchmarking and a constructive design framework for future neural-network quantum state developments targeting strongly entan...
Runde Zha, Yun-Tian Gu, Chaohui Fan et al.· 0 citations
Mandala is a modular software framework for learning block-sparse electronic-structure matrices with E(3)-equivariant graph neural networks that connects electronic-structure learning and observable-guided modeling while retaining a representation tied to quantum-mechanical operators rather than only scalar or vector t...
B. Brzoza, Wiktoria Szopa, Z. Elabid et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.