Quantum search of many vertices on the joined complete graph  

作　　者：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)

机构地区：[1]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

出　　处：《Chinese Physics B》2022年第7期182-193,共12页中国物理B（英文版）

基　　金：the National Key R&D Program of China(Grant No.2017YFA0303800);the National Natural Science Foundation of China(Grant Nos.91850205 and 11974046)。

摘　　要：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.

关 键 词：quantum search the joined complete graph quantum walk many vertices 

分 类 号：O413[理学—理论物理] O157.5[理学—物理]