On Quantum Algorithm for Binary Search and Its Computational Complexity
2013
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.
Keywords:
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
2
References
0
Citations
NaN
KQI