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

DOI10.1142/S021974992150009XzbMath1468.81033OpenAlexW3160368027MaRDI QIDQ5003363

Mingyou Wu, Xi Li, Han Wu Chen, Zhi-hao Liu

Publication date: 21 July 2021

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021974992150009x

zbMATH Keywords

quantum computingmaximum clique problemquantum walk

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Quantum computation (81P68) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• An exact algorithm for the maximum clique problem
• A fast algorithm for the maximum clique problem
• A review on algorithms for maximum clique problems
• Reducibility among Combinatorial Problems
• Quantum simulations of classical random walks and undirected graph connectivity