相关论文: Performance of Equal Phase-Shift Search for One It…
Grover presented the fixed-point search by replacing the selective inversions by selective phase shifts of $\pi /3$. In this paper, we investigate the convergence behavior of the fixed-point search algorithm with general but equal phase…
Grover recently presented the fixed-point search algorithm. In this letter, we study the fixed-point search algorithm obtained by replacing equal phase shifts of $\pi /3$ by different phase shifts.
Phase matching has been studied for the Grover algorithm as a way of enhancing the efficiency of the quantum search. Recently Li and Li found that a particular form of phase matching yields, with a single Grover operation, a success…
The quantum search algorithm consists of an alternating sequence of selective inversions and diffusion type operations, as a result of which it can find a target state in an unsorted database of size N in only sqrt(N) queries. This paper…
This article introduces an enhancement to the Grover search algorithm to speed up computing the probability of finding good states. It suggests incorporating a rotation phase angle determined mathematically from the derivative of the model…
As the matching condition in Grover search algorithm is transgressed due to inevitable errors in phase inversions, it gives a reduction in maximum probability of success. With a given degree of maximum success, we have derive the…
We study the fully generalized Grover's algorithm to find the optimal phase changes for each step of the iteration to maximize gain in probability of observation of the target, and when phase matching is required. We find that classical…
Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm that searches for M matches in an unstructured…
We generalize Grover algorithm with two arbitrary phases in a density matrix set up. We give exact analytic expressions for the success probability after arbitrary number of iteration of the generalized Grover operator as a function of…
In standard Grover's algorithm for quantum searching, the probability of finding the marked item is not exactly 1. In this Letter we present a modified version of Grover's algorithm that searches a marked state with full successful rate.…
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by $\pi/2$ phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked…
The standard quantum search lacks a feature, enjoyed by many classical algorithms, of having a fixed point, i.e. monotonic convergence towards the solution. Recently a fixed point quantum search algorithm has been discovered, referred to as…
When applying Grover's algorithm to an unordered database, the probability of obtaining correct results usually decreases as the quantity of target increases. To amend the limitation, numbers of improved schemes are proposed. In this paper,…
Each iteration in Grover's original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation \theta and the…
This paper researches how the systematic errors in phase inversions affect the success rate and the number of iterations in optimized quantum random-walk search algorithm. Through geometric description of this algorithm, the model of the…
Here we suggest a modification of Grover's algorithm, based on a multiphase oracle which marks each solution with a different phase when there is more than one solution. Such a modification can be used to maintain a high probability of…
Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $\lambda$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $\lambda$ is…
We study the generalized Grover's algorithm with an arbitrary amplitude vector to find the optimal phase change for maximizing the gain in probability for the target of each iteration. In the classic setting of Grover's algorithm with a…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
It is found that Grover's quantum search algorithm is not robust against phase inversion and Hadmard transformation inaccuracies. Imperfect phase inversions and Hadmard-Walsh transformations in Grover's quantum search algorithm lead to…