The optimal search on graph by continuous-time quantum walks
Quantum Physics
2018-04-10 v4
Abstract
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 searched optimally. We present a method for constructing an optimal graph that searches an arbitrary state and provides the optimal condition. We also analyze the monotonicity of the search performance and conclude that the search performance can be improved by adding edges.
Keywords
Cite
@article{arxiv.1711.01765,
title = {The optimal search on graph by continuous-time quantum walks},
author = {Xi Li and Hanwu Chen and Yue Ruan and Mengke Xu and Jianing Tang and Zhihao Liu},
journal= {arXiv preprint arXiv:1711.01765},
year = {2018}
}
Comments
there are wrong information in the article