Feature Prediction in Quantum Graph Recurrent Neural Networks with Applications in Information Hiding

• URL: http://arxiv.org/abs/2506.23144v1
• Date: Sun, 29 Jun 2025 08:49:56 GMT
• Title: Feature Prediction in Quantum Graph Recurrent Neural Networks with Applications in Information Hiding
• Authors: Jawaher Kaldari, Saif Al-Kuwari,
• Abstract summary: We leverage Quantum Graph Recurrent Neural Networks (QGRNNs) to process classical graph-structured data.<n>Our results show that QGRNN high feature reconstruction accuracy, leading to near-perfect classification.<n>We also propose an information hiding technique based on our QGRNN, where messages are embedded into a graph, then retrieved under certain conditions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graphs are a fundamental representation of 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, leading to near-perfect classification. Furthermore, we propose an information hiding technique based on our QGRNN, where messages are embedded into a graph, 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 for quantum-enhanced feature extraction, privacy-preserving computations, and quantum steganography.

Related papers

• Guided Graph Compression for Quantum Graph Neural Networks [0.7421845364041001]
  This work introduces the Guided Graph Compression (GGC) framework, which uses a graph autoencoder to reduce both the number of nodes and the dimensionality of node features.<n>The framework is evaluated on the Jet Tagging task, a classification problem of fundamental importance in high energy physics.
  arXiv  Detail & Related papers  (2025-06-11T15:36:29Z)
• Inductive Graph Representation Learning with Quantum Graph Neural Networks [0.40964539027092917]
  Quantum Graph Neural Networks (QGNNs) present a promising approach for combining quantum computing with graph-structured data processing.<n>We propose a versatile QGNN framework inspired by the classical GraphSAGE approach, utilizing quantum models as aggregators.<n>We show that our quantum approach exhibits robust generalization across molecules with varying numbers of atoms without requiring circuit modifications.
  arXiv  Detail & Related papers  (2025-03-31T14:04:08Z)
• QGHNN: A quantum graph Hamiltonian neural network [30.632260870411177]
  Graph Neural Networks (GNNs) strive to address the challenges posed by complex, high-dimensional graph data.<n>Quantum Neural Networks (QNNs) present a compelling alternative due to their potential for quantum parallelism.<n>This paper introduces a quantum graph Hamiltonian neural network (QGHNN) to enhance graph representation and learning on noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2025-01-14T10:15:17Z)
• From Graphs to Qubits: A Critical Review of Quantum Graph Neural Networks [56.51893966016221]
  Quantum Graph Neural Networks (QGNNs) represent a novel fusion of quantum computing and Graph Neural Networks (GNNs) This paper critically reviews the state-of-the-art in QGNNs, exploring various architectures. We discuss their applications across diverse fields such as high-energy physics, molecular chemistry, finance and earth sciences, highlighting the potential for quantum advantage.
  arXiv  Detail & Related papers  (2024-08-12T22:53:14Z)
• Learnability of a hybrid quantum-classical neural network for graph-structured quantum data [0.0]
  We build a hybrid quantum-classical neural network with deep residual learning (Res-HQCNN) with graph-structured quantum data. We show that the using of information about graph structures in quantum data can lead to better learning efficiency compared with the state-of-the-art model.
  arXiv  Detail & Related papers  (2024-01-28T14:06:06Z)
• DEGREE: Decomposition Based Explanation For Graph Neural Networks [55.38873296761104]
  We propose DEGREE to provide a faithful explanation for GNN predictions. By decomposing the information generation and aggregation mechanism of GNNs, DEGREE allows tracking the contributions of specific components of the input graph to the final prediction. We also design a subgraph level interpretation algorithm to reveal complex interactions between graph nodes that are overlooked by previous methods.
  arXiv  Detail & Related papers  (2023-05-22T10:29:52Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Learnable Filters for Geometric Scattering Modules [64.03877398967282]
  We propose a new graph neural network (GNN) module based on relaxations of recently proposed geometric scattering transforms. Our learnable geometric scattering (LEGS) module enables adaptive tuning of the wavelets to encourage band-pass features to emerge in learned representations.
  arXiv  Detail & Related papers  (2022-08-15T22:30:07Z)
• Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
  We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN) egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. The architecture is based on a novel mapping from real-world data to Hilbert space.
  arXiv  Detail & Related papers  (2022-01-13T16:35:45Z)
• Data-Driven Learning of Geometric Scattering Networks [74.3283600072357]
  We propose a new graph neural network (GNN) module based on relaxations of recently proposed geometric scattering transforms. Our learnable geometric scattering (LEGS) module enables adaptive tuning of the wavelets to encourage band-pass features to emerge in learned representations.
  arXiv  Detail & Related papers  (2020-10-06T01:20:27Z)
• A Unified View on Graph Neural Networks as Graph Signal Denoising [49.980783124401555]
  Graph Neural Networks (GNNs) have risen to prominence in learning representations for graph structured data. In this work, we establish mathematically that the aggregation processes in a group of representative GNN models can be regarded as solving a graph denoising problem. We instantiate a novel GNN model, ADA-UGNN, derived from UGNN, to handle graphs with adaptive smoothness across nodes.
  arXiv  Detail & Related papers  (2020-10-05T04:57:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.