10 citations · 16 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 3 cited
Algorithm for Finding the Maximum Clique Based on Continuous Time Quantum Walk
Xi Li, Mingyou Wu, Hanwu Chen
In this work, we consider the application of continuous time quantum walking(CTQW) to the Maximum Clique(MC) Problem. Performing CTQW on graphs will generate distinct periodic prob…
quant-ph2019★ 3 cited
The quantum algorithm for graph isomorphism problem
Xi Li, Hanwu Chen
The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph that transforms to another given graph and p…