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 and presents a cost gradient analysis that identifies the tasks for which the models are trainable.
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 \textit{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.
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.· ACM International Conference...· 0 citations
We present POLYMECHANON, a graph neural network (GNN) decoder for quantum error correction whose only input is the detection error model (DEM) of a quantum code under a given noise model. We represent the DEM as a tripartite graph of detectors, error mechanisms and logical observables, where every input feature is comp...
A learning-to-rank framework for selecting efficient contraction plans before executing them and supporting Learning to Rank as a practical way to reduce contraction-plan search, while showing that performance remains partly backend dependent.
Alfred M. Pastor, Maribel Castillo, José M. Badía· 0 citations
ThunderGNN is a hardware-aware acceleration system designed to reconcile graph irregularity with Tensor Core rigidity and significantly outperforms state-of-the-art systems, achieving geometric mean speedups of 1.89× over DGL and 2.59× over PyG.
Yuang Chen, Si-Yi Teng, Wen-Qi Zeng et al.· Proceedings of the VLDB Endo...· 0 citations
Efficient deployment of neural-network detectors on field-programmable gate array (FPGA) accelerators depends not only on model complexity but also on compiler-visible graph structure. On deep learning processing unit (DPU) platforms, unsupported operators can fragment execution between accelerator and host execution d...
Xiang Ji, Shuai Hu, Hao-Fei Wang et al.· Electronics· 1 citation
By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
MIT News · Artificial Intelligence· news.mit.eduOct 2, 2026
A weeklong summer workshop brought higher education faculty to campus to explore how AI and machine learning materials can be adapted for their classrooms.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.