Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2311.09855 · Annalen der Physik

Scoring Anomalous Vertices Through Quantum Walks

Andrew Vlasic, Anh T. Pham

Published Feb 16, 2025• 4 citations
arXivHTMLPDF

Abstract

Abstract With the constant flow of data from vast sources over the past decades, a plethora of advanced analytical techniques have been developed to extract relevant information from different data types ranging from labeled data, quasi‐labeled data, and data with no labels known a priori. For data with at best quasi‐labels, graphs are a natural representation and have important applications in many industries and scientific disciplines. Specifically, for unlabeled data, anomaly detection on graphs is a method to determine which data points do not posses the latent characteristics that are present in most other data. There have been a variety of classical methods to compute an anomalous score for the individual vertices of a respective graph, such as checking the local topology of a node, random walks, and complex neural networks. Leveraging the structure of the graph, the first quantum algorithm is proposed to calculate the anomaly score of each node by continuously traversing the graph with a uniform starting position for all nodes. The proposed algorithm incorporates well‐known characteristics of quantum walks, and, taking into consideration the noisy intermediate‐scale quantum (NISQ) era and subsequent intermediate‐scale quantum (ISQ) era, an adjustment to the algorithm is provided to mitigate the increasing depth of the circuit. This algorithm is rigorously shown to converge to the expected probability with respect to the initial condition.

DOI
10.1002/andp.202400282

Related papers

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, 2026•0 citations

Quantum Walk-Based Graph Traversal for Feature Extraction

Jincheng Zhang

This paper presents a novel approach to graph traversal and feature extraction leveraging the principles of quantum walks. Classical graph algorithms often suffer from performance limitations when dealing with large, complex graphs, primarily due to their sequential nature and the exponential growth of possible paths. Quantum walks, utilizing superposition and interference, provide a fundamentally different paradigm for graph exploration, offering the potential for significant speedups. We detail the theoretical framework for applying quantum walks to graph traversal, focusing on the efficient extraction of features from nodes and edges. The core concept involves mapping the graph's nodes and edges onto a quantum Hilbert space, allowing the quantum walk to explore the graph's connectivity in a probabilistic manner. We demonstrate how interference effects can be strategically utilized to guide the walk towards regions of interest, thereby enhancing feature extraction. The methodology outlined here provides a robust foundation for developing quantum algorithms for graph analysis across various domains, including social network analysis, knowledge graph reasoning, and anomaly detection. This work establishes a new direction for graph processing, shifting from classical sequential algorithms to quantum probabilistic exploration, ultimately leading to improved efficiency and scalability.

•Aug 31, 2026•0 citations

Quantum Walk-Based Algorithms for Large-Scale Graph Search

Jincheng Zhang

This paper investigates the application of quantum walk algorithms to large-scale graph search problems. Classical algorithms often struggle with the computational complexity of exploring vast graphs, particularly when searching for specific patterns or nodes. Quantum walks, inspired by the probabilistic nature of random walks, provide a promising alternative by utilizing quantum superposition and interference to accelerate the search process. We explore the theoretical framework and potential advantages of employing quantum walks for graph traversal, focusing on scenarios where exponential speedups are theoretically possible. This work aims to demonstrate the potential of quantum computing to tackle computationally demanding graph search tasks that are currently intractable for classical methods. The core concept leverages the ability to simultaneously explore multiple paths within a graph, drastically reducing the search time compared to sequential exploration. We present a foundational understanding of quantum walk implementation and analyze its suitability for various graph search algorithms.

•Aug 28, 2026•0 citations

Search algorithm of abnormal structure on complete graph: Discussion of classical algorithm merged into the quantum computing thinking

H Chen, Wenbo Li, Zi-Fan Liu +1 more

© 2017, Editorial Department of Journal of Southeast University. All right reserved. Quantum computing thinking is used to explore new search methods for graph structures. A search algorithm for structural anomalies on complete graphs based on scattering quantum walk is proposed. Adding a pendant vertex to a complete graph, in which the number of vertices is N, breaks the symmetry of the complete graph and indicates the change of the topology of the complete graph. First, the precise definition of the evolutionary unitary operator U of scattering quantum walk in the complete graph is presented. The Hilbert space in which the walk occurs is projected to a lower-dimensional invariant subspace S, and the action of the evolutionary operator in the subspace US is given. Then, the equal superposition of all the basis states in the complete graph is chosen as the initial state. The eigenvalues and the eigenstates of US is calculated by using the perturbation theory, and the final state (pendants) of the algorithm is solved. Finally, the time complexity and the success probability of the algorithm are analyzed. The algorithm analysis and the Matlab simulation results show that the quantum search algorithm using scattering quantum walk can find the anomaly in O(N1/2) steps with the probability near to 1. However, the time complexity of the classical algorithm for searching the anomaly by the adjacency list is O(N). Therefore, the search algorithm based on scattering quantum walk can provide a quadric speed up over the classical algorithm for this specific problem.

•Sep 20, 2017•0 citations

Quantum walk processes in quantum devices

Anandu Kalleri Madhu, Alexey A. Melnikov, Leonid Evgenevich Fedichkin +2 more

Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic subroutine in many quantum algorithms and plays an important role in studying physical phenomena. Simulating quantum walk processes is computationally challenging for classical processors. With an increasing improvement in qubits fidelity and qubits number in a single register, there is a potential to improve quantum walks simulations substantially. However, efficient ways to simulate quantum walks in qubit registers still have to be explored. Here, we explore the relationship between quantum walk on graphs and quantum circuits. Firstly, we discuss ways to obtain graphs provided quantum circuit. We then explore techniques to represent quantum walk on a graph as a quantum circuit. Specifically, we study hypercube graphs and arbitrary graphs. Our approach to studying the relationship between graphs and quantum circuits paves way for the efficient implementation of quantum walks algorithms on quantum computers.

arXiv:2012.14386•Heliyon•Feb 7, 2023•4 citations

Community detection in network using Szegedy quantum walk

Md Samsur Rahaman, Supriyo Dutta

In a network, the vertices with similar characteristics construct communities. The vertices in a community are well-connected. Detecting the communities in a network is a challenging and important problem in the theory of complex networks. One approach to solving this problem uses the classical random walks on graphs. In quantum computing, quantum walks are the quantum mechanical counterparts of classical random walks. In this article, we employ a variant of Szegedy's quantum walk to develop a procedure for discovering the communities in networks. The limiting probability distribution of quantum walks assists us in determining the inclusion of a vertex in a community. We apply our community detection procedure to a variety of graphs and social networks, including the relaxed caveman graph, $l$-partition graph, Karate club graph, and the dolphin's social network, among others.

quant-pharXiv:2601.21152•Jan 30, 2026•0 citations
Abstract With the constant flow of data from vast sources over the past decades, a plethora of advanced analytical techniques have been developed to extract relevant information from different data types ranging from labeled data, quasi‐labeled data, and data with no labels known a priori. For data with at best quasi‐labels, graphs are a natural representation and have important applications in many industries and scientific disciplines. Specifically, for unlabeled data, anomaly detection on graphs is a method to determine which data points do not posses the latent characteristics that are present in most other data. There have been a variety of classical methods to compute an anomalous score for the individual vertices of a respective graph, such as checking the local topology of a node, random walks, and complex neural networks. Leveraging the structure of the graph, the first quantum algorithm is proposed to calculate the anomaly score of each node by continuously traversing the graph with a uniform starting position for all nodes. The proposed algorithm incorporates well‐known characteristics of quantum walks, and, taking into consideration the noisy intermediate‐scale quantum (NISQ) era and subsequent intermediate‐scale quantum (ISQ) era, an adjustment to the algorithm is provided to mitigate the increasing depth of the circuit. This algorithm is rigorously shown to converge to the expected probability with respect to the initial condition.
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.
This paper presents a novel approach to graph traversal and feature extraction leveraging the principles of quantum walks. Classical graph algorithms often suffer from performance limitations when dealing with large, complex graphs, primarily due to their sequential nature and the exponential growth of possible paths. Quantum walks, utilizing superposition and interference, provide a fundamentally different paradigm for graph exploration, offering the potential for significant speedups. We detail the theoretical framework for applying quantum walks to graph traversal, focusing on the efficient extraction of features from nodes and edges. The core concept involves mapping the graph's nodes and edges onto a quantum Hilbert space, allowing the quantum walk to explore the graph's connectivity in a probabilistic manner. We demonstrate how interference effects can be strategically utilized to guide the walk towards regions of interest, thereby enhancing feature extraction. The methodology outlined here provides a robust foundation for developing quantum algorithms for graph analysis across various domains, including social network analysis, knowledge graph reasoning, and anomaly detection. This work establishes a new direction for graph processing, shifting from classical sequential algorithms to quantum probabilistic exploration, ultimately leading to improved efficiency and scalability.
This paper investigates the application of quantum walk algorithms to large-scale graph search problems. Classical algorithms often struggle with the computational complexity of exploring vast graphs, particularly when searching for specific patterns or nodes. Quantum walks, inspired by the probabilistic nature of random walks, provide a promising alternative by utilizing quantum superposition and interference to accelerate the search process. We explore the theoretical framework and potential advantages of employing quantum walks for graph traversal, focusing on scenarios where exponential speedups are theoretically possible. This work aims to demonstrate the potential of quantum computing to tackle computationally demanding graph search tasks that are currently intractable for classical methods. The core concept leverages the ability to simultaneously explore multiple paths within a graph, drastically reducing the search time compared to sequential exploration. We present a foundational understanding of quantum walk implementation and analyze its suitability for various graph search algorithms.
© 2017, Editorial Department of Journal of Southeast University. All right reserved. Quantum computing thinking is used to explore new search methods for graph structures. A search algorithm for structural anomalies on complete graphs based on scattering quantum walk is proposed. Adding a pendant vertex to a complete graph, in which the number of vertices is N, breaks the symmetry of the complete graph and indicates the change of the topology of the complete graph. First, the precise definition of the evolutionary unitary operator U of scattering quantum walk in the complete graph is presented. The Hilbert space in which the walk occurs is projected to a lower-dimensional invariant subspace S, and the action of the evolutionary operator in the subspace US is given. Then, the equal superposition of all the basis states in the complete graph is chosen as the initial state. The eigenvalues and the eigenstates of US is calculated by using the perturbation theory, and the final state (pendants) of the algorithm is solved. Finally, the time complexity and the success probability of the algorithm are analyzed. The algorithm analysis and the Matlab simulation results show that the quantum search algorithm using scattering quantum walk can find the anomaly in O(N1/2) steps with the probability near to 1. However, the time complexity of the classical algorithm for searching the anomaly by the adjacency list is O(N). Therefore, the search algorithm based on scattering quantum walk can provide a quadric speed up over the classical algorithm for this specific problem.
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic subroutine in many quantum algorithms and plays an important role in studying physical phenomena. Simulating quantum walk processes is computationally challenging for classical processors. With an increasing improvement in qubits fidelity and qubits number in a single register, there is a potential to improve quantum walks simulations substantially. However, efficient ways to simulate quantum walks in qubit registers still have to be explored. Here, we explore the relationship between quantum walk on graphs and quantum circuits. Firstly, we discuss ways to obtain graphs provided quantum circuit. We then explore techniques to represent quantum walk on a graph as a quantum circuit. Specifically, we study hypercube graphs and arbitrary graphs. Our approach to studying the relationship between graphs and quantum circuits paves way for the efficient implementation of quantum walks algorithms on quantum computers.
In a network, the vertices with similar characteristics construct communities. The vertices in a community are well-connected. Detecting the communities in a network is a challenging and important problem in the theory of complex networks. One approach to solving this problem uses the classical random walks on graphs. In quantum computing, quantum walks are the quantum mechanical counterparts of classical random walks. In this article, we employ a variant of Szegedy's quantum walk to develop a procedure for discovering the communities in networks. The limiting probability distribution of quantum walks assists us in determining the inclusion of a vertex in a community. We apply our community detection procedure to a variety of graphs and social networks, including the relaxed caveman graph, lll-partition graph, Karate club graph, and the dolphin's social network, among others.