Paper detail

On Quantum Algorithm for Binary Search and Its Computational Complexity

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.

preprint2013arXivOpen access

S. Iriyama M. Ohya I. V. Volovich

math.IT Information Theory quant-ph

0citations

0reviews

0saves

Nocode

Nodataset

0institutions

Next steps

Decide what to do with this paper

Like0 Dislike0Score 0

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Save to reading list0

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Authors

S. Iriyama M. Ohya I. V. Volovich

Institutions

No institution affiliation has been imported for this paper yet.

Add specific reaction

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.

On Quantum Algorithm for Binary Search and Its Computational Complexity

Decide what to do with this paper

Keep the important context close to the paper

Authors

Institutions

Research map

Building this graph slice

0 review(s)

0 comment(s)