Constant-Time Quantum Algorithm For The Unstructured Search Problem

Details Constant-Time Quantum Algorithm For The Unstructured Search Problem Constant-Time Quantum Algorithm For The Unstructured Search Problem

2008-11-26

arxiv.org/abs/0811.4247v1

Physics

Quantum Physics

11 pages

Scientific paper

Given an item and a list of values of size $N$. It is required to decide if
such item exists in the list. Classical computer can search for the item in
O(N). The best known quantum algorithm can do the job in $O(\sqrt{N})$. In this
paper, a quantum algorithm will be proposed that can search an unstructured
list in O(1) to get the YES/NO answer with certainty.

Affiliated with

Also associated with

No associations

Rating

Constant-Time Quantum Algorithm For The Unstructured Search Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constant-Time Quantum Algorithm For The Unstructured Search Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constant-Time Quantum Algorithm For The Unstructured Search Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-274237