Quick Navigation

Topics

Trapped Ion Quantum Computing

Bi-Quadratic Improvement in Conditional Quantum Search

arXiv
Authors: Akankshya Dash, Biswaranjan Panda, Arun K Pati

Year

2023

Paper ID

52648

Status

Preprint

Abstract Read

~2 min

Abstract Words

107

Citations

N/A

Abstract

The Grover search algorithm performs an unstructured search of a marked item in a database quadratically faster than classical algorithms and is shown to be optimal. Here, we show that if the search space is divided into two blocks with the local query operators and the global operators satisfy certain condition, then it is possible to achieve an improvement of bi-quadratic speed-up. Furthermore, we investigate the bi-quadratic speed-up in the presence of noise and show that it can tolerate noisy scenario. This may have potential applications for diverse fields, including database searching, and optimization, where efficient search algorithms play a pivotal role in solving complex computational problems.

Why This Paper Matters

  • This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
  • It adds a 2023 reference point for readers tracking recent quantum research.
  • The Grover search algorithm performs an unstructured search of a marked item in a database quadratically faster than classical algorithms and is shown to be optimal.

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.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #52648

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.