Quantum search for multiple items using parallel queries
| dc.creator | Grover, Lov K. | |
| dc.creator | Radhakrishnan, Jaikumar | |
| dc.date | 2004-07-27 | |
| dc.date.accessioned | 2026-07-07T06:10:26Z | |
| dc.date.available | 2026-07-07T06:10:26Z | |
| dc.description | In the quantum database search problem we are required to search for an item in a database. In this paper, we consider a generalization of this problem, where we are provided d identical copes of a database each with N items which we can query in parallel. Then, given k items, we are required to determine the locations where these items are stored. We show that any quantum algorithm for this task must perform Omega(sqrt{Nk/d min{d,k}}) parallel queries. We also design an algorithm whose performance comes within a factor O(log d) of this lower bound. | |
| dc.description | Six pages; no figures, LaTeX | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0407217 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0407217 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/92258 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum search for multiple items using parallel queries | |
| dc.type | text |