Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2401.15665 · Quantum Information Processing

Learnability of a hybrid quantum-classical neural network for graph-structured quantum data

Yanying Liang, Si-Le Tang, Yi Zhu, Haozhen Situ, Zhu‐Jun Zheng

Published Nov 24, 2025• 0 citations
arXivHTMLPDF
DOI
10.1007/s11128-025-04997-y

Related papers

QGAN-based data augmentation for hybrid quantum–classical neural networks

Run-Ze He, Junjian Su, Su‐Juan Qin +2 more

arXiv:2505.24780•Chinese Journal of Physics•Jul 25, 2025•7 citations

Learnable quantum spectral filters for hybrid graph neural networks

Ammar Daskin

Abstract In this paper, we describe a parameterized quantum circuit that can be considered as convolutional and pooling layers for graph neural networks. The circuit incorporates the parameterized quantum Fourier circuit where the qubit connections for the controlled gates derived from the Laplacian operator. Specifically, we show that the eigenspace of the Laplacian operator of a graph can be approximated by using QFT based circuit whose connections are determined from the adjacency matrix. For an N × N Laplacian, this approach yields an approximate polynomial-depth circuit requiring only n = log(N) qubits. These types of circuits can eliminate the expensive classical computations for approximating the learnable functions of the Laplacian through Chebyshev polynomial or Taylor expansions. Using this circuit as a convolutional layer provides an n− dimensional probability vector that can be considered as the filtered and compressed graph signal. Therefore, the circuit along with the measurement can be considered a very efficient convolution plus pooling layer that transforms an N-dimensional signal input into n−dimensional signal with an exponential compression. We then apply a classical neural network prediction head to the output of the circuit to construct a complete graph neural network. Since the circuit incorporates geometric structure through its graph connection-based approach, we present graph classification results for the benchmark datasets listed in TUDataset library (AIDS, Letter-high, Letter-med, Letter-low, MUTAG, ENZYMES, PROTEINS, COX2, BZR, DHFR, MSRC-9). Using only [1-100] learnable parameters for the quantum circuit and minimal classical layers (1000-5000 parameters) in a generic setting, the obtained results are comparable to and in some cases better than many of the baseline results, particularly for the cases when geometric structure plays a significant role.

arXiv:2507.05640•Oct 15, 2025•2 citations

A Comparative Analysis of Hybrid-Quantum Classical Neural Networks

Kamila Zaman, Tasnim Ahmed, Muhammad Abdullah Hanif +2 more

arXiv:2402.10540•Communications in computer and information science•Jan 1, 2025•52 citations

On the Design of Quantum Graph Convolutional Neural Network in the NISQ-Era and Beyond

Zhirui Hu, Jinyang Li, Zhenyu Pan +6 more

The rapid growth in the size of Graph Convolutional Neural Networks (GCNs) encounters both computational- and memory-wall on classical computing platforms (e.g., CPU, GPU, FPGA, etc.). Quantum computing, on the other hand, provides extremely high parallelism for computation. Although quantum neural networks have been recently studied, the research on quantum graph neural networks is still in its infancy. The key challenge here is how to integrate both the graph topology information and the learning ability of GCNs into quantum circuits. In this work, we leverage the Givens rotations and its quantum implementation to encode graph information; in addition, we employ the widely used variational quantum circuit to bring the learnable parameters. On top of these, we present a full-quantum design of Graph Convolutional Neural Networks, namely "QuGCN", for semi-supervised learning on graph-structured data. Experiment results show our design is competitive with classical GCNs in terms of node classification accuracy on Cora sub-dataset. More importantly, we show the potential advantages that can be achieved by the proposed quantum GCN design when the number of features grows.

IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD)•Oct 1, 2022•31 citations

Quantum Walk Neural Networks for Graph-Structured Data

Stefan Dernbach, Arman Mohseni-Kabir, Siddharth Pal +1 more

Studies in computational intelligence•Dec 4, 2018•13 citations

Learning quantum state properties with quantum and classical neural networks

Arthur Chalom Pesah

•Jan 1, 2019•0 citations
Abstract In this paper, we describe a parameterized quantum circuit that can be considered as convolutional and pooling layers for graph neural networks. The circuit incorporates the parameterized quantum Fourier circuit where the qubit connections for the controlled gates derived from the Laplacian operator. Specifically, we show that the eigenspace of the Laplacian operator of a graph can be approximated by using QFT based circuit whose connections are determined from the adjacency matrix. For an N × N Laplacian, this approach yields an approximate polynomial-depth circuit requiring only n = log(N) qubits. These types of circuits can eliminate the expensive classical computations for approximating the learnable functions of the Laplacian through Chebyshev polynomial or Taylor expansions. Using this circuit as a convolutional layer provides an n− dimensional probability vector that can be considered as the filtered and compressed graph signal. Therefore, the circuit along with the measurement can be considered a very efficient convolution plus pooling layer that transforms an N-dimensional signal input into n−dimensional signal with an exponential compression. We then apply a classical neural network prediction head to the output of the circuit to construct a complete graph neural network. Since the circuit incorporates geometric structure through its graph connection-based approach, we present graph classification results for the benchmark datasets listed in TUDataset library (AIDS, Letter-high, Letter-med, Letter-low, MUTAG, ENZYMES, PROTEINS, COX2, BZR, DHFR, MSRC-9). Using only [1-100] learnable parameters for the quantum circuit and minimal classical layers (1000-5000 parameters) in a generic setting, the obtained results are comparable to and in some cases better than many of the baseline results, particularly for the cases when geometric structure plays a significant role.
The rapid growth in the size of Graph Convolutional Neural Networks (GCNs) encounters both computational- and memory-wall on classical computing platforms (e.g., CPU, GPU, FPGA, etc.). Quantum computing, on the other hand, provides extremely high parallelism for computation. Although quantum neural networks have been recently studied, the research on quantum graph neural networks is still in its infancy. The key challenge here is how to integrate both the graph topology information and the learning ability of GCNs into quantum circuits. In this work, we leverage the Givens rotations and its quantum implementation to encode graph information; in addition, we employ the widely used variational quantum circuit to bring the learnable parameters. On top of these, we present a full-quantum design of Graph Convolutional Neural Networks, namely "QuGCN", for semi-supervised learning on graph-structured data. Experiment results show our design is competitive with classical GCNs in terms of node classification accuracy on Cora sub-dataset. More importantly, we show the potential advantages that can be achieved by the proposed quantum GCN design when the number of features grows.