Quantum Graph Convolutional Networks: Implementation and Trainability Analysis

arXiv:2609.19983 · quant-ph, cs.LG · Submitted 2026-09-17 · Read on arXiv

quant-ph, cs.LG

Submitted: 2026-09-17

Updated: 2026-09-17

Code: https://github.com/ax-ml/jax

License: http://creativecommons.org/licenses/by/4.0/

The gist: Graph Neural Networks (GNNs) achieve state-of-the-art performance on graph-structured data, but training and inference on large graphs are often bottlenecked by memory constraints and sparse

Terminology

Abstract

Graph Neural Networks (GNNs) achieve state-of-the-art performance on graph-structured data, but training and inference on large graphs are often bottlenecked by memory constraints and sparse linear-algebra workloads. Quantum computing offers an alternative set of primitives that may improve scalability for graph learning. Building on the quantum graph neural network (QGNN) framework of Liao et al., this work implements two representative architectures --- the Simplified Graph Convolution (SGC) and Linear Graph Convolution (LGC) models --- and evaluates them on open benchmark graph datasets and semi-supervised learning tasks using quantum simulation. We compare predictive performance and optimization behavior against classical baselines, showing that the quantum models achieve competitive performance with fewer parameters. Finally, we present a cost gradient analysis that identifies the tasks for which the models showcased are trainable. This is followed by a classical simulability study to find regimes in which the proposed circuits remain robust during training.

Sources

Related papers