On Quantum Algorithm for Binary Search and Its Computational Complexity
Abstract
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2n objects that our algorithm runs in polynomial time.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.