Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication

Topics

Quantum Optimization

On Quantum Algorithm for Binary Search and Its Computational Complexity

arXiv
Authors: S. Iriyama, M. Ohya, I. V. Volovich

Year

2013

Paper ID

8443

Status

Preprint

Abstract Read

~2 min

Abstract Words

31

Citations

N/A

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.

Why This Paper Matters

  • This paper contributes to the Quantum Optimization research area in the Quantum Articles archive.
  • It adds a 2013 reference point for readers tracking recent quantum research.
  • A new quantum algorithm for a search problem and its computational complexity are discussed.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in
Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:1306.5039 [2] arXiv https://arxiv.org/abs/1306.5039 [3] Publisher https://arxiv.org/abs/1306.5039

Local Citation Graph (Related-Paper Links)

Current Paper #8443

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.