Related papers: Robustness of different modifications of Grovers a…
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…
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…
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 our previous works, we have studied quantum random walk search algorithm on hypercube, with traversing coin constructed by using generalized Householder reflection and a phase multiplier. When the same phases are used each iteration, the…
Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator…
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,…
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…
In this article we consider an experimental study showing the influence of emotion regulation strategies on human memory performance: part of such experimental results are difficult to explain within a classic cognitive allocation model. We…
This paper examines the stability of the quantum random walk search algorithm, when the walk coin is constructed by generalized Householder reflection and additional phase shift, against inaccuracies in the phases used to construct the…
In this paper, we study decoherence on Grover's quantum searching algorithm using a perturbative method. We assume that each two-state system (qubit) suffers \sigma_{z} error with probability p (0\leq p\leq 1) independently at every step in…
Evolution of entanglement with the proceeding of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one.…
We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our…
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…
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…
We investigate the performance of Grover's algorithm on three different generations of IBM Heron QPUs. On Heron family of IBM QPUs the success probabilities for three, four and five qubits without dynamical decoupling is better than results…
We study the characterisation of efficient and non-efficient families of Grover's algorithms according to the majorization principle. We develop a geometrical interpretation based on the parameters that appears on these algorithms. Using…
We study the effects of dissipation or leakage on the time evolution of Grover's algorithm for a quantum computer. We introduce an effective two-level model with dissipation and randomness (imperfections), which is based upon the idea that…
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…
Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We…
The original Grover's algorithm has a success probability to output a correct solution, while deterministic Grover's algorithms improve the success probability to 100%. However, the success probability of deterministic Grover's algorithm…