On Quantum Algorithm for Binary Search and Its Computational Complexity
classification
🪐 quant-ph
cs.ITmath.IT
keywords
algorithmsearchcomplexitycomputationalproblemquantumbinarycontaining
read the original abstract
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.