We introduce the concepts of Grover operators and Grover kernels to systematically analyze Grover's searching algorithms. Then we investigate a one-parameter family of quantum searching algorithms of Grover type and we show that the standard Grover algorithm is a distinguished member of this family. We show that all the algorithms of this class solve the searching problem with an efficiency of order O(rootN), with a coefficient which is class-dependent. The analysis of this dependence is a test of the stability and robustness of the algorithms. We show the stability of this constructions under perturbations of the initial conditions and extend them to a very general class of Grover operators.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据