Exactness of the Original Grover Search Algorithm

Abstract

It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.

8 pages, 2 figures

References in corpus (1)

• Grover Algorithm with zero theoretical failure rate

Cited by in corpus (8)

• Depth optimization of quantum search algorithms beyond Grover's algorithm
• Coherence number as a discrete quantum resource
• A brief introduction to quantum algorithms
• An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
• Quantum search on noisy intermediate-scale quantum devices
• An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits
• Near-deterministic quantum search algorithm without phase design
• Distributed Exact Generalized Grover's Algorithm