Quantum Partial Search of a Database with Several Target Items

Simple item page
dc.creatorChoi, Byung-Soo
dc.creatorKorepin, Vladimir
dc.date2006-08-11
dc.date2006-10-12
dc.date.accessioned2026-07-07T08:04:16Z
dc.date.available2026-07-07T08:04:16Z
dc.descriptionWe 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.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0608106
dc.identifierhttp://arxiv.org/abs/quant-ph/0608106
dc.identifierQuantum Information Processing, vol 6, Number 4, page 37, 2007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129889
dc.subjectQuantum Physics
dc.titleQuantum Partial Search of a Database with Several Target Items
dc.typetext

Files

Collections

arXiv