The paper introduces VQIL, a trainable Szegedy quantum walk that learns how local perturbations propagate through a graph. By optimizing edge weights, link phases, and node phase rotations via backpropagation, VQIL produces node rankings based on a geometrically discounted coherent sum of quantum-walk amplitudes. Experiments on AC power‑flow and gene perturbation datasets show significant improvements in Spearman rank correlation compared to untrained walks and classical baselines, demonstrating the method’s scalability and interpretability.
arXiv:2606. 26873v1 Announce Type: cross Abstract: Graphs provide a natural language for relational data in chemistry, biology and optimisation.
The paper introduces a quantum method for extracting spectral features from the density of states (DOS) of a problem-dependent Hamiltonian, applied to signed graphs represented as Ising models. Using standardized moments of the Ising DOS as features, the authors demonstrate that these moments count signed closed walks, are switching‑invariant, and size‑free. On a benchmark of 140,000 labeled graphs, the exact DOS predicts the frustration index exactly, while five moments achieve a mean error of 0.4, and a new DOS‑QPE protocol offers efficient sampling with far fewer shots than classical trace‑sampling methods.
arXiv:2607. 00063v1 Announce Type: cross Abstract: This paper studies how spectral geometry emerges in quantum learning models and how it can be diagnosed with physically grounded probes.
arXiv:2608.20660v1 Announce Type: cross Abstract: Simulating a continuous-time quantum walk (CTQW) on a graph in the circuit model of quantum computing requires decomposing its Hamiltonian into terms...
The paper presents a reinforcement‑learning approach to schedule link‑level entanglement in quantum networks, using a Markov Decision Process and double deep Q‑networks with message‑passing neural networks. The resulting policies achieve 100% success rates even when the link activation probability is reduced by up to 71% compared to baseline heuristics, and maintain at least 80% success when task placements are hardware‑restricted. The authors also develop metrics to interpret the learned policy and employ a large language model to generate a heuristic that matches the DQN performance, suggesting a scalable method for extracting interpretable strategies in large quantum networks.
The paper introduces CTQW-GNN, a graph neural network that uses Continuous‑Time Quantum Walks (CTQW) to address two common GNN problems: low‑pass bias on heterophilic graphs and over‑smoothing with deep layers. By exploiting the unitary nature of the CTQW propagator, the model preserves high‑frequency signals and maintains feature norms across layers. Three aggregation modules—CTQW‑based, CTQW‑attention, and a low‑pass GAT branch—combine to handle both heterophilic and homophilic graph structures, supported by spectral‑gap analysis and a Lieb–Robinson‑type bound for walk‑time selection.
arXiv:2503.24111v4 Announce Type: replace-cross Abstract: Graph Neural Networks (QGNNs) offer a promising approach to combining quantum computing with graph-structured data processing. While classica...
The paper introduces a quantum method for extracting spectral features from the density of states (DOS) of a problem-dependent Hamiltonian, applied to signed graphs represented as Ising models. It demonstrates that standardized moments of the Ising DOS count signed closed walks, are switching‑invariant, and size‑free, enabling accurate learning of the frustration index with a mean error of 0.4 on 140,000 labeled graphs. The authors propose DOS‑QPE, a phase estimation technique that requires far fewer shots than traditional methods, and highlight potential applications in social network analysis, spin‑glass studies, correlation clustering, and protein‑interaction networks.
arXiv:2607. 22516v1 Announce Type: cross Abstract: A central design principle in modern machine learning and artificial intelligence is to align a model's inductive bias with the structure of its input data.
arXiv:2605. 21916v2 Announce Type: replace-cross Abstract: Dynamic link prediction is important for modeling evolving interactions in social, communication, financial, and transportation networks.
Resting-state functional connectivity is widely used in machine learning-based classification of neuropsychiatric disorders. Quantum machine learning models have been proposed for functional connectiv...
arXiv:2609.25044v1 Announce Type: cross Abstract: This paper presents a quantum semantic communication (QSemCom) framework combining quantum machine learning (QML) and semantic communication (SemCom)...