GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL

@article{Zalka1999GROVERSQS,
  title={GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL},
  author={Christof Zalka},
  journal={Physical Review A},
  year={1999},
  volume={60},
  pages={2746-2751}
}
I show that for any number of oracle lookups up to about {pi}/4thinsp{radical} (N) , Grover{close_quote}s quantum searching algorithm gives the maximal possible probability of finding the desired element. I explain why this is also true for quantum algorithms which use measurements during the computation. I also show that unfortunately quantum searching cannot be parallelized better than by assigning different parts of the search space to independent quantum computers. {copyright} {ital 1999… Expand
Depth optimization of quantum search algorithms beyond Grover's algorithm
Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modernExpand
An Upper Bound on the Rate of Information Transfer by Grover's Oracle
TLDR
An information-theoretic analysis of Grover's algorithm is presented and it is shown that the square-root speed-up by Grover’s algorithm is the best possible by any algorithm using the same quantum oracle. Expand
Finding Matches between Two Databases on a Quantum Computer
Given two unsorted lists each of length N that have a single common entry, a quantum computer can find that matching element with a work factor of $O(N^{3/4}\log N)$ (measured in quantum memoryExpand
Quantum Algorithms for Highly Structured Search Problems
AbstractWe consider the problem of identifying a base k string given an oracle which returns information about the number of correct components in a query, specifically, the Hamming distance betweenExpand
Quantum Boolean circuit approach for searching an unordered database
TLDR
This paper shows how quantum Boolean circuits can be used to implement the oracle circuit and the inversion-about-average function in Grover's search algorithm and shows that a slight modification of the oracles circuit can be use to search multiple targets. Expand
Constant-Time Quantum Algorithm For The Unstructured Search Problem
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 doExpand
Bounds on quantum ordered searching
We prove that any exact quantum algorithm searching an ordered list of N elements requires more than \frac{1}{\pi}(\ln(N)-1) queries to the list. This improves upon the previously best known lowerExpand
How significant are the known collision and element distinctness quantum algorithms?
TLDR
The criterion that an algorithm width requires O(S) hardware to be considered significant if it produces a speedup of better than O(√S) over asimple quantum search algorithm is proposed. Expand
Simple Algorithm for Partial Quantum Search
TLDR
A quantum algorithm is presented for this problem of partial search that takes about 0.34 $$\sqrt{b}$$ fewer iterations than the quantum search algorithm. Expand
QUANTUM SEARCH ALGORITHM CAN BE IMPROVED
TLDR
The number of non-query operations can be reduced by a third without a single increase in the number of queries. Expand
...
1
2
3
4
5
...

References

SHOWING 1-5 OF 5 REFERENCES
Tight bounds on quantum searching
TLDR
A lower bound on the efficiency of any possible quantum database searching algorithm is provided and it is shown that Grover''s algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table. 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
A fast quantum mechanical algorithm for database search
TLDR
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
Distinguishability and Accessible Information in Quantum Theory
This document focuses on translating various information-theoretic measures of distinguishability for probability distributions into measures of distin- guishability for quantum states. TheseExpand
Tight bounds on quantum searching quant-ph
  • Tight bounds on quantum searching quant-ph