Graph Neural Networks on Quantum Computers
Yidong Liao, Xiao-Ming Zhang, and Chris Ferrie

TL;DR
This paper introduces quantum algorithms for Graph Neural Networks, potentially overcoming classical scalability issues by offering significant improvements in time and space complexities for large-scale graph processing.
Contribution
It develops quantum algorithms for fundamental GNN types and analyzes their complexities, demonstrating potential quantum advantages over classical methods.
Findings
Quantum algorithms for GNNs show logarithmic time complexity.
Quantum SGC reduces space complexity exponentially.
Potential for efficient large-scale graph analysis on quantum computers.
Abstract
Graph Neural Networks (GNNs) are powerful machine learning models that excel at analyzing structured data represented as graphs, demonstrating remarkable performance in applications like social network analysis and recommendation systems. However, classical GNNs face scalability challenges when dealing with large-scale graphs. This paper proposes frameworks for implementing GNNs on quantum computers to potentially address the challenges. We devise quantum algorithms corresponding to the three fundamental types of classical GNNs: Graph Convolutional Networks, Graph Attention Networks, and Message-Passing GNNs. A complexity analysis of our quantum implementation of the Simplified Graph Convolutional (SGC) Network shows potential quantum advantages over its classical counterpart, with significant improvements in time and space complexities. Our complexities can have trade-offs between the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Neural Networks and Applications
MethodsGraph Neural Network
