Quantum walk on simplicial complexes for simplicial community detection

Abstract

Quantum walks have emerged as a transformative paradigm in quantum information processing and can be applied to various graph problems. This study explores discrete-time quantum walks on simplicial complexes, a higher-order generalization of graph structures. Simplicial complexes, encoding higher-order interactions through simplices, offer a richer topological representation of complex systems. Since the conventional classical random walk cannot directly detect community structures, we present a quantum walk algorithm to detect higher-order community structures called simplicial communities. We utilize the Fourier coin to produce entangled translation states among adjacent simplices in a simplicial complex. The potential of our quantum algorithm is tested on Zachary's karate club network. This study may contribute to understanding complex systems at the intersection of algebraic topology and quantum walk algorithms.

14 pages, manuscript revised

References in corpus (15)

• Community structure in social and biological networks
• Modularity and community structure in networks
• Cooperative Game Theory Approaches for Network Partitioning
• Spectral methods for network community detection and graph partitioning
• Explosive higher-order Kuramoto dynamics on simplicial complexes
• Implementing the quantum random walk
• Quantum walks in higher dimensions
• Limit Theorem for Continuous-Time Quantum Walk on the Line
• Quantum walk-based search and centrality
• Weighted simplicial complexes and their representation power of higher-order network data and topology
• Community Detection in Quantum Complex Networks
• Discrete-time quantum walk on complex networks for community detection
• Spectral Detection of Simplicial Communities via Hodge Laplacians
• Persistent homology analysis of type 2 diabetes genome-wide association studies in protein-protein interaction networks
• Disease Gene Prioritization With Quantum Walks