Related papers: On Quantum Algorithm for Binary Search and Its Com…
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 introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.
Quantum mechanical search induces polynomial speed up in an unsorted database search process. In case of classical linear search the computational time increases with the dimensionality of the query. However, quantum parallelism, inherent…
The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen.…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
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 introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to…
Quantum Search Algorithm made a big impact by being able to solve the search problem for a set with $N$ elements using only $O(\sqrt{N})$ steps. Unfortunately, it is impossible to reduce the order of the complexity of this problem, however,…
We review some of quantum algorithms for search problems: Grover's search algorithm, its generalization to amplitude amplification, the applications of amplitude amplification to various problems and the recent quantum algorithms based on…
We study the quantum search algorithm as an open system. More specifically, we analyze the responses of that algorithm to an external monochromatic field, and to the decoherences introduced by the measurement process. We find that the…
We propose the use of a quantum algorithm to deal with the problem of searching with errors in the framework of two-person games. Specifically, we present a solution to the Ulam's problem that polynomially reduces its query complexity and…
Detection of symmetry is vital to problem solving. Most of the problems of computer vision and computer graphics and machine intelligence in general, can be reduced to symmetry detection problem. Unstructured search problem can also be…
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…
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem…
In this paper we will present a quantum algorithm which works very efficiently in case of multiple matches within the search space and in the case of few matches, the algorithm performs classically. This allows us to propose a hybrid…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
Given an item and a list of values of size $N$. It is required to decide if such item exists in the list. Classical computer can search for the item in O(N). The best known quantum algorithm can do the job in $O(\sqrt{N})$. In this paper, a…
We consider in this paper the possibility of embedding a quantum search algorithm within a classical binary search framework. The result appears promising: taking full advantage of quantum parallelism, we show that it may actually be…