Multi-object searching algorithm using subgrouped oracles
| dc.creator | Hsieh, Jin-Yuan | |
| dc.creator | Li, Che-Ming | |
| dc.creator | Chuu, Der-San | |
| dc.date | 2002-05-28 | |
| dc.date | 2002-06-16 | |
| dc.date.accessioned | 2026-07-07T06:04:15Z | |
| dc.date.available | 2026-07-07T06:04:15Z | |
| dc.description | We present in this work, if a set of well organized suboracles is available, an algorithm for multiobject search with certainty in an unsorted database of $N$ items. Depending on the number of the objects, the technique of phase tunning is included in the algorithm. If one single object is to be searched, this algorithm performs a factor of two improvement over the best algorithm for a classical sorted database. While if the number of the objects is larger than one, the algorithm requires slightly less than $\log_{4}N$ queries, but no classical counterpart exists since the resulting state is a superposition of the marked states. | |
| dc.description | 4 pages, 1 figures, RevTex4 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0205175 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0205175 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90233 | |
| dc.subject | Quantum Physics | |
| dc.title | Multi-object searching algorithm using subgrouped oracles | |
| dc.type | text |