arXiv Machine Learning

Inductive Graph Representation Learning with Quantum Graph Neural Networks

arXiv Machine Learning
Sep 18

Quantum Graph Convolutional Networks: Implementation and Trainability Analysis

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.

By Paul San Sebastian Sein, Theodor Iosif, Tilen G. Limb\"ack-Stokin, Kin Ian Lo, Yidong Liao
arXiv Machine Learning
Jul 23

Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era

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.

By Armin Ahmadkhaniha, Jake Doliskani
arXiv Machine Learning
Jun 26

Tailor Made Embeddings for Quantum Machine Learning

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.

By Aldo Lamarre, Dominik \v{S}afr\'anek
arXiv Machine Learning
Sep 14

Trainability-Oriented Hybrid Quantum Regression via Geometric Preconditioning and Curriculum Optimization

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.

By Qingyu Meng, Yangshuai Wang