"For an initial uniform superposition over all pos- sible computational basis states, we explore the perfor- mance of Grover’s search algorithm geometrically when imposing a perturbation on the Walsh-Hadamard trans- formation contained in the Grover iteration. We give the geometric picture to visualize the quantum search process in the three-dimensional space and show that Grover’s search algorithm can work well with an appropriately chosen per- turbation. Thereby we corroborate Grover’s conclusion that if the perturbation is small, then it will have little impact on the implementation of this algorithm. We also prove that Grover’s path cannot achieve a geodesic under a perturba- tion of the Fubini-Study metric."
"For an initial uniform superposition over all pos- sible computational basis states, we explore the perfor- mance of Grover’s search algorithm geometrically when imposing a perturbation on the Walsh-Hadamard trans- formation contained in the Grover iteration. We give the geometric picture to visualize the quantum search process in the three-dimensional space and show that Grover’s search algorithm can work well with an appropriately chosen per- turbation. Thereby we corroborate Grover’s conclusion that if the perturbation is small, then it will have little impact on the implementation of this algorithm. We also prove that Grover’s path cannot achieve a geodesic under a perturba- tion of the Fubini-Study metric."
Quantum computers and their algorithm are now widely studied.We consider the prob- lem of making a superposition with an arbitrarily specified amplitudes.By modifying Grover's quantum search algorithm, we show that this can be done in time O(N) with two simple operations, one is the Walsh-Hadamard transformation of $N\cross N$ -matrices where N=2n , the other is phase rotation of a state.If we see this problem in the classical computation model, it corresponds to the problem of making a sample with an arbitrarily specified distribution, where its time complexity is Ω(N) .By making a measurement on the result of our algorithm, it is possible to obtain a sample according to an arbitrarily specified probability distribution in O(N) time.
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(N), 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.
IntroductionFor a search problem associated with a unsorted database, the remarkable Grover's quantum algorithm (1) provides a quadratic speedup over its classical counterpart.The search problem can be described as follows: for a given function f , there exists one unknown element in the set {0, 1, ..., N -1} that satisfies f (x)=-1, say x = τ, whereas the other N -1o n e sg i v e f (x)=1.How many times of evaluations of f are required to determine the element τ for f (τ)=-1?Through a conventional algorithm, one needs O(N) trials to achieve this aim.How about the utility of quantum algorithm for the search?For the scenario in the quantum world, the search problem can be rephrased in the quantum mechanical language: for a given unitary operator I τ , that is sometimes called the oracle operator, and a set of state vectors (orthonormal basis): s = {|0 , |1 , ..., |N -1 }, I τ |x = |x for all states in the set except I τ |x = -|x for x = τ.H owma n yqueriesofI τ are required to determine |τ ?By Grover's algorithm, one needs only O( √ N) quantum mechanical steps to find the marked state |τ out.It has been shown that Grover's algorithm is optimal since it needs minimal oracle calls to perform a quantum search (2).The quantum searching process will be briefly reviewed as follows.The first step of Grover's algorithm is to prepare a superposition state of all elements with uniform probability amplitude:Then apply the Grover kernel G = -I η I τ to |s ,w h er eI η is a unitary operator and contains no bias against the marked state.For large N,a f t e ra b o u tm = π √ N/4 repetitions of G operations, the probability to observe |τ is close to one, i.e., G m |s ∼ |τ .( 2 ) Since every single G involves one query of I τ ,onlyO( √ N) searching steps are required for a quantum search task.In what follows, we will first investigate on the general SU(2) formulation for the kernel of Grover's searching operator G.The discussions of quantum searching certainty, robustness, and the analog analogue version of the Grover's algorithm will be given afterwards.
An algebraic analysis of Grover's quantum search algorithm is presented for the case in which the initial state is an arbitrary pure quantum state $\ensuremath{\mid}\ensuremath{\psi}⟩$ of n qubits. This approach reveals the geometrical structure of the quantum search process, which turns out to be confined to a four-dimensional subspace of the Hilbert space. It unifies and generalizes earlier results on the time evolution of the amplitudes during the search, the optimal number of iterations, and the success probability. Furthermore, it enables a direct generalization to the case in which the initial state is a mixed state, providing an exact formula for the success probability.
Since a quantum system is inevitably influenced by some unpredictable perturbations,we thereby conclude that all the experimental realizations of Grover quantum search algorithm reported were,in fact,achieved in a three-dimensional complex subspace.We also prove that in a two-dimensional complex subspace,for any given initial superposition of basis states |γ0〉=cos β0|α〉+sin β0eiζ|β〉(β0 is a small positive real number,ζ is an arbitrary real number),there exists a set of solutions Fj={(θj,θj-1,…,θ1),(φj,φj-1,…,φ1)} such that a desired state can be found with certainty for some positive integer j≥2,where the phase rotation angles θl and φl are real numbers but not equal to 2k′π,1≤l≤j,k′ is an arbitrary integer.If it is only required that a desired state can be found with high success probability,then as the total number of the desired and undesired states in an unsorted database is sufficiently large the above set of solutions Fj can be written in the form Σji=1θl=Σji=1φl.for a relatively small positive integer j.