Related papers: Quantum search algorithms
A randomly walking quantum particle searches in Grover's $\Theta(\sqrt{N})$ iterations for a marked vertex on the complete graph of $N$ vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a…
We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to…
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…
Quantum amplitude amplification algorithm is an important and basic technique in quantum computing. In this paper, our goal is to study distributed quantum amplitude amplification algorithms, and the main contributions are: (1) A…
The method is introduced for fast data processing by reducing the probability amplitudes of undesirable elements. The algorithm has a mathematical description and circuit implementation on a quantum processor. The idea is to make a quick…
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 of n qubits. This approach reveals the geometrical structure of the quantum search process,…
We present a systematic construction of quantum circuits implementing Grover's database search algorithm for arbitrary number of targets. We introduce a new operator which flips the sign of the targets and evaluate its circuit complexity.…
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 consider the dating market decision problem under the quantum mechanics point of view. Quantum states whose associated amplitudes are modified by men strategies are used to represent women. Grover quantum search algorithm is used as a…
We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows…
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…
This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a square-root - a simple minded…
The translation of Grover's search algorithm from its standard version, designed for implementation on a single quantum system amenable to projective measurements, into one suitable for an ensemble of quantum computers, whose outputs are…
The Grover search algorithm is a pivotal advancement in quantum computing, promising a remarkable speedup over classical algorithms in searching unstructured large databases. Here, we report results for the implementation and…
We generalize Grover's unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover's…
The difference between classical and quantum algorithms (QA) is following: problem solved by QA is coded in the structure of the quantum operators. Input to QA in this case is always the same. Output of QA says which problem coded. In some…
We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a…
In this paper we give a quantum mechanical algorithm that can search a database by a single query, when the number of solutions is more than a quarter. It utilizes modified Grover operator of arbitrary phase.
The simplest technique for simulating a quantum algorithm - QA described based on the direct matrix representation of the quantum operators. Using this approach, it is relatively simple to simulate the operation of a QA and to perform…
Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries…