Robust aerial localization in GNSS-denied environments is a critical challenge for autonomous navigation. This paper introduces a hybrid Quantum-Classical Graph Neural Network (QGNN) framework for visual localization, treating the task as an approximate subgraph matching problem robust to structural perturbations. We propose and evaluate two architectures for integrating quantum feature maps into a classical graph convolution backbone: a hardware-efficient global projection, where a single quantum circuit processes the pooled graph embedding, and a structurally expressive local projection, where quantum circuits are applied to individual node embeddings prior to aggregation. The models are trained via triplet loss on geospatial graphs constructed from the Massachusetts Buildings dataset. We demonstrate that while global methods are computationally tractable on current IBM Quantum hardware, the local quantum-classical hybrid significantly outperforms classical baselines in high-noise regimes. Specifically, the local quantum architecture improves Recall@1 by up to 20 percentage points under severe structural perturbations (e.g., node deletions and additions), suggesting that node-level quantum feature mapping provides improved regularization against topological noise.
Robust aerial localization in GNSS-denied environments is a critical challenge for autonomous navigation. This paper introduces a hybrid Quantum-Classical Graph Neural Network (QGNN) framework for visual localization, treating the task as an approximate subgraph matching problem robust to structural perturbations. We propose and evaluate two architectures for integrating quantum feature maps into a classical graph convolution backbone: a hardware-efficient global projection, where a single quantum circuit processes the pooled graph embedding, and a structurally expressive local projection, where quantum circuits are applied to individual node embeddings prior to aggregation. The models are trained via triplet loss on geospatial graphs constructed from the Massachusetts Buildings dataset. We demonstrate that while global methods are computationally tractable on current IBM Quantum hardware, the local quantum-classical hybrid significantly outperforms classical baselines in high-noise regimes. Specifically, the local quantum architecture improves Recall@1 by up to 20 percentage points under severe structural perturbations (e.g., node deletions and additions), suggesting that node-level quantum feature mapping provides improved regularization against topological noise.
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.
ABSTRACT In the node classification task on graphs, mainstream graph neural networks often adopt the same neighborhood aggregation strategy for all nodes. This approach results in biased learning toward features from the majority nodes while devaluing those from the minority nodes under class imbalance. In particular, for marginal nodes, limited neighboring information can severely impact classification performance. To address this challenge, this paper proposes a feature fusion‐based hybrid quantum‐classical graph residual neural network (QGRNN). Leveraging the nonlinear expressive capacity of qubits in modeling complex feature interactions, the model innovatively integrates a structure‐driven node selection mechanism with a quantum feature enhancement module, while also dynamically fusing classical features and Hamiltonian expectation values through a gated residual fusion mechanism to compensate for representational deficiencies of marginal nodes overlooked by classical methods. Experimental results show that QGRNN consistently outperforms baselines across a range of node classification tasks. In binary and ternary classification settings, it exhibits strong discriminative capability and robustness, especially maintaining high accuracy under severe class imbalance. In addition, QGRNN also demonstrates strong generality in other tasks, in recommendation scenarios, achieving an average improvement of 36.3% on NDCG@5, 44.3% on Recall@5, and 21.9% on Recall@10 compared to the baseline.
Graph Neural Networks (GNNs) are now one of the key tools to model relational and non-Euclidean data in multiagent systems, infrastructure networks and even molecular modeling applications. Nevertheless, in very dense or noisy graph topologies, classical message-passing architectures may experience scalability and representational degeneration, especially due to over-smoothing and insufficient higher-order dependency information. The recent developments in quantum machine learning indicate that hybrid quantum-classical models can also provide an alternative feature representation by projecting relational data to parameterized quantum circuits. This article presents a Quantum-Enhanced Graph Neural Network (QGNN) architecture that extends variational quantum circuits with graph learning pipelines, based on classical learning. Parameters are represented as parameterized qubits, and relational dependencies are represented as structured entanglement mappings. We benchmark the regimes where quantum-enhanced relational encoding proves to be more robust and stable through the swarm coordination, molecular property prediction, and financial transaction network. We also elaborate on the issue of scalability, hardware issues, and practical aspects of near-term hybrid implementations and give a critical view of the changing role of quantum methods in computational intelligence systems.
Graph Neural Networks (GNNs) achieve state-of-the-art performance on graph-structured data, but training and inference on large graphs are often bottlenecked by memory constraints and sparse linear-algebra workloads. Quantum computing offers an alternative set of primitives that may improve scalability for graph learning. Building on the quantum graph neural network (QGNN) framework of Liao \textit{et al.}, this work implements two representative architectures --- the Simplified Graph Convolution (SGC) and Linear Graph Convolution (LGC) models --- and evaluates them on open benchmark graph datasets and semi-supervised learning tasks using quantum simulation. We compare predictive performance and optimization behavior against classical baselines, showing that the quantum models achieve competitive performance with fewer parameters. Finally, we present a cost gradient analysis that identifies the tasks for which the models showcased are trainable. This is followed by a classical simulability study to find regimes in which the proposed circuits remain robust during training.
Graph Neural Networks (GNNs) are now one of the key tools to model relational and non-Euclidean data in multiagent systems, infrastructure networks and even molecular modeling applications. Nevertheless, in very dense or noisy graph topologies, classical message-passing architectures may experience scalability and representational degeneration, especially due to over-smoothing and insufficient higher-order dependency information. The recent developments in quantum machine learning indicate that hybrid quantum-classical models can also provide an alternative feature representation by projecting relational data to parameterized quantum circuits. This article presents a Quantum-Enhanced Graph Neural Network (QGNN) architecture that extends variational quantum circuits with graph learning pipelines, based on classical learning. Parameters are represented as parameterized qubits, and relational dependencies are represented as structured entanglement mappings. We benchmark the regimes where quantum-enhanced relational encoding proves to be more robust and stable through the swarm coordination, molecular property prediction, and financial transaction network. We also elaborate on the issue of scalability, hardware issues, and practical aspects of near-term hybrid implementations and give a critical view of the changing role of quantum methods in computational intelligence systems.
Graph neural networks (GNNs) are a powerful framework for learning representations from graph-structured data, but their direct implementation on near-term quantum hardware remains challenging due to circuit depth, multi-qubit interactions, and qubit scalability constraints. In this work, we introduce a hybrid quantum graph learning architecture designed explicitly for unsupervised learning in the noisy intermediate-scale quantum (NISQ) regime. Our approach combines a variational quantum feature extraction layer with an edge-local and qubit-efficient quantum message-passing mechanism inspired by the Quantum Alternating Operator Ansatz (QAOA) framework. The message-passing operation is decomposed into pairwise interactions along graph edges using standard single- and two-qubit gates. For a graph with N nodes and n-qubit feature registers, this reduces the number of qubits required at one time from Nn to at most 2n. We train the model using the Deep Graph Infomax objective to perform unsupervised node representation learning. The external class labels are not used during graph construction or training and are used only to evaluate the learned embeddings. Experiments on the Cora citation network and the Phase 3 release of the 1000 Genomes Project show that the quantum edge interaction contributes to the quality of the learned node representations.