Fetching marked items from an unsorted database in NMR ensemble computing

Details Fetching marked items from an unsorted database in NMR ensemble computing Fetching marked items from an unsorted database in NMR ensemble computing

2001-12-26

arxiv.org/abs/quant-ph/0112162v1

Phys. Rev. A66,052320 (2002)

Physics

Quantum Physics

4 pages and 1 figure

Scientific paper

10.1103/PhysRevA.66.052320

Searching a marked item or several marked items from an unsorted database is a very difficult mathematical problem. Using classical computer, it requires $O(N=2^n)$ steps to find the target. Using a quantum computer, Grover's algorithm uses $O(\sqrt{N=2^n})$ steps. In NMR ensemble computing, Brushweiler's algorithm uses $\log N$ steps. In this Letter, we propose an algorithm that fetches marked items in an unsorted database directly. It requires only a single query. It can find a single marked item or multiple number of items.

Affiliated with

Also associated with

No associations

Rating

Fetching marked items from an unsorted database in NMR ensemble computing 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 Fetching marked items from an unsorted database in NMR ensemble computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fetching marked items from an unsorted database in NMR ensemble computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509282