Inductive Graph Representation Learning with Quantum Graph Neural Networks
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The paper implements two quantum graph neural network architectures—Simplified Graph Convolution (SGC) and Linear Graph Convolution (LGC)—and evaluates them on benchmark graph datasets for semi‑supervised learning using quantum simulation. It compares their predictive performance and optimization behavior to classical baselines, finding that the quantum models achieve competitive results with fewer parameters. Additionally, the study provides a cost‑gradient analysis to identify trainable tasks and a classical simulability investigation to determine regimes where the circuits remain robust during training.
arXiv:2602. 16018v2 Announce Type: replace-cross Abstract: Graph neural networks (GNNs) are a powerful framework for learning representations from graph-structured data, but their direct implementation on near-term quantum hardware remains challenging due to circuit depth, multi-qubit interactions, and qubit scalability constraints.
arXiv:2606. 26873v1 Announce Type: cross Abstract: Graphs provide a natural language for relational data in chemistry, biology and optimisation.
arXiv:2606. 26312v1 Announce Type: cross Abstract: Autoencoders transformed classical machine learning by solving the curse of dimensionality, enabling principled weight initialization and learning compact, structured representations.
arXiv:2512. 09586v2 Announce Type: replace-cross Abstract: Quantum circuit design is a key bottleneck for practical quantum machine learning on complex, real-world data.
The paper introduces a hybrid quantum–classical regression framework that uses a lightweight classical embedding as a learnable geometric preconditioner to improve the conditioning of a downstream variational quantum circuit. It further incorporates a curriculum optimization protocol that gradually increases circuit depth and switches from SPSA-based exploration to Adam-based fine‑tuning. Experiments on PDE‑informed and standard regression datasets show that this approach consistently outperforms pure QNN baselines, yielding more stable convergence and reduced structured errors, especially in data‑limited regimes.