摘要
The quantum search on the graph is a very important topic.In this work,we develop a theoretic method on searching of single vertex on the graph[Phys.Rev.Lett.114110503(2015)],and systematically study the search of many vertices on one low-connectivity graph,the joined complete graph.Our results reveal that,with the optimal jumping rate obtained from the theoretical method,we can find such target vertices at the time O(√N),where N is the number of total vertices.Therefore,the search of many vertices on the joined complete graph possessing quantum advantage has been achieved.
作者
Tingting Ji
Naiqiao Pan
Tian Chen
Xiangdong Zhang
冀婷婷;潘乃桥;陈天;张向东(Key Laboratory of Advanced Optoelectronic Quantum Architecture and Measurements of Ministry of Education,Beijing Key Laboratory of Nanophotonics&Ultrafine Optoelectronic Systems,School of Physics,Beijing Institute of Technology,Beijing 100081,China)
基金
the National Key R&D Program of China(Grant No.2017YFA0303800)
the National Natural Science Foundation of China(Grant Nos.91850205 and 11974046)。
