On Quantum Algorithm for Binary Search and Its Computational Complexity

Satoshi Iriyama,Masanori Ohya,Igor Volovich

On Quantum Algorithm for Binary Search and Its Computational Complexity

2013

Satoshi Iriyama
Masanori Ohya
Igor Volovich

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:

Computational complexity theory
Time complexity
Discrete mathematics
Binary search algorithm
Search problem
Quantum algorithm
Algorithm
Mathematics

Correction
Cite
Save
Machine Reading By IdeaReader

References

Citations