10 citations · 16 across the 5 of their papers we have counts for
5 papers
Quantum approximate algorithm for NP optimization problems with constraints
Yue Ruan, Samuel Marsh, Xilin Xue +3
The Quantum Approximate Optimization Algorithm (QAOA) is an algorithmic framework for finding approximate solutions to combinatorial optimization problems, derived from an approxim…
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…
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…
Spatial search for a general multi-vertex state on graph by continuous-time quantum walks
Xi Li, Hanwu Chen, Yue Ruan +3
In this work, we consider the spatial search for a general marked state on graphs by continuous time quantum walks. As a simplest case, we compute the amplitude expression of the s…
The optimal search on graph by continuous-time quantum walks
Xi Li, Hanwu Chen, Yue Ruan +3
Chakraborty and Leonardo have shown that a spatial search by quantum walk is optimal for almost all graphs. However, we observed that on some graphs, certain states cannot be searc…