Groveralgorithm.ppt

Grover Algorithm Search problem The quantum search algorithm solves the following problem: Given a search space of size N,and no prior knowledge about the structure of the information in it, we want to find an element of that search space satisfying a known property . How long does it take to find an element satisfying that property? Classically,this problem requires approximately N operations, but the quantum search algorithm allows it to solved using approximately operations. 量子搜索问题 量子搜索算法解决如下问题： 给定大小为N的搜索空间，没有关于它结构信息的先验知识。希望找到这个搜索空间中的满足已知性质的一个元素。要找到一个满足条件的元素需要多久。 经典情形，这个问题需要大概N次操作，但是量子搜索算法可以用大概　　次操作解决。 Grover algorithm The quantum search algorithm is proposed by Grover in 1995. When there is only one solution of it,the computation complexity is The probability of success is closely to 1. Grover algorithm 该算法由Grover于1995年提出，在量子计算领域中的影响仅次于Shor算法。 当搜索问题只有 1 个真解时，Grover算法的计算算法复杂性为 ，成功率接近于1。 Basic principles Suppose we wish to search through a search space of N elements, For conveniently we assume N=2n And that the search problem has exactly M solutions. A parcicular instance of the search problem can conveniently be represented by a function f,which takes as input an integer x ,in the range 0 to N-1. By definition,f(x)=1 if x is a solution to the search problem ,and f(x)=0 if x is not a solution to the search problem. 基本原理 假设在N个元素的空间中搜索，为方便起见，假定N=2n ，且搜索问题恰好有M个解，这个问题的特例可以方便地表示为一个输入x的函数f(x)，x是从0到N－1的整数，f的定义是： 若x是搜索问题的一个解，则f(x)=1，而若x不是解，则f(x)=0。 Suppose we are supplied with a quantum oracle-a black box,the action of the oracle may be written: We say that the oracle marks the solutions to the search problem,by shifting the phase of the solution.For an N item search problem with M solutions,it turns out that we need only apply the search oracle times in order to obtain a solution,on a quantum computer. 设有一个量子oracle可以识别搜索问题的解。 Oracle的作用可以写成： 我们说oracle通过改变相位，标识了搜索问题的解。对有M个解的N元搜索问题，实际上为得到一个解，只需要在量子计算机上应用搜索oracle