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

IEEE Communications Letters

Topology-Aware Quantum Graph Neural Networks for Sum-Rate Maximization in Fluid Antenna Systems

Okzata Recy, Bhaskara Narottama, Trung Q. Duong

Published Jan 1, 2026• 1 citation
Publisher

Abstract

This paper presents a quantum graph-based solution that leverages a quantum circuit to improve learning efficiency, towards maximizing the sum-rate of wireless communication with fluid antennas in dynamic environments. The employed quantum graph neural networks (QGNN) consists of three main blocks, including (i) a quantum encoding layer, (ii) a quantum graph neural network layer, and (iii) an optimizer layer, which collectively comprise the end-to-end learning workflow. The QGNN adjusts parameters through a quantum graph neural network layer, utilizing basic linear gates on a parameterized quantum circuit (PQC) platform. Additionally, the QGNN circuit is designed with shallow depth and optimized gate composition to reduce quantum resource usage and accelerate convergence during training. The results demonstrate that the proposed QGNN offers competitive performance relative to the existing PQC model. Furthermore, this paper highlights the versatility of quantum graph-based solutions for addressing dynamic, topology-aware wireless network problems.

DOI
10.1109/lcomm.2026.3652310

Related papers

Quantum Graph Neural Network for Joint Optimization of Pinching and Fluid Antenna Systems

Okzata Recy, Bhaskara Narottama, Simon L. Cotton +1 more

This work optimizes a flexible antenna environment, that incorporates both pinching antenna systems (PASS) and fluid antenna systems (FAS) at the transmitter and the user sides. Optimizing PASS and FAS presents a non-trivial challenge, as the wireless network exhibits a highly dynamic topology and an extensive solution search space. To address this, this work proposes a quantum graph neural network (QGNN)based solution workflow designed to optimize the user’s quality of service by learning the spatial and structural dependencies between the pinching antenna elements and user ports as a quantum state. The QGNN approach encodes the wireless network topology, encompassing both edge and vertex relationships, into the quantum state space, and performs optimization through a tunable single-qubit rotation gate. Overall, the QGNN-based solution shows a faster loss reduction, especially during the early learning episodes, compared to the benchmark model. The QGNN achieves an average training loss approximately 3.4× lower than that of the typical parameter quantum circuit model during model training. In summary, this work points out the feasibility of applying graph-based, data-driven learning, realized through the quantum graph neural network workflow, to the problem of flexible antenna optimization.

International Conference on Communications•May 24, 2026•0 citations

D2D Power Allocation via Quantum Graph Neural Network

Le Tung Giang, Nguyen Xuan Tung, Won–Joo Hwang

Increasing wireless network complexity demands scalable resource management. Classical GNNs excel at graph learning but incur high computational costs in large-scale settings. We present a fully quantum Graph Neural Network (QGNN) that implements message passing via Parameterized Quantum Circuits (PQCs). Our Quantum Graph Convolutional Layers (QGCLs) encode features into quantum states, process graphs with NISQ-compatible unitaries, and retrieve embeddings through measurement. Applied to D2D power control for SINR maximization, our QGNN matches classical performance with fewer parameters and inherent parallelism. This end-to-end PQC-based GNN marks a step toward quantum-accelerated wireless optimization.

arXiv:2511.15246•International Conference on Mobile Computing and Ubiquitous Network (ICMU)•Sep 10, 2025•1 citation

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•3 citations

Quantum Graph Neural Network for Resource Management in Wireless Communication

Le Tung Giang, Nguyen Xuan Tung, Won–Joo Hwang

Effective resource management in wireless communication systems is a critical requirement, given the interference challenges and the need for efficient allocation strategies. Graph Neural Networks (GNNs) have emerged as powerful tools for tackling this problem due to their scalability and ability to generalize over complex graph-structured data, like that found in wireless networks. However, the computational complexity of GNNs on large-scale systems limits their real-time deployment. Recent advances in quantum computing and quantum machine learning (QML) offer a promising solution by leveraging the unique properties of quantum systems to reduce computational overhead. This paper proposes a Quantum Graph Neural Network (QGNN) model specifically designed for a wireless communication scenario, implemented as a variational quantum circuit (VQC) to realize the message-passing mechanism integral to GNNs. Applied to a supervised resource management task in a wireless network, the proposed QGNN demonstrates encouraging results, showcasing its potential as a scalable and efficient approach for real-time resource management in future wireless systems.

International Conference on Artificial Intelligence in Information and Communication (ICAIIC)•Feb 18, 2025•8 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•42 citations

Scalable Quantum Message Passing Graph Neural Networks for Next-Generation Wireless Communications: Architectures, Use Cases, and Future Directions

Le Tung Giang, Nguyen Xuan Tung, Trinh Van Chien +2 more

Graph Neural Networks (GNNs) are eminently suitable for wireless resource management, thanks to their scalability, but they still face computational challenges in large-scale, dense networks on classical computers. The integration of quantum computing with GNNs offers a promising pathway for enhancing computational efficiency, because they may reduce the model complexity. This is achieved by leveraging the quantum advantages of parameterized quantum circuits (PQCs), while retaining the expressive power of GNNs. However, existing pure quantum message passing models remain constrained by the limited number of qubits, hence limiting the scalability of their application to wireless systems. As a remedy, we conceive a Scalable Quantum Message Passing Graph Neural Network (SQM-GNN) relying on a quantum message passing architecture. To address the aforementioned scalability issue, we decompose the graph into subgraphs and apply a shared PQC to each local subgraph. Importantly, the model incorporates both node and edge features, facilitating the full representation of the underlying wireless graph structure. We demonstrate the efficiency of SQM-GNN on a device-to-device (D2D) power control task, where it outperforms both classical GNNs and heuristic baselines. These results highlight SQM-GNN as a promising direction for future wireless network optimization.

arXiv:2601.18198•IEEE Network•Jan 1, 2026•1 citation
This paper presents a quantum graph-based solution that leverages a quantum circuit to improve learning efficiency, towards maximizing the sum-rate of wireless communication with fluid antennas in dynamic environments. The employed quantum graph neural networks (QGNN) consists of three main blocks, including (i) a quantum encoding layer, (ii) a quantum graph neural network layer, and (iii) an optimizer layer, which collectively comprise the end-to-end learning workflow. The QGNN adjusts parameters through a quantum graph neural network layer, utilizing basic linear gates on a parameterized quantum circuit (PQC) platform. Additionally, the QGNN circuit is designed with shallow depth and optimized gate composition to reduce quantum resource usage and accelerate convergence during training. The results demonstrate that the proposed QGNN offers competitive performance relative to the existing PQC model. Furthermore, this paper highlights the versatility of quantum graph-based solutions for addressing dynamic, topology-aware wireless network problems.
This work optimizes a flexible antenna environment, that incorporates both pinching antenna systems (PASS) and fluid antenna systems (FAS) at the transmitter and the user sides. Optimizing PASS and FAS presents a non-trivial challenge, as the wireless network exhibits a highly dynamic topology and an extensive solution search space. To address this, this work proposes a quantum graph neural network (QGNN)based solution workflow designed to optimize the user’s quality of service by learning the spatial and structural dependencies between the pinching antenna elements and user ports as a quantum state. The QGNN approach encodes the wireless network topology, encompassing both edge and vertex relationships, into the quantum state space, and performs optimization through a tunable single-qubit rotation gate. Overall, the QGNN-based solution shows a faster loss reduction, especially during the early learning episodes, compared to the benchmark model. The QGNN achieves an average training loss approximately 3.4× lower than that of the typical parameter quantum circuit model during model training. In summary, this work points out the feasibility of applying graph-based, data-driven learning, realized through the quantum graph neural network workflow, to the problem of flexible antenna optimization.
Increasing wireless network complexity demands scalable resource management. Classical GNNs excel at graph learning but incur high computational costs in large-scale settings. We present a fully quantum Graph Neural Network (QGNN) that implements message passing via Parameterized Quantum Circuits (PQCs). Our Quantum Graph Convolutional Layers (QGCLs) encode features into quantum states, process graphs with NISQ-compatible unitaries, and retrieve embeddings through measurement. Applied to D2D power control for SINR maximization, our QGNN matches classical performance with fewer parameters and inherent parallelism. This end-to-end PQC-based GNN marks a step toward quantum-accelerated wireless optimization.
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.
Effective resource management in wireless communication systems is a critical requirement, given the interference challenges and the need for efficient allocation strategies. Graph Neural Networks (GNNs) have emerged as powerful tools for tackling this problem due to their scalability and ability to generalize over complex graph-structured data, like that found in wireless networks. However, the computational complexity of GNNs on large-scale systems limits their real-time deployment. Recent advances in quantum computing and quantum machine learning (QML) offer a promising solution by leveraging the unique properties of quantum systems to reduce computational overhead. This paper proposes a Quantum Graph Neural Network (QGNN) model specifically designed for a wireless communication scenario, implemented as a variational quantum circuit (VQC) to realize the message-passing mechanism integral to GNNs. Applied to a supervised resource management task in a wireless network, the proposed QGNN demonstrates encouraging results, showcasing its potential as a scalable and efficient approach for real-time resource management in future wireless systems.
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.
Graph Neural Networks (GNNs) are eminently suitable for wireless resource management, thanks to their scalability, but they still face computational challenges in large-scale, dense networks on classical computers. The integration of quantum computing with GNNs offers a promising pathway for enhancing computational efficiency, because they may reduce the model complexity. This is achieved by leveraging the quantum advantages of parameterized quantum circuits (PQCs), while retaining the expressive power of GNNs. However, existing pure quantum message passing models remain constrained by the limited number of qubits, hence limiting the scalability of their application to wireless systems. As a remedy, we conceive a Scalable Quantum Message Passing Graph Neural Network (SQM-GNN) relying on a quantum message passing architecture. To address the aforementioned scalability issue, we decompose the graph into subgraphs and apply a shared PQC to each local subgraph. Importantly, the model incorporates both node and edge features, facilitating the full representation of the underlying wireless graph structure. We demonstrate the efficiency of SQM-GNN on a device-to-device (D2D) power control task, where it outperforms both classical GNNs and heuristic baselines. These results highlight SQM-GNN as a promising direction for future wireless network optimization.