Test-State Approach to the Quantum Search Problem
arXiv:1102.3628 · doi:10.1103/PhysRevA.83.052311
Abstract
The search for "a quantum needle in a quantum haystack" is a metaphor for the problem of finding out which one of a permissible set of unitary mappings---the oracles---is implemented by a given black box. Grover's algorithm solves this problem with quadratic speed-up as compared with the analogous search for "a classical needle in a classical haystack." Since the outcome of Grover's algorithm is probabilistic---it gives the correct answer with high probability, not with certainty---the answer requires verification. For this purpose we introduce specific test states, one for each oracle. These test states can also be used to realize "a classical search for the quantum needle" which is deterministic---it always gives a definite answer after a finite number of steps---and faster by a factor of 3.41 than the purely classical search. Since the test-state search and Grover's algorithm look for the same quantum needle, the average number of oracle queries of the test-state search is the classical benchmark for Grover's algorithm.
11 pages, 5 figures
References in corpus (9)
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Measurement-based quantum computation with cluster states
- Tight bounds on quantum searching
- Grover's quantum searching algorithm is optimal
- On Arbitrary Phases in Quantum Amplitude Amplification
- Experimental Demonstration of Optimal Unambiguous State Discrimination
- How well can you know the edge of a quantum pyramid?
- Hybrid Quantum Computation