Related papers: Strength and Weakness in Grover's Quantum Search A…
It is suggested that the individual outcomes of a measurement process can be understood within standard quantum mechanics in terms of the measuring apparatus, treated as a quantum computer, executing Grover's search algorithm.
Grover search is a well-known quantum algorithm that outperforms any classical search algorithm. It is known that quantum correlations such as entanglement are necessary for the power of quantum computation. But entanglement is not the only…
Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\lambda$ of…
Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude…
There are major advantages in a newer version of Grover's quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject…
Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any physical system that allows superposition of states. A physical realization of this algorithm is described using…
We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version…
Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any system that allows superposition of states. A physical realization of this algorithm is described using coupled…
We report on an experiment on Grover's quantum search algorithm showing that {\em classical waves} can search a $N$-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed…
In a recent paper (quant-ph/0506105), A S Gupta, M. Gupta and A. Pathak proposed a modified Grover algorithm that would exponentially accelerate the unsorted database search problem if the number of marked items is known. If this were true,…
Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied…
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…
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…
This paper describes a quantum algorithm for proof search in sequent calculus of a subset of Linear Logic using the Grover Search Algorithm. We briefly overview the Grover Search Algorithm and Linear Logic, show the detailed steps of the…
Grover's algorithm is normally presented as a method of searching a database, however it would be more accurately described as a method of identifying elements of an interval of the integers which satisfy some logical clause - an example…
The operations of data set, such as intersection, union and complement, are the fundamental calculation in mathematics. It's very significant that designing fast algorithm for set operation. In this paper, the quantum algorithm for…
This paper shows that a quantum mechanical algorithm that can query information relating to multiple items of the database, can search a database in a single query (a query is defined as any question to the database to which the database…
I investigate whether it would technologically and economically make sense to build database search engines based on Grover's quantum search algorithm. The answer is not fully conclusive but in my judgement rather negative.