On Quantum Algorithm for Binary Search and Its Computational Complexity
Quantum Physics
2013-06-24 v1 Information Theory
math.IT
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.
Cite
@article{arxiv.1306.5039,
title = {On Quantum Algorithm for Binary Search and Its Computational Complexity},
author = {S. Iriyama and M. Ohya and I. V. Volovich},
journal= {arXiv preprint arXiv:1306.5039},
year = {2013}
}
Comments
8 pages, no figures