Tight bounds on quantum searching

  title={Tight bounds on quantum searching},
  author={Michel Boyer and Gilles Brassard and Peter Hoeyer and Alain Tapp},
  journal={Protein Science},
We provide a tight analysis of Grover''s recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine the number of iterations necessary to achieve almost certainty of finding the answer. Furthermore, we analyse the behaviour of the algorithm when the element to be found appears more than once in the table and we provide a new algorithm to find such an… Expand
0 v 2 2 D ec 1 99 9 Grover ’ s quantum searching algorithm is optimal
I show that for any number of oracle lookups up to about π/4 √ N , Grover's quantum searching algorithm gives the maximal possible probability of finding the desired element. I explain why this isExpand
From linear combination of quantum states to Grover's searching algorithm
Linear combination of unitaries (LCU for short) is one of the most important techniques in designing quantum algorithms. In this paper, we propose a new quantum algorithm in three different forms toExpand
Stability of Grover’s algorithm in respect to perturbations in quantum circuit
Quantum computing uses a special kind of superposition, which allows exponentially many logical states simultaneously. This is a powerful feat, and no classical computer can achieve it. QuantumExpand
Grover's Quantum Search Algorithm and Diophantine Approximation
This work considers the following computational problem: A subset of marked elements is given whose number of elements is either M or K, and shows how to solve this problem with a high probability of success using iterations of Grover's basic step only, and no other algorithm. Expand
An Exact Quantum Search Algorithm with Arbitrary Database
In standard Grover’s algorithm for quantum searching, the probability of finding a marked state is not exactly 1, and some modified versions of Grover’s algorithm that search a marked state from anExpand
Deriving Grover's lower bound from simple physical principles
Grover's algorithm constitutes the optimal quantum solution to the search problem and provides a quadratic speed-up over all possible classical search algorithms. Quantum interference betweenExpand
Noise in Grover’s quantum search algorithm
Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modeled easily because of the exact recursion formulasExpand
A panoply of quantum algorithms
A breadth-first search that is faster than Θ(edges) in a dense graph, maximum-points-on-a-line in O(N3/2 lgN) (faster than the fastest classical algorithm known), as well as several other algorithms that are similarly illustrative of solutions in some class of problem. Expand
Asymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the Probability of Finding a Diophantine Equation That Accepts Integer Solutions
Several mathematical problems can be modeled as a search in a database. An example is the problem of finding the minimum of a function. Quantum algorithms for solving this problem have been proposedExpand
Quantum Rough Counting and Its Application to Grover's Search Algorithm
An analysis of expected probability of the proposed algorithm taking into account the problem size, the number of satisfying items and the query complexity to show that the proposed modified Grover's search is optimal. Expand


Quantum cryptanalysis of hash and claw-free functions
A quantum algorithm that finds collisions in arbitrary functions after only O(3√N/τ) expected evaluations of the function, more efficient than the best possible classical algorithm, even allowing probabilism. Expand
A fast quantum mechanical algorithm for database search
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) . Expand
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Quantum mechanics can speed up a range of search applications over unsorted data. For example, imagine a phone directory containing $N$ names arranged in completely random order. To find someone'sExpand
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given. Expand
Searching a Quantum Phone Book
Finding a phone number in a directory when one knows the name is easy; much harder is finding the name given the number. On average, a search algorithm will have to scan half the total number ofExpand
Strengths and Weaknesses of Quantum Computing
It is proved that relative to an oracle chosen uniformly at random with probability 1 the class $\NP$ cannot be solved on a quantum Turing machine (QTM) in time $o(2^{n/2})$. Expand
Elementary gates for quantum computation.
U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits. Expand
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
Quantum measurements and the Abelian Stabilizer Problem
  • A. Kitaev
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 1996
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator. Expand
Rapid solution of problems by quantum computation
  • D. Deutsch, R. Jozsa
  • Mathematics
  • Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
  • 1992
A class of problems is described which can be solved more efficiently by quantum computation than by any classical or stochastic method. The quantum computation solves the problem with certainty inExpand