Related papers: Grover's search algorithm and the quantum measurem…
Grover's search algorithm was a groundbreaking advancement in quantum algorithms, displaying a quadratic speed-up of querying for items. Since the creation of this algorithm it has been utilized in various ways, including in preparing…
Since Grover's seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items and we would like to find a marked item. We consider a new variant of this problem in which…
We describe a simulation method for a quantum spin model of a generic, general purpose quantum computer. The use of this quantum computer simulator is illustrated through several implementations of Grover's database search algorithm. Some…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…
We introduce the concepts of Grover operators and Grover kernels to systematically analyse Grover's searching algorithms. Then, we investigate a one-parameter family of quantum searching algorithms of Grover's type and we show that the…
In this work we address two questions concerning Grover's algorithm. In the first we give an answer to the question how to employ Grover's algorithm for actual search over database. We introduce a quantum model of an unordered phone book…
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…
Grover's quantum search algorithm is analyzed for the case in which the initial state is an arbitrary pure quantum state $|\phi>$ of $n$ qubits. It is shown that the optimal time to perform the measurement is independent of $| \phi>$,…
We present an information geometric characterization of Grover's quantum search algorithm. First, we quantify the notion of quantum distinguishability between parametric density operators by means of the Wigner-Yanase quantum information…
Evolution of entanglement with the processing 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.…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
We invoke an efficient search algorithms as a key challenge in multi-qubit quantum systems. An original algorithm called dynamical quantum search algorithm from which Grover algorithm is obtained at a specified time is presented. This…
The Groverian entanglement measure introduced earlier for pure quantum states [O. Biham, M.A. Nielsen and T. Osborne, Phys. Rev. A 65, 062312 (2002)] is generalized to the case of mixed states, in a way that maintains its operational…
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for an entanglement measure defined in terms of success rate of Grover's search algorithm…
Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, in particular Grover's algorithm, has aroused a…
We derive in this study a Hamiltonian to solve with certainty the analog quantum search problem analogue to the Grover algorithm. The general form of the initial state is considered. Since the evaluation of the measuring time for finding…
Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
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…
This article highlights some of the key operating principles of Grover algorithm. These principles were used to develop a new oracle function, that illustrates the possibility of using Grover algorithm for solving more realistic and…