Abstract
Problems which can be solved on classical computer in polynomial time may not be able to be solved on quantum computer. And a quantum algorithm will be invalid if the Oracle can’t be efficiently implemented. Thus, in this paper, a quantum binary search algorithm is presented. The computation complexity is polynomial time. Based on the algorithm, the quantum meet-in-the-middle search algorithm for knapsack problem can be efficiently realized on quantum computer. Especially the algorithm can be applied to search an element from an ordered database.
Full Text
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call