Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication

Topics

Quantum State Preparation Representation

Exactness of the Original Grover Search Algorithm

arXiv
Authors: Zijian Diao

Year

2010

Paper ID

10804

Status

Preprint

Abstract Read

~2 min

Abstract Words

64

Citations

N/A

Abstract

It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.

Why This Paper Matters

  • This paper contributes to the Quantum State Preparation & Representation research area in the Quantum Articles archive.
  • It adds a 2010 reference point for readers tracking recent quantum research.
  • It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty.

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:1010.3652 [2] arXiv https://arxiv.org/abs/1010.3652 [3] Publisher https://arxiv.org/abs/1010.3652

Local Citation Graph (Related-Paper Links)

Current Paper #10804

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.