Quantum Partial Search of a Database with Several Target Items

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages

Scientific paper

We consider a database separated into blocks. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We consider a case, when each target block has the same number of target items. We present a fast quantum algorithm, which finds one of the target blocks. Our algorithm is based on Grover-Radhakrishnan algorithm of partial search. We minimize the number of queries to the oracle.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantum Partial Search of a Database with Several Target Items 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 Quantum Partial Search of a Database with Several Target Items, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Partial Search of a Database with Several Target Items will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-586454

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.