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

International Journal of Quantum Information

Correlation between the continuous-time quantum walk and cliques in graphs and its application

Mingyou Wu, Xi Li, Zhihao Liu, Hanwu Chen

Published Apr 22, 2021• 1 citation
Publisher

Abstract

The continuous-time quantum walk (CTQW) provides a new approach to problems in graph theory. In this paper, the correlation between the CTQW and cliques in graphs is studied, and an approximate algorithm for the maximum clique problem (MCP) based on the CTQW is given. Via both numerical and theoretical analyses, it is found that the maximum clique is related to the transmission characteristics of the CTQW on some special graphs. For general graphs, the correlation is difficult to describe analytically. Therefore, the transmission characteristics of the CTQW are applied as a vertex selection criterion to a classical MCP algorithm and it is compared with the original algorithm. Numerous simulation on general graphs shows that the new algorithm is more efficient. Furthermore, an approximate MCP algorithm based on the CTQW is introduced, which only requires a very small number of searches with a high approximation ratio.

DOI
10.1142/s021974992150009x

Related papers

Algorithms for finding the maximum clique based on continuous time quantum walks

Xi Li, Mingyou Wu, Hanwu Chen +1 more

In this work, the application of continuous time quantum walks (CTQW) to the Maximum Clique (MC) problem was studied. Performing CTQW on graphs can generate distinct periodic probability amplitudes for different vertices. We found that the intensities of the probability amplitudes at some frequencies imply the clique structure of special kinds of graphs. Recursive algorithms with time complexity O(N^6) in classical computers were proposed to determine the maximum clique. We have experimented on random graphs where each edge exists with different probabilities. Although counter examples were not found for random graphs, whether these algorithms are universal is beyond the scope of this work.

arXiv:1912.02728•Quantum Information and Computation•Feb 1, 2021•4 citations

A parameter-independent algorithm of finding maximum clique with Seidel continuous-time quantum walks

Xi Li, Xiao Chen, Shouwei Hu +2 more

The maximum clique (MC) problem holds significance in network analysis. Quantum-based algorithms have recently emerged as promising approaches for this problem. However, these algorithms heavily depend on parameters of quantum system and vary significantly for different graphs. In order to tackle this issue, we initially demonstrate that continuous-time quantum walks (CTQW) driven by the Seidel matrix offer valuable insights into the clique structure of graphs, outperforming the CTQW driven by adjacency matrix. Specifically, we conduct an in-depth analysis for CTQW of 4 types of graphs, meticulously calculating the amplitudes associated with different vertices. Our findings consistently reveal that vertices belonging to MC exhibit the highest intensity at the largest frequency component of the probability amplitude for these types of graphs. Considering the varying intensities, we propose a parameter-independent algorithm for determining the MC. We compare our algorithm with a typical quantum-based algorithm, the results indicate that our algorithm exhibits greater stability.

iScience•Jan 19, 2024•4 citations

Finding cliques by quantum adiabatic evolution

Andrew M. Childs, Edward Farhi, Jeffrey Goldstone +1 more

Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investigate ($n \le 18$), the quantum algorithm appears to require only a quadratic run time.

Quantum Information and Computation•Apr 1, 2002•81 citations

Quantum algorithms and the maximum clique problem in graphs

Matheus Augusto Condé Dias

Determining the cardinality of the maximum clique on a simple graph is a NP-hard problem with several applications of interest. The best know classical algorithm for this problem has 𝒪(3𝑛/3) time complexity. Classical computing uses phenomena from classical physics to model, store and process information. Consequently, the entire model of classical computing is bounded superiorly by the limits of classical physics. As an alternative, Quantum Computing has been developed to take advantage of quantum phenomena and provide the constructions of circuits capable of performing certain computations more efficiently. In this paper, two quantum solutions to the maximum clique problem will be proposed and analyzed, based on the Grover Quantum Search algorithms and the Quantum Minimal Search Algorithm, comparing their respective time complexities with the best known classical solution.

•Sep 14, 2022•0 citations

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem

F. S. Luiz, A. K. F. Iwakami, D. H. Moraes +1 more

We propose a novel heuristic quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs). In this framework, the coherent propagation of a quantum walker over a graph encodes its structural properties into state amplitudes, enabling the identification of highly influential vertices through their transition probabilities. To enhance stability and solution quality, we introduce a dynamic decoupling (``freezing'') mechanism that isolates vertices already selected for the cover, preventing their interference in subsequent iterations of the algorithm. The method employs a compact binary encoding, requiring only $\lceil \log_2 (V)\rceil$ qubits to represent a graph with $V$ vertices, resulting in an exponential reduction of quantum resources compared to conventional vertex-based encodings. We benchmark the proposed heuristic against exact solutions obtained via Mixed-Integer Linear Programming (MILP) and against established classical heuristics, including Simulated Annealing, FastVC, and the 2-Approximation algorithm, across Erdős--Rényi, Barabási--Albert and regular random graph ensembles. Our results demonstrate that the CTQW-based heuristic consistently achieves superior approximation ratios and exhibits remarkable robustness with respect to network topology, outperforming classical approaches in both heterogeneous and homogeneous structures. These findings indicate that continuous-time quantum walks, when combined with topology-independent decoupling strategies, provide a powerful paradigm for large-scale combinatorial optimization and complex network control, with potential applications spanning infrastructure resilience, epidemic containment, sensor network optimization, and biological systems analysis.

quant-pharXiv:2512.02940•Dec 3, 2025•1 citation

A Continuous - Time Quantum Walk for Attributed Graphs Matching

Tewabe Chekole Workneh

Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation /connection in the study of Quantum walks is furthermore described. Different Researchers had contribution and put their benchmark idea Pertaining with this research concept. I furthermore try to investigate recent Application of Quantum walks, In specific the problem pertained with Graph matching i.e Matching nodes(vertices) of the Graphs. In this research paper,I consider how Continuous-time quantum walk (CTQW) can be directed to Graph-matching problems. The matching problem is abstracted using weighted(attributed) Graphs that connects vertices's of one Graph to other and Try to compute the distance b/n those Graphs Node's Beside that finding the matched nodes and the Cost related to Matching. eventually measuring the distance between two Graphs which might have different size then by using k-nearest neighbor (k-NN) method try to classifying those graph based on closest training examples in the feature space.

arXiv:1801.10339•Jan 31, 2018•1 citation
The continuous-time quantum walk (CTQW) provides a new approach to problems in graph theory. In this paper, the correlation between the CTQW and cliques in graphs is studied, and an approximate algorithm for the maximum clique problem (MCP) based on the CTQW is given. Via both numerical and theoretical analyses, it is found that the maximum clique is related to the transmission characteristics of the CTQW on some special graphs. For general graphs, the correlation is difficult to describe analytically. Therefore, the transmission characteristics of the CTQW are applied as a vertex selection criterion to a classical MCP algorithm and it is compared with the original algorithm. Numerous simulation on general graphs shows that the new algorithm is more efficient. Furthermore, an approximate MCP algorithm based on the CTQW is introduced, which only requires a very small number of searches with a high approximation ratio.
In this work, the application of continuous time quantum walks (CTQW) to the Maximum Clique (MC) problem was studied. Performing CTQW on graphs can generate distinct periodic probability amplitudes for different vertices. We found that the intensities of the probability amplitudes at some frequencies imply the clique structure of special kinds of graphs. Recursive algorithms with time complexity O(N^6) in classical computers were proposed to determine the maximum clique. We have experimented on random graphs where each edge exists with different probabilities. Although counter examples were not found for random graphs, whether these algorithms are universal is beyond the scope of this work.
The maximum clique (MC) problem holds significance in network analysis. Quantum-based algorithms have recently emerged as promising approaches for this problem. However, these algorithms heavily depend on parameters of quantum system and vary significantly for different graphs. In order to tackle this issue, we initially demonstrate that continuous-time quantum walks (CTQW) driven by the Seidel matrix offer valuable insights into the clique structure of graphs, outperforming the CTQW driven by adjacency matrix. Specifically, we conduct an in-depth analysis for CTQW of 4 types of graphs, meticulously calculating the amplitudes associated with different vertices. Our findings consistently reveal that vertices belonging to MC exhibit the highest intensity at the largest frequency component of the probability amplitude for these types of graphs. Considering the varying intensities, we propose a parameter-independent algorithm for determining the MC. We compare our algorithm with a typical quantum-based algorithm, the results indicate that our algorithm exhibits greater stability.
Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investigate (n≤18n \le 18n≤18), the quantum algorithm appears to require only a quadratic run time.
Determining the cardinality of the maximum clique on a simple graph is a NP-hard problem with several applications of interest. The best know classical algorithm for this problem has 𝒪(3𝑛/3) time complexity. Classical computing uses phenomena from classical physics to model, store and process information. Consequently, the entire model of classical computing is bounded superiorly by the limits of classical physics. As an alternative, Quantum Computing has been developed to take advantage of quantum phenomena and provide the constructions of circuits capable of performing certain computations more efficiently. In this paper, two quantum solutions to the maximum clique problem will be proposed and analyzed, based on the Grover Quantum Search algorithms and the Quantum Minimal Search Algorithm, comparing their respective time complexities with the best known classical solution.
We propose a novel heuristic quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs). In this framework, the coherent propagation of a quantum walker over a graph encodes its structural properties into state amplitudes, enabling the identification of highly influential vertices through their transition probabilities. To enhance stability and solution quality, we introduce a dynamic decoupling (``freezing'') mechanism that isolates vertices already selected for the cover, preventing their interference in subsequent iterations of the algorithm. The method employs a compact binary encoding, requiring only ⌈log⁡2(V)⌉\lceil \log_2 (V)\rceil⌈log2​(V)⌉ qubits to represent a graph with VVV vertices, resulting in an exponential reduction of quantum resources compared to conventional vertex-based encodings. We benchmark the proposed heuristic against exact solutions obtained via Mixed-Integer Linear Programming (MILP) and against established classical heuristics, including Simulated Annealing, FastVC, and the 2-Approximation algorithm, across Erdős--Rényi, Barabási--Albert and regular random graph ensembles. Our results demonstrate that the CTQW-based heuristic consistently achieves superior approximation ratios and exhibits remarkable robustness with respect to network topology, outperforming classical approaches in both heterogeneous and homogeneous structures. These findings indicate that continuous-time quantum walks, when combined with topology-independent decoupling strategies, provide a powerful paradigm for large-scale combinatorial optimization and complex network control, with potential applications spanning infrastructure resilience, epidemic containment, sensor network optimization, and biological systems analysis.
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation /connection in the study of Quantum walks is furthermore described. Different Researchers had contribution and put their benchmark idea Pertaining with this research concept. I furthermore try to investigate recent Application of Quantum walks, In specific the problem pertained with Graph matching i.e Matching nodes(vertices) of the Graphs. In this research paper,I consider how Continuous-time quantum walk (CTQW) can be directed to Graph-matching problems. The matching problem is abstracted using weighted(attributed) Graphs that connects vertices's of one Graph to other and Try to compute the distance b/n those Graphs Node's Beside that finding the matched nodes and the Cost related to Matching. eventually measuring the distance between two Graphs which might have different size then by using k-nearest neighbor (k-NN) method try to classifying those graph based on closest training examples in the feature space.