A quantum search algorithm of two-dimensional convex hull  

作　　者：Cheng Wang Ri-Gui Zhou 

机构地区：[1]College of Information Engineering,Shanghai Maritime University,Shanghai,201306,China [2]Research Center of Intelligent Information Processing and Quantum Intelligent Computing,Shanghai,201306,China

出　　处：《Communications in Theoretical Physics》2021年第11期85-92,共8页理论物理通讯（英文版）

基　　金：supported by the Shanghai Science and Technology Project in 2020 under Grant No.20040501500。

摘　　要：Despite the rapid development of quantum research in recent years,there is very little research in computational geometry.In this paper,to achieve the convex hull of a point set in a quantum system,a quantum convex hull algorithm based on the quantum maximum or minimum searching algorithm(QUSSMA)is proposed.Firstly,the novel enhanced quantum representation of digital images is employed to represent a group of point set,and then the QUSSMA algorithm and vector operation are used to search the convex hull of the point set.In addition,the algorithm is simulated and compared with the classical algorithm.It is concluded that the quantum algorithm accelerates the classical algorithm when the Mpvalue of the convex hull point is under a certain condition.

关 键 词：quantum algorithm convex hull computational geometry quantum searching 

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