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

International Conference on Information Networking

A Tutorial on Quantum Graph Recurrent Neural Network (QGRNN)

Jaeho Choi, Seunghyeok Oh, Joongheon Kim

Published Jan 13, 2021• 23 citations
Publisher

Abstract

Over the past decades, various neural networks have been proposed with the rapid development of the machine learning field. In particular, graph neural networks using feature-vectors assigned to nodes and edges have been attracting attention in various fields. The usefulness of graph neural networks also affected the field of quantum computing, which led to the birth of quantum graph neural networks composed of parameterized quantum circuits. The quantum graph neural networks have many possibilities as applications from the simulation perspective of quantum dynamics. Among the application models of various quantum graph neural networks, the quantum graph recurrent neural network (QGRNN) is proven to be effective in training the Ising model Hamiltonian. Thus, this paper introduces the concepts of the Ising model, variational quantum eigensolver (VQE) for preparing quantum data, and QGRNN from a software engineer's point of view.

DOI
10.1109/icoin50884.2021.9333917

Related papers

Quantum Graph Neural Networks

Guillaume Verdon, Trevor McCourt, Luzhnica, Enxhell +3 more

We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed quantum systems over a quantum network. Along with this general class of ansatze, we introduce further specialized architectures, namely, Quantum Graph Recurrent Neural Networks (QGRNN) and Quantum Graph Convolutional Neural Networks (QGCNN). We provide four example applications of QGNNs: learning Hamiltonian dynamics of quantum systems, learning how to create multipartite entanglement in a quantum network, unsupervised learning for spectral clustering, and supervised learning for graph isomorphism classification.

arXiv:1909.12264•Sep 26, 2019•210 citations

The Quantum Graph Recurrent Neural Network

Pramoda Medisetty, Leela Krishna Kumar Pallapothu, Poorna Chand Evuru +3 more

Machine learning that combines the power of graph neural networks has its own significance in developing quick report analysis for various dynamic data which traditional statistical models may not be able to accomplish. Alongside the use of Quantum Computing in Neural Networks have become increasingly important over the years due to their ability to learn and process complex patterns. The Importance of QNN lies in the approaches it follows like entanglement, interference multiple super positional states, parallel computing, and backpropagation trainings which cannot be possible for Classical Neural Networks to work with. Also, the QNN, GNN integrates with the Quantum Machine Learning techniques like PennyLane that acts as an OpenShift framework to execute the optimized, trained algorithms for quick computational outcomes. This paper contains the use of Quantum Neural Networking, Quantum Machine Learning.

International Conference On Smart Technologies For Smart Nation (SmartTechCon)•Aug 18, 2023•3 citations

Feature prediction in quantum graph recurrent neural networks with applications in information hiding

Jawaher Kaldari, Saif M. Al-Kuwari

Abstract Graphs are fundamental structures for representing complex, nonlinear structured data across various domains, including social networks and quantum systems. Quantum graph recurrent neural networks (QGRNNs) have been proposed to model quantum dynamics in graph-based quantum systems, but their applicability to classical data remains an open problem. In this paper, we leverage QGRNNs to process classical graph-structured data. In particular, we demonstrate how QGRNN can reconstruct node features in classical datasets. Our results show that QGRNN achieves high feature reconstruction accuracy, resulting in near-perfect classification. Furthermore, we propose an information hiding technique based on our QGRNN, where messages are embedded into a graph and then retrieved under certain conditions. We assess retrieval accuracy for different dictionary sizes and message lengths, showing that QGRNN maintains high retrieval accuracy, with minor degradation as complexity increases. These findings demonstrate the scalability and robustness of QGRNNs for both classical data processing and secure information hiding, paving the way toward quantum-enhanced feature extraction, privacy-preserving computations, and quantum steganography.

arXiv:2506.23144•Quantum Information Processing•Feb 6, 2026•0 citations

Graph Neural Networks for Quantum State Simulation

Jincheng Zhang

Quantum state simulation is a cornerstone of quantum computing, aiming to accurately represent and manipulate the behavior of quantum systems. However, traditional methods of quantum state simulation, such as the Density Matrix Renormalization Group (DMRG) method and the Variational Quantum Eigensolver (VQE), often suffer from significant computational challenges, particularly as the size of the quantum system increases. This paper proposes a novel approach to quantum state simulation leveraging the power of Graph Neural Networks (GNNs). We represent a quantum state as a graph, where nodes correspond to individual quantum states and edges represent the correlations between them. A GNN is then trained to learn the complex relationships within the quantum state, enabling efficient and scalable simulation. Our method significantly reduces the computational burden associated with traditional techniques, offering a promising path towards practical quantum state simulation. The core claim is the utilization of graph neural networks' structural information for efficient quantum state simulation. The core mechanism involves representing quantum states as nodes in a graph and employing GNNs to learn relationships between them, facilitating efficient quantum state simulation.

•Sep 3, 2026•0 citations

Quantum Neural Network Classifiers: A Tutorial

Weikang Li, Zhide Lu, Dong-Ling Deng

Machine learning has achieved dramatic success over the past decade, with applications ranging from face recognition to natural language processing. Meanwhile, rapid progress has been made in the field of quantum computation including developing both powerful quantum algorithms and advanced quantum devices. The interplay between machine learning and quantum physics holds the intriguing potential for bringing practical applications to the modern society. Here, we focus on quantum neural networks in the form of parameterized quantum circuits. We will mainly discuss different structures and encoding strategies of quantum neural networks for supervised learning tasks, and benchmark their performance utilizing Yao.jl, a quantum simulation package written in Julia Language. The codes are efficient, aiming to provide convenience for beginners in scientific works such as developing powerful variational quantum learning models and assisting the corresponding experimental demonstrations.

arXiv:2206.02806•SciPost Physics Lecture Notes•Aug 17, 2022•58 citations

QGHNN: A Quantum Graph Hamiltonian Neural Network

Wenxuan Wang, Jinjing Shi, Nan Guan +2 more

Representing and learning from graphs is essential for developing effective machine learning models tailored to non-Euclidean data. While Graph Neural Networks (GNNs) strive to address the challenges posed by complex, high-dimensional graph data, Quantum Neural Networks (QNNs) present a compelling alternative due to their potential for quantum parallelism. However, much of the current QNN research tends to overlook the vital connection between quantum state encoding and graph structures, which limits the full exploitation of quantum computational advantages. To address these challenges, this paper introduces a quantum graph Hamiltonian neural network (QGHNN) to enhance graph representation and learning on noisy intermediate-scale quantum computers. Concretely, a quantum graph Hamiltonian learning method (QGHL) is first created by mapping graphs to the Hamiltonian of the topological quantum system. Then, QGHNN based on QGHL is presented, which trains parameters by minimizing the loss function and uses the gradient descent method to learn the graph. Experiments on the PennyLane quantum platform reveal that QGHNN outperforms all assessment metrics, achieving the lowest mean squared error of0.004and the maximum cosine similarity of99.8%, which shows that QGHNN not only excels in representing and learning graph information, but it also has high robustness ability. QGHNN can reduce the impact of quantum channel noise and has significant potential application in future research of quantum knowledge graphs and recommendation systems.

arXiv:2501.07986•IEEE Transactions on Emerging Topics in Computational Intelligence•Sep 8, 2025•8 citations
Over the past decades, various neural networks have been proposed with the rapid development of the machine learning field. In particular, graph neural networks using feature-vectors assigned to nodes and edges have been attracting attention in various fields. The usefulness of graph neural networks also affected the field of quantum computing, which led to the birth of quantum graph neural networks composed of parameterized quantum circuits. The quantum graph neural networks have many possibilities as applications from the simulation perspective of quantum dynamics. Among the application models of various quantum graph neural networks, the quantum graph recurrent neural network (QGRNN) is proven to be effective in training the Ising model Hamiltonian. Thus, this paper introduces the concepts of the Ising model, variational quantum eigensolver (VQE) for preparing quantum data, and QGRNN from a software engineer's point of view.
We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed quantum systems over a quantum network. Along with this general class of ansatze, we introduce further specialized architectures, namely, Quantum Graph Recurrent Neural Networks (QGRNN) and Quantum Graph Convolutional Neural Networks (QGCNN). We provide four example applications of QGNNs: learning Hamiltonian dynamics of quantum systems, learning how to create multipartite entanglement in a quantum network, unsupervised learning for spectral clustering, and supervised learning for graph isomorphism classification.
Machine learning that combines the power of graph neural networks has its own significance in developing quick report analysis for various dynamic data which traditional statistical models may not be able to accomplish. Alongside the use of Quantum Computing in Neural Networks have become increasingly important over the years due to their ability to learn and process complex patterns. The Importance of QNN lies in the approaches it follows like entanglement, interference multiple super positional states, parallel computing, and backpropagation trainings which cannot be possible for Classical Neural Networks to work with. Also, the QNN, GNN integrates with the Quantum Machine Learning techniques like PennyLane that acts as an OpenShift framework to execute the optimized, trained algorithms for quick computational outcomes. This paper contains the use of Quantum Neural Networking, Quantum Machine Learning.
Abstract Graphs are fundamental structures for representing complex, nonlinear structured data across various domains, including social networks and quantum systems. Quantum graph recurrent neural networks (QGRNNs) have been proposed to model quantum dynamics in graph-based quantum systems, but their applicability to classical data remains an open problem. In this paper, we leverage QGRNNs to process classical graph-structured data. In particular, we demonstrate how QGRNN can reconstruct node features in classical datasets. Our results show that QGRNN achieves high feature reconstruction accuracy, resulting in near-perfect classification. Furthermore, we propose an information hiding technique based on our QGRNN, where messages are embedded into a graph and then retrieved under certain conditions. We assess retrieval accuracy for different dictionary sizes and message lengths, showing that QGRNN maintains high retrieval accuracy, with minor degradation as complexity increases. These findings demonstrate the scalability and robustness of QGRNNs for both classical data processing and secure information hiding, paving the way toward quantum-enhanced feature extraction, privacy-preserving computations, and quantum steganography.
Quantum state simulation is a cornerstone of quantum computing, aiming to accurately represent and manipulate the behavior of quantum systems. However, traditional methods of quantum state simulation, such as the Density Matrix Renormalization Group (DMRG) method and the Variational Quantum Eigensolver (VQE), often suffer from significant computational challenges, particularly as the size of the quantum system increases. This paper proposes a novel approach to quantum state simulation leveraging the power of Graph Neural Networks (GNNs). We represent a quantum state as a graph, where nodes correspond to individual quantum states and edges represent the correlations between them. A GNN is then trained to learn the complex relationships within the quantum state, enabling efficient and scalable simulation. Our method significantly reduces the computational burden associated with traditional techniques, offering a promising path towards practical quantum state simulation. The core claim is the utilization of graph neural networks' structural information for efficient quantum state simulation. The core mechanism involves representing quantum states as nodes in a graph and employing GNNs to learn relationships between them, facilitating efficient quantum state simulation.
Machine learning has achieved dramatic success over the past decade, with applications ranging from face recognition to natural language processing. Meanwhile, rapid progress has been made in the field of quantum computation including developing both powerful quantum algorithms and advanced quantum devices. The interplay between machine learning and quantum physics holds the intriguing potential for bringing practical applications to the modern society. Here, we focus on quantum neural networks in the form of parameterized quantum circuits. We will mainly discuss different structures and encoding strategies of quantum neural networks for supervised learning tasks, and benchmark their performance utilizing Yao.jl, a quantum simulation package written in Julia Language. The codes are efficient, aiming to provide convenience for beginners in scientific works such as developing powerful variational quantum learning models and assisting the corresponding experimental demonstrations.
Representing and learning from graphs is essential for developing effective machine learning models tailored to non-Euclidean data. While Graph Neural Networks (GNNs) strive to address the challenges posed by complex, high-dimensional graph data, Quantum Neural Networks (QNNs) present a compelling alternative due to their potential for quantum parallelism. However, much of the current QNN research tends to overlook the vital connection between quantum state encoding and graph structures, which limits the full exploitation of quantum computational advantages. To address these challenges, this paper introduces a quantum graph Hamiltonian neural network (QGHNN) to enhance graph representation and learning on noisy intermediate-scale quantum computers. Concretely, a quantum graph Hamiltonian learning method (QGHL) is first created by mapping graphs to the Hamiltonian of the topological quantum system. Then, QGHNN based on QGHL is presented, which trains parameters by minimizing the loss function and uses the gradient descent method to learn the graph. Experiments on the PennyLane quantum platform reveal that QGHNN outperforms all assessment metrics, achieving the lowest mean squared error of0.004and the maximum cosine similarity of99.8%, which shows that QGHNN not only excels in representing and learning graph information, but it also has high robustness ability. QGHNN can reduce the impact of quantum channel noise and has significant potential application in future research of quantum knowledge graphs and recommendation systems.