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:2507.05640

Learnable quantum spectral filters for hybrid graph neural networks

Ammar Daskin

Published Oct 15, 2025• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.21203/rs.3.rs-7070859/v1

Related papers

Novel Architecture of Parameterized Quantum Circuit for Graph Convolutional Network

Yanhu Chen, Cen Wang, Hongxiang Guo +1 more

Recently, the implementation of quantum neural networks is based on noisy intermediate-scale quantum (NISQ) devices. Parameterized quantum circuit (PQC) is such the method, and its current design just can handle linear data classification. However, data in the real world often shows a topological structure. In the machine learning field, the classical graph convolutional layer (GCL)-based graph convolutional network (GCN) can well handle the topological data. Inspired by the architecture of a classical GCN, in this paper, to expand the function of the PQC, we design a novel PQC architecture to realize a quantum GCN (QGCN). More specifically, we first implement an adjacent matrix based on linear combination unitary and a weight matrix in a quantum GCL, and then by stacking multiple GCLs, we obtain the QGCN. In addition, we first achieve gradients decent on quantum circuit following the parameter-shift rule for a GCL and then for the QGCN. We evaluate the performance of the QGCN by conducting a node classification task on Cora dataset with topological data. The numerical simulation result shows that QGCN has the same performance as its classical counterpart, the GCN, in contrast, requires less tunable parameters. Compared to a traditional PQC, we also verify that deploying an extra adjacent matrix can significantly improve the classification performance for quantum topological data.

arXiv:2203.03251•Mar 7, 2022•1 citation

Output prediction of quantum circuits based on graph neural networks

Yuxiang Liu, Fanxu Meng, Lu Wang +3 more

The output prediction of quantum circuits is a formidably challenging task imperative in developing quantum devices. Motivated by the natural graph representation of quantum circuits, this paper proposes a Graph Neural Networks (GNNs)-based framework to predict the output expectation values of quantum circuits under noisy and noiseless conditions and compare the performance of different parameterized quantum circuits (PQCs). We construct datasets under noisy and noiseless conditions using a non-parameterized quantum gate set to predict circuit expectation values. The node feature vectors for GNNs are specifically designed to include noise information. In our simulations, we compare the prediction performance of GNNs in both noisy and noiseless conditions against Convolutional Neural Networks (CNNs) on the same dataset and their qubit scalability. GNNs demonstrate superior prediction accuracy across diverse conditions. Subsequently, we utilize the parameterized quantum gate set to construct noisy PQCs and compute the ground state energy of hydrogen molecules using the Variational Quantum Eigensolver (VQE). We propose two schemes: the Indirect Comparison scheme, which involves directly predicting the ground state energy and subsequently comparing circuit performances, and the Direct Comparison scheme, which directly predicts the relative performance of the two circuits. Simulation results indicate that the Direct Comparison scheme significantly outperforms the Indirect Comparison scheme by an average of 36.2% on the same dataset, providing a new and effective perspective for using GNNs to predict the overall properties of PQCs, specifically by focusing on their performance differences.

arXiv:2504.00464•Frontiers of Physics•Dec 3, 2025•4 citations

An Image Classification Algorithm Based on Hybrid Quantum Classical Convolutional Neural Network

Wei Li, Peng-Cheng Chu, Guang-Zhe Liu +3 more

Quantum machine learning is emerging as a strategy to solve real-world problems. As a quantum computing model, parameterized quantum circuits provide an approach for constructing quantum machine learning algorithms, which may either realize computational acceleration or achieve better algorithm performance than classical algorithms. Based on the parameterized quantum circuit, we propose a hybrid quantum-classical convolutional neural network (HQCCNN) model for image classification that comprises both quantum and classical components. The quantum convolutional layer is designed using a parameterized quantum circuit. It is used to perform linear unitary transformation on the quantum state to extract hidden information. In addition, the quantum pooling unit is used to perform pooling operations. After the evolution of the quantum system, we measure the quantum state and input the measurement results into a classical fully connected layer for further processing. We demonstrate its potential by applying HQCCNN to the MNIST dataset. Compared to a convolutional neural network in a similar architecture, the results reveal that HQCCNN has a faster training speed and higher testing set accuracy than a convolutional neural network.

Quantum Engineering•Jul 14, 2022•51 citations

Inductive Graph Representation Learning with Quantum Graph Neural Networks

Arthur Mendonça Faria, Ignacio Fernández Graña, Savvas Varsamopoulos

Graph Neural Networks (QGNNs) offer a promising approach to combining quantum computing with graph-structured data processing. While classical Graph Neural Networks (GNNs) are scalable and robust, existing QGNNs often lack flexibility due to graph-specific quantum circuit designs, limiting their applicability to diverse real-world problems. To address this, we propose a versatile QGNN framework inspired by GraphSAGE, using quantum models as aggregators to generate quantum-native node embeddings. We integrate inductive representation learning techniques with parameterized quantum convolutional and pooling layers, bridging classical and quantum paradigms. The convolutional layer is flexible, allowing tailored designs for specific tasks. Benchmarked on a node regression task with the QM9 dataset, our framework, using a single minimal circuit for all aggregation steps, handles molecules with varying numbers of atoms without changing qubits or circuit architecture. While classical GNNs achieve higher training performance, our quantum approach remains competitive and often shows enhanced generalization as molecular complexity increases. We also observe faster learning in early training epochs. To mitigate trainability limitations of a single-circuit setup, we extend the framework with multiple quantum aggregators on QM9. Assigning distinct circuits to each hop substantially improves training performance across all cases. Additionally, we numerically demonstrate the absence of barren plateaus as qubit numbers increase, suggesting that the proposed model remains trainable to larger, more complex graph-based problems.

arXiv:2503.24111•Mar 31, 2025•0 citations

A Quantum Spatial Graph Convolutional Neural Network Model on Quantum Circuits

Jin Yan Zheng, Qing Zhong Gao, MACIEJ J. OGORZAŁEK +2 more

This article proposes a quantum spatial graph convolutional neural network (QSGCN) model that is implementable on quantum circuits, providing a novel avenue to processing non-Euclidean type data based on the state-of-the-art parameterized quantum circuit (PQC) computing platforms. Four basic blocks are constructed to formulate the whole QSGCN model, including the quantum encoding, the quantum graph convolutional layer, the quantum graph pooling layer, and the network optimization. In particular, the trainability of the QSGCN model is analyzed through discussions on the barren plateau phenomenon. Simulation results from various types of graph data are presented to demonstrate the learning, generalization, and robustness capabilities of the proposed quantum neural network (QNN) model.

IEEE Transactions on Neural Networks and Learning Systems•Apr 15, 2024•33 citations

Analysis of learnability of a novel hybrid quantum–classical convolutional neural network in image classification

Tao 涛 Cheng 程, Run-Sheng Zhao, Shuang 爽 Wang 王 +2 more

We design a new hybrid quantum–classical convolutional neural network (HQCCNN) model based on parameter quantum circuits. In this model, we use parameterized quantum circuits (PQCs) to redesign the convolutional layer in classical convolutional neural networks, forming a new quantum convolutional layer to achieve unitary transformation of quantum states, enabling the model to more accurately extract hidden information from images. At the same time, we combine the classical fully connected layer with PQCs to form a new hybrid quantum–classical fully connected layer to further improve the accuracy of classification. Finally, we use the MNIST dataset to test the potential of the HQCCNN. The results indicate that the HQCCNN has good performance in solving classification problems. In binary classification tasks, the classification accuracy of numbers 5 and 7 is as high as 99.71%. In multivariate classification, the accuracy rate also reaches 98.51%. Finally, we compare the performance of the HQCCNN with other models and find that the HQCCNN has better classification performance and convergence speed.

Chinese Physics B•Dec 28, 2023•8 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.
Recently, the implementation of quantum neural networks is based on noisy intermediate-scale quantum (NISQ) devices. Parameterized quantum circuit (PQC) is such the method, and its current design just can handle linear data classification. However, data in the real world often shows a topological structure. In the machine learning field, the classical graph convolutional layer (GCL)-based graph convolutional network (GCN) can well handle the topological data. Inspired by the architecture of a classical GCN, in this paper, to expand the function of the PQC, we design a novel PQC architecture to realize a quantum GCN (QGCN). More specifically, we first implement an adjacent matrix based on linear combination unitary and a weight matrix in a quantum GCL, and then by stacking multiple GCLs, we obtain the QGCN. In addition, we first achieve gradients decent on quantum circuit following the parameter-shift rule for a GCL and then for the QGCN. We evaluate the performance of the QGCN by conducting a node classification task on Cora dataset with topological data. The numerical simulation result shows that QGCN has the same performance as its classical counterpart, the GCN, in contrast, requires less tunable parameters. Compared to a traditional PQC, we also verify that deploying an extra adjacent matrix can significantly improve the classification performance for quantum topological data.
The output prediction of quantum circuits is a formidably challenging task imperative in developing quantum devices. Motivated by the natural graph representation of quantum circuits, this paper proposes a Graph Neural Networks (GNNs)-based framework to predict the output expectation values of quantum circuits under noisy and noiseless conditions and compare the performance of different parameterized quantum circuits (PQCs). We construct datasets under noisy and noiseless conditions using a non-parameterized quantum gate set to predict circuit expectation values. The node feature vectors for GNNs are specifically designed to include noise information. In our simulations, we compare the prediction performance of GNNs in both noisy and noiseless conditions against Convolutional Neural Networks (CNNs) on the same dataset and their qubit scalability. GNNs demonstrate superior prediction accuracy across diverse conditions. Subsequently, we utilize the parameterized quantum gate set to construct noisy PQCs and compute the ground state energy of hydrogen molecules using the Variational Quantum Eigensolver (VQE). We propose two schemes: the Indirect Comparison scheme, which involves directly predicting the ground state energy and subsequently comparing circuit performances, and the Direct Comparison scheme, which directly predicts the relative performance of the two circuits. Simulation results indicate that the Direct Comparison scheme significantly outperforms the Indirect Comparison scheme by an average of 36.2% on the same dataset, providing a new and effective perspective for using GNNs to predict the overall properties of PQCs, specifically by focusing on their performance differences.
Quantum machine learning is emerging as a strategy to solve real-world problems. As a quantum computing model, parameterized quantum circuits provide an approach for constructing quantum machine learning algorithms, which may either realize computational acceleration or achieve better algorithm performance than classical algorithms. Based on the parameterized quantum circuit, we propose a hybrid quantum-classical convolutional neural network (HQCCNN) model for image classification that comprises both quantum and classical components. The quantum convolutional layer is designed using a parameterized quantum circuit. It is used to perform linear unitary transformation on the quantum state to extract hidden information. In addition, the quantum pooling unit is used to perform pooling operations. After the evolution of the quantum system, we measure the quantum state and input the measurement results into a classical fully connected layer for further processing. We demonstrate its potential by applying HQCCNN to the MNIST dataset. Compared to a convolutional neural network in a similar architecture, the results reveal that HQCCNN has a faster training speed and higher testing set accuracy than a convolutional neural network.
Graph Neural Networks (QGNNs) offer a promising approach to combining quantum computing with graph-structured data processing. While classical Graph Neural Networks (GNNs) are scalable and robust, existing QGNNs often lack flexibility due to graph-specific quantum circuit designs, limiting their applicability to diverse real-world problems. To address this, we propose a versatile QGNN framework inspired by GraphSAGE, using quantum models as aggregators to generate quantum-native node embeddings. We integrate inductive representation learning techniques with parameterized quantum convolutional and pooling layers, bridging classical and quantum paradigms. The convolutional layer is flexible, allowing tailored designs for specific tasks. Benchmarked on a node regression task with the QM9 dataset, our framework, using a single minimal circuit for all aggregation steps, handles molecules with varying numbers of atoms without changing qubits or circuit architecture. While classical GNNs achieve higher training performance, our quantum approach remains competitive and often shows enhanced generalization as molecular complexity increases. We also observe faster learning in early training epochs. To mitigate trainability limitations of a single-circuit setup, we extend the framework with multiple quantum aggregators on QM9. Assigning distinct circuits to each hop substantially improves training performance across all cases. Additionally, we numerically demonstrate the absence of barren plateaus as qubit numbers increase, suggesting that the proposed model remains trainable to larger, more complex graph-based problems.
This article proposes a quantum spatial graph convolutional neural network (QSGCN) model that is implementable on quantum circuits, providing a novel avenue to processing non-Euclidean type data based on the state-of-the-art parameterized quantum circuit (PQC) computing platforms. Four basic blocks are constructed to formulate the whole QSGCN model, including the quantum encoding, the quantum graph convolutional layer, the quantum graph pooling layer, and the network optimization. In particular, the trainability of the QSGCN model is analyzed through discussions on the barren plateau phenomenon. Simulation results from various types of graph data are presented to demonstrate the learning, generalization, and robustness capabilities of the proposed quantum neural network (QNN) model.
We design a new hybrid quantum–classical convolutional neural network (HQCCNN) model based on parameter quantum circuits. In this model, we use parameterized quantum circuits (PQCs) to redesign the convolutional layer in classical convolutional neural networks, forming a new quantum convolutional layer to achieve unitary transformation of quantum states, enabling the model to more accurately extract hidden information from images. At the same time, we combine the classical fully connected layer with PQCs to form a new hybrid quantum–classical fully connected layer to further improve the accuracy of classification. Finally, we use the MNIST dataset to test the potential of the HQCCNN. The results indicate that the HQCCNN has good performance in solving classification problems. In binary classification tasks, the classification accuracy of numbers 5 and 7 is as high as 99.71%. In multivariate classification, the accuracy rate also reaches 98.51%. Finally, we compare the performance of the HQCCNN with other models and find that the HQCCNN has better classification performance and convergence speed.