摘要
Here a fixed-point duality quantum search algorithm is proposed.This algorithm uses iteratively non-unitary operations and measurements to search an unsorted database.Once the marked item is found,the algorithm stops automatically.This 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 state.The implementation of this algorithm in a usual quantum computer is also demonstrated.
Here a fixed-point duality quantum search algorithm is proposed.This algorithm uses iteratively non-unitary operations and measurements to search an unsorted database.Once the marked item is found,the algorithm stops automatically.This 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 state.The implementation of this algorithm in a usual quantum computer is also demonstrated.
作者
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
基金
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)
