中国物理B ›› 2022, Vol. 31 ›› Issue (7): 70504-070504.doi: 10.1088/1674-1056/ac5241

• • 上一篇    下一篇

Quantum search of many vertices on the joined complete graph

Tingting Ji(冀婷婷), Naiqiao Pan(潘乃桥), Tian Chen(陈天), and Xiangdong Zhang(张向东)   

  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
  • 收稿日期:2021-10-24 修回日期:2021-12-29 接受日期:2022-02-07 出版日期:2022-06-09 发布日期:2022-06-09
  • 通讯作者: Tian Chen E-mail:chentian@bit.edu.cn
  • 基金资助:
    Project supported by the National Key R&D Program of China (Grant No. 2017YFA0303800) and the National Natural Science Foundation of China (Grant Nos. 91850205 and 11974046).

Quantum search of many vertices on the joined complete graph

Tingting Ji(冀婷婷), Naiqiao Pan(潘乃桥), Tian Chen(陈天), and Xiangdong Zhang(张向东)   

  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
  • Received:2021-10-24 Revised:2021-12-29 Accepted:2022-02-07 Online:2022-06-09 Published:2022-06-09
  • Contact: Tian Chen E-mail:chentian@bit.edu.cn
  • Supported by:
    Project supported by the National Key R&D Program of China (Grant No. 2017YFA0303800) and 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$. 114 110503 (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\left({\sqrt N } \right)$, 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

Abstract: 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$. 114 110503 (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\left({\sqrt N } \right)$, 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.

Key words: quantum search, the joined complete graph, quantum walk, many vertices

中图分类号:  (Random walks and Levy flights)

  • 05.40.Fb
03.67.-a (Quantum information) 02.10.Ox (Combinatorics; graph theory)