An N/4 fixed-point duality quantum search algorithm

作     者：HAO Liang1,LIU Dan2 & LONG GuiLu1,3 1Key Laboratory for Atomic and Molecular NanoSciences and Department of Physics,Tsinghua University,Beijing 100084,China 2School of Sciences,Dalian Nationalities University,Dalian 116600,China 3Tsinghua National Laboratory for Information Science and Technology,Beijing 100084,China 

作者机构：Key Laboratory for Atomic and Molecular NanoSciences and Department of Physics Tsinghua University Beijing China School of Sciences Dalian Nationalities University Dalian China Tsinghua National Laboratory for Information Science and Technology Beijing China 

出 版 物：《中国科学：物理学、力学、天文学英文版》 (SCIENCE CHINA(PHYSICS, MECHANICS&ASTRONOMY))

年 卷 期：2010年第53卷第9期

页      面：1765-1768页

核心收录：

学科分类：07[理学] 0809[工学-电子科学与技术（可授工学、理学学位）] 070205[理学-凝聚态物理] 08[工学] 0805[工学-材料科学与工程（可授工学、理学学位）] 0704[理学-天文学] 0702[理学-物理学] 

基　　金：supported by the National Natural Science Foundation of China (Grant Nos 10775076 and 10874098) the SRFPD Program in the Ministry of Education of China (Grant No 20060003048) the National Basic Research Program of China (Grant No 2006CB921106) Educational Commission of Liaoning Province of China (Grant No 2008130) 

主　　题：fixed-point search algorithm duality quantum computing the N4 duality search algorithm 

摘      要：Here a fixed-point duality quantum search algorithm is *** algorithm uses iteratively non-unitary operations and measurements to search an unsorted *** the marked item is found,the algorithm stops *** algorithm uses a constant non-unitary operator,and requires N/4 steps on average(N is the number of data from the database) to locate the marked *** implementation of this algorithm in a usual quantum computer is also demonstrated.