Advanced Quantum Technologies

Forward Discrete‐Time Quantum Walk for Efficiently Identifying Critical Nodes of Complex Networks

Zhengyi Wang, Feng Gao, Yuan Xu, Xiao-Hui Wang, Jingyang Fang

Published Jul 31, 2025• 1 citation

Abstract

Abstract Critical node identification is the precondition for exploring complex networks, which is a graph‐based optimal search problem in principle. Classical methods, hindered by limited parallel processing capabilities, often grapple with high computational demands and inefficiency. Recent studies have leveraged quantum walk (QW) to tackle such challenges. However, existing QW‐based approaches are constrained by graph structures and prone to recurrent traversal issues. Being different, a novel forward discrete‐time quantum walk (F‐DTQW) method is proposed, which can traverse without redundant visits by prohibiting reverse and lateral propagations. The proposed method significantly enhances the efficiency of critical node identification and is applicable to arbitrary complex networks. The proposed method is validated on typical complex networks such as small‐world, scale‐free, and directed networks, and calculates the transition probability of nodes, corresponding to the centrality measurement index of transition connectivity (TC), which expands from the betweenness centrality (BC) index. The time complexity of F‐DTQW is also analyzed, which is reduced from O ( N 3 ) to O ( N 2 ) compared to the classical method.

DOI: 10.1002/qute.202500234

Related papers

A Method Inspired by One-Dimensional Discrete-Time Quantum Walks for Influential Node Identification

Wen Liang, Yifan Wang, Qiwei Liu +1 more

Identifying influential nodes in complex networks is essential for a wide range of applications, from social network analysis to enhancing infrastructure resilience. While quantum walk-based methods offer potential advantages, existing approaches face challenges in dimensionality, computational efficiency, and accuracy. To address these limitations, this study proposes a novel method inspired by the one-dimensional discrete-time quantum walk (IOQW). This design enables the development of a simplified shift operator that leverages both self-loops and the network's structural connectivity. Furthermore, degree centrality and path-based features are integrated into the coin operator, enhancing the accuracy and scalability of the IOQW framework. Comparative evaluations against state-of-the-art quantum and classical methods demonstrate that IOQW excels in capturing both local and global topological properties while maintaining a low computational complexity of O(N⟨k⟩), where ⟨k⟩ denotes the average degree. These advancements establish IOQW as a powerful and practical tool for influential node identification in complex networks, bridging quantum-inspired techniques with real-world network science applications.

EntropyJun 14, 20251 citation

Quantum Walk-Based Graph Algorithms for Scalable Network Analysis

Jincheng Zhang

This paper investigates the application of quantum walk algorithms to address the computational challenges inherent in analyzing large and complex networks. Traditional graph algorithms often suffer from exponential scaling, rendering them impractical for networks with a substantial number of nodes and edges. We propose a framework leveraging quantum walks to perform network exploration and analysis tasks, aiming to achieve significant speedups compared to their classical counterparts. The core of our approach lies in simulating a quantum walk on the graph, where the walker's movement is governed by quantum mechanical principles, promoting parallel exploration of the graph's connectivity. We detail the theoretical foundations of this approach, focusing on the mathematical formulation of quantum walk operators and their application to graph traversal and algorithm design. Furthermore, we explore specific network analysis problems, such as shortest path finding and community detection, demonstrating the potential of this methodology. The results presented suggest that quantum walk-based algorithms offer a promising avenue for scalable network analysis, particularly for large networks where classical algorithms face limitations.

Sep 5, 20260 citations

Exploring Complex Networks with Quantum Walks

Fei Yan, Liang Wen, Fangyan Dong

This book explores the intersection of quantum computing and network science. It bridges the theoretical foundations of quantum walk algorithms with their applications in the structural exploration and representation learning of complex networks. Quantum walks, a technology that is pivotal to universal quantum computational models, examines the movement of particles on a graph composed of nodes and links. Quantum superposition enables these particles to traverse these graphs more quickly, while measurement-induced collapse introduces fluctuations, making the identification of critical nodes challenging yet intriguing. At its core, the book explores how quantum walk algorithms can transform the structural and representational analysis of complex networks. It begins by introducing the fundamental concepts of quantum computing and quantum walks, including generalized definitions and the properties of low-dimensional quantum walks. Then, it discusses the implementation of discrete- and continuous-time quantum walks for mining network nodes, links, and subgraphs, as well as their use in network representation learning and graph neural networks. The book will serve as a valuable reference for researchers, students, and educators interested in quantum walks, complex networks, quantum mechanics, and information engineering.

CRC Press eBooksNov 24, 20251 citation

Quantum Walk-Based Graph Traversal for Network Security Analysis

Jincheng Zhang

This paper investigates the application of quantum walks to network security analysis, specifically focusing on graph traversal algorithms for anomaly detection and vulnerability assessment. Traditional graph traversal methods often struggle with the complexity of large and dynamic network topologies. Quantum walks, leveraging superposition and interference, offer a potentially more efficient approach. We propose a framework utilizing quantum walks to systematically explore network graphs, identifying patterns and deviations from normal behavior that may indicate malicious activity. The core idea is to represent network nodes and edges as quantum states and utilize the walk's propagation to efficiently discover anomalous routes or node behaviors. We formally define the quantum walk algorithm, including the Hamiltonian operator, initial state preparation, and measurement process. The theoretical analysis demonstrates the potential for exponential speedups in certain scenarios compared to classical graph traversal algorithms. This work lays the groundwork for a novel approach to network security, capitalizing on the inherent advantages of quantum computing for complex pattern recognition and anomaly detection. The key contributions are the formalized quantum walk algorithm for graph traversal and an analysis of its potential advantages.

Sep 5, 20260 citations

Link prediction using discrete-time quantum walk

Qian, Jing, Lintao Yang, Zetai Yu +1 more

Original scientific paperLink prediction is one of the key issues of complex networks, which attracts much research interest currently.Many link prediction methods have been proposed so far.The classical random walk as an effective tool has been widely used to study the link prediction problems.Quantum walk is the quantum analogue of classical random walk.Numerous research results show that quantum algorithms using quantum walk outperform their classical counterparts in many applications, such as graph matching and searching.But there have been few studies of the link prediction based on quantum walk, especially on discrete-time quantum walk.This paper proposes a new link prediction method based on discrete-time quantum walk.Experiment results show that prediction accuracy of our method is better than the typical methods.The time complexity of our method running on classical computers, compared with the methods based on classical random walk, is slightly higher.But our method can be greatly accelerated by executing on quantum computers.

Tehnicki vjesnik - Technical GazetteOct 1, 20174 citations

Quantum Walk-Based Routing Protocols for Wireless Networks

Jincheng Zhang

This paper investigates the application of quantum walks to routing protocols within wireless networks. Traditional routing algorithms often struggle with efficiency and convergence speed, particularly in dynamic and complex network topologies. We propose a novel approach utilizing quantum walk principles to explore network connectivity and identify optimal routes. Our methodology employs a quantum walk algorithm to simulate network traversal, leveraging quantum superposition and interference to potentially achieve faster convergence and reduced latency compared to classical approaches. The core of the system relies on a discrete-time quantum walk on a graph representing the wireless network, where nodes are the walkers and edges represent communication links. The algorithm aims to minimize the walk length, effectively finding the shortest path between source and destination nodes. We present a theoretical framework and outline the key components of a quantum walk-based routing protocol. While this research focuses on the theoretical aspects and does not include experimental validation, it lays the foundation for future work exploring the practical feasibility and performance benefits of quantum walk routing in real-world wireless network scenarios.

Aug 31, 20260 citations