Quantum computing holds significant potential for advancing machine learning, particularly in handling complex graph-structured data. This paper introduces Single-Qubit Quantum Graph Neural Networks (sQGNNs), a novel model that integrates quantum networks with quantum walk operations to improve generalization in graph learning tasks. By leveraging quantum walks, we demonstrated sQGNNs capture complex relational patterns and enhance network expressiveness beyond classical methods. Our results proved that quantum encoding efficiently represents high-dimensional graph data, preserving dependencies and optimizing memory use. Across benchmark datasets, sQGNNs demonstrate superior generalization and robustness against overfitting, achieving higher accuracy with reduced computational cost. Our results underscore sQGNNs’ promise for scalable, quantum-enhanced graph learning, establishing a foundation for future quantum-assisted machine learning applications.
Quantum computing holds significant potential for advancing machine learning, particularly in handling complex graph-structured data. This paper introduces Single-Qubit Quantum Graph Neural Networks (sQGNNs), a novel model that integrates quantum networks with quantum walk operations to improve generalization in graph learning tasks. By leveraging quantum walks, we demonstrated sQGNNs capture complex relational patterns and enhance network expressiveness beyond classical methods. Our results proved that quantum encoding efficiently represents high-dimensional graph data, preserving dependencies and optimizing memory use. Across benchmark datasets, sQGNNs demonstrate superior generalization and robustness against overfitting, achieving higher accuracy with reduced computational cost. Our results underscore sQGNNs’ promise for scalable, quantum-enhanced graph learning, establishing a foundation for future quantum-assisted machine learning applications.
In the NISQ era, implementing practical quantum ma002 chine learning faces challenges due to limited resources. A recent advancement involves a novel single-qubit methodology, allowing for the execution of numerous operations on a single qubit. However, its applicability to complex neural network architectures remains uncertain. This study focuses on graph data, known for its intricate structure and inherent challenges for machine learning. Utilizing the quantum walk, we introduce a graph embedding approach to reduce network parameters, resulting in the design of a novel architecture called the single-qubit Quantum Graph Neural Network (sQGNN). Experimental assessments, including simulations, demonstrate the adaptability of sQGNNs to graphs of varying dimensions and compositions. The resource-efficient nature of sQGNNs is showcased through practical executions on quantum computers, using only one qubit. This capability highlights the efficient utilization of limited qubit resources, paving the way for expansive quantum graph neural networks on resource-constrained Variational Quantum Circuits (VQCs). This breakthrough opens up new possibilities for practical applications within the current NISQ regime.
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.
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 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.
Graphons are continuous functions hidden behind large-scale graphs. Traditional approaches to graphon learning either suffer from the resolution limitations of piecewise-constant functions or struggle to capture the high-frequency structures intrinsic to graphons. In this paper, we propose quantum graphon neural representation (QGNR), a quantum-enhanced machine learning method that enables arbitrarily high-resolution and high-frequency graphon modeling through Fourier series expressivity of data re-uploading quantum circuits. We further extend QGNR to conditional graphon learning, thereby allowing the handling of complex graph-related tasks. Numerical results demonstrate that QGNR outperforms classical state-of-the-art methods in graphon learning and excels in graph classification tasks across domains like molecular property prediction and social network analysis. Notably, QGNR attains superior performance while requiring up to 81.65% fewer variational parameters than the most advanced neural network-based baselines. This work pioneers the application of quantum machine learning to graphons, demonstrating promising quantum advantages in representational power and learning efficiency.
Quantum graph neural networks (QGNNs) have shown promise in leveraging quantum computing to enhance graph-structured data learning, yet they are typically limited to homogeneous graphs. In this paper, we introduce the quantum heterogeneous graph neural network (QHGNN), which integrates heterogeneity as an inductive bias within quantum circuits, enabling effective learning on heterogeneous graphs. By encoding diverse node and edge types directly into the quantum circuit architecture, QHGNN can capture complex relationships intrinsic to heterogeneous molecular data. Our experiments utilize PTC datasets to assess the performance of QHGNN in molecular property prediction tasks, showcasing superior prediction accuracy and efficiency, along with enhanced noise resilience when compared to existing QGNN models.