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

📅 2026-02-17
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the challenges of deploying graph neural networks on noisy intermediate-scale quantum (NISQ) devices, where large circuit depth, complex many-body interactions, and poor scalability hinder practical implementation. The authors propose a fully quantum graph convolutional architecture that leverages an edge-local message-passing mechanism to reduce qubit requirements from O(Nn) to O(n), utilizing only hardware-native single- and two-qubit gates to significantly enhance scalability. Built upon the Quantum Alternating Operator Ansatz (QAOA), the framework integrates variational quantum feature extraction with the Deep Graph Infomax objective for unsupervised training. Experiments on the Cora citation network and a large-scale genomic SNP dataset demonstrate performance comparable to existing quantum and hybrid models, confirming its feasibility on real NISQ hardware.

Technology Category

Machine Learning: Quantum Machine LearningData Mining & Knowledge Management: Graph Mining, Social Network Analysis & CommunityComputer Vision: Generative Adversarial Networks (GANs) for Vision

Application Category

Graph Algorithms and Modeling for the Web: Graph neural networks and deep learning approaches for Web-related graphsSearch and Retrieval-Augmented AI: Efficiency and scalability of Web search enginesSemantics and Knowledge: Scalable techniques for the creation, curation, publication, maintenance, and consumption of large, Web-based, structured, reusable, knowledge graphs and ontologies
📝 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. In this work, we introduce a fully quantum graph convolutional architecture designed explicitly for unsupervised learning in the noisy intermediate-scale quantum (NISQ) regime. Our approach combines a variational quantum feature extraction layer with an edge-local and qubit-efficient quantum message-passing mechanism inspired by the Quantum Alternating Operator Ansatz (QAOA) framework. Unlike prior models that rely on global operations or multi-controlled unitaries, our model decomposes message passing into pairwise interactions along graph edges using only hardware-native single- and two-qubit gates. This design reduces the qubit requirement from $O(Nn)$ to $O(n)$ for a graph with $N$ nodes and $n$-qubit feature registers, enabling implementation on current quantum devices regardless of graph size. We train the model using the Deep Graph Infomax objective to perform unsupervised node representation learning. Experiments on the Cora citation network and a large-scale genomic SNP dataset demonstrate that our model remains competitive with prior quantum and hybrid approaches.
Problem

Research questions and friction points this paper is trying to address.

quantum graph learning
NISQ
qubit efficiency
graph neural networks
quantum hardware constraints
Innovation

Methods, ideas, or system contributions that make the work stand out.

quantum graph learning
qubit-efficient
edge-local message passing
NISQ
variational quantum circuit
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
A
Armin Ahmadkhaniha
Department of Computing and Software, McMaster University
J
Jake Doliskani
Department of Computing and Software, McMaster University