Hybrid Quantum-Classical Walks for Graph Representation Learning in Community Detection

• URL: http://arxiv.org/abs/2510.01918v1
• Date: Thu, 02 Oct 2025 11:35:17 GMT
• Title: Hybrid Quantum-Classical Walks for Graph Representation Learning in Community Detection
• Authors: Adrián Marın, Mauricio Soto-Gomez, Giorgio Valentini, Elena Casiraghi, Carlos Cano, Daniel Manzano,
• Abstract summary: This paper introduces a novel quantum-inspired algorithm for Graph Representation Learning (GRL)<n>Our approach combines the benefits of both quantum and classical dynamics, allowing the walker to simultaneously explore both highly local and far-reaching connections within the graph.<n>Preliminary results for a case study in network community detection shows that this hybrid dynamic enables the algorithm to adapt effectively to complex graph topologies.
• Score: 0.09030828136788653
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph Representation Learning (GRL) has emerged as a cornerstone technique for analysing complex, networked data across diverse domains, including biological systems, social networks, and data analysis. Traditional GRL methods often struggle to capture intricate relationships within complex graphs, particularly those exhibiting non-trivial structural properties such as power-law distributions or hierarchical structures. This paper introduces a novel quantum-inspired algorithm for GRL, utilizing hybrid Quantum-Classical Walks to overcome these limitations. Our approach combines the benefits of both quantum and classical dynamics, allowing the walker to simultaneously explore both highly local and far-reaching connections within the graph. Preliminary results for a case study in network community detection shows that this hybrid dynamic enables the algorithm to adapt effectively to complex graph topologies, offering a robust and versatile solution for GRL tasks.

Related papers

• QSearchNet: A Quantum Walk Search Framework for Link Prediction [0.0]
  Link prediction is one of the fundamental problems in graph theory.<n>Quantum computing offers a powerful alternative by leveraging superposition for simultaneous multi-path exploration.<n>QSearchNet simulates a topology-aware quantum evolution to propagate amplitudes across multiple nodes simultaneously.
  arXiv  Detail & Related papers  (2025-09-30T22:32:34Z)
• Quantum-Assisted Correlation Clustering [3.8448698053186843]
  This work introduces a hybrid quantum-classical method to correlation clustering, a graph-based unsupervised learning task.<n>We adapt GCS-Q, a quantum-assisted solver originally designed for coalition structure generation, to maximize intra-cluster agreement in signed graphs.<n> Empirical evaluations on synthetic signed graphs and real-world hyperspectral imaging data demonstrate that, when adapted for correlation clustering, GCS-Q outperforms classical algorithms in robustness and clustering quality.
  arXiv  Detail & Related papers  (2025-09-03T12:14:35Z)
• Hybrid State-Space and GRU-based Graph Tokenization Mamba for Hyperspectral Image Classification [14.250184447492208]
  Hyperspectral image (HSI) classification plays a pivotal role in domains such as environmental monitoring, agriculture, and urban planning.<n>Traditional methods, including machine learning and convolutional neural networks (CNNs), often struggle to effectively capture these intricate spectral-spatial features.<n>This work proposes GraphMamba, a hybrid model that combines spectral-spatial token generation, graph-based token prioritization, and cross-attention mechanisms.
  arXiv  Detail & Related papers  (2025-02-10T13:02:19Z)
• Reinforcement Learning Discovers Efficient Decentralized Graph Path Search Strategies [4.77487125476894]
  Graph path search is a classic computer science problem that has been recently approached with Reinforcement Learning. We propose a multi-agent approach for graph path search that successfully leverages both homophily and structural heterogeneity. Our results show that meaningful embeddings for graph navigation can be constructed using reward-driven learning.
  arXiv  Detail & Related papers  (2024-09-12T10:56:38Z)
• Intelligent Hybrid Resource Allocation in MEC-assisted RAN Slicing Network [72.2456220035229]
  We aim to maximize the SSR for heterogeneous service demands in the cooperative MEC-assisted RAN slicing system. We propose a recurrent graph reinforcement learning (RGRL) algorithm to intelligently learn the optimal hybrid RA policy.
  arXiv  Detail & Related papers  (2024-05-02T01:36:13Z)
• Large Scale Training of Graph Neural Networks for Optimal Markov-Chain Partitioning Using the Kemeny Constant [1.8606770727950463]
  We propose several GNN-based architectures to tackle the graph partitioning problem for Markov Chains described as kinetic networks. This approach aims to minimize how much a proposed partitioning changes the Kemeny constant. We show how simple GraphSAGE-based GNNs with linear layers can outperform much larger and more expressive attention-based models in this context.
  arXiv  Detail & Related papers  (2023-12-22T17:19:50Z)
• Generalization Guarantee of Training Graph Convolutional Networks with Graph Topology Sampling [83.77955213766896]
  Graph convolutional networks (GCNs) have recently achieved great empirical success in learning graphstructured data. To address its scalability issue, graph topology sampling has been proposed to reduce the memory and computational cost of training Gs. This paper provides first theoretical justification of graph topology sampling in training (up to) three-layer GCNs.
  arXiv  Detail & Related papers  (2022-07-07T21:25:55Z)
• Deep Architecture Connectivity Matters for Its Convergence: A Fine-Grained Analysis [94.64007376939735]
  We theoretically characterize the impact of connectivity patterns on the convergence of deep neural networks (DNNs) under gradient descent training. We show that by a simple filtration on "unpromising" connectivity patterns, we can trim down the number of models to evaluate.
  arXiv  Detail & Related papers  (2022-05-11T17:43:54Z)
• Hyperbolic Graph Neural Networks: A Review of Methods and Applications [61.49208407567829]
  This survey paper provides a comprehensive review of the rapidly evolving field of Hyperbolic Graph Learning (HGL)<n>We systematically categorize and analyze existing methods dividing them into (1) hyperbolic graph embedding-based techniques, (2) graph neural network-based hyperbolic models, and (3) emerging paradigms.<n>We extensively discuss diverse applications of HGL across multiple domains, including recommender systems, knowledge graphs, bioinformatics, and other relevant scenarios.
  arXiv  Detail & Related papers  (2022-02-28T15:08:48Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)

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.