How fast can a quantum computer search?
| dc.creator | Grover, Lov K. | |
| dc.date | 1998-09-10 | |
| dc.date | 1999-04-13 | |
| dc.date.accessioned | 2026-07-07T06:15:39Z | |
| dc.date.available | 2026-07-07T06:15:39Z | |
| dc.description | This paper gives a simple proof of why a quantum computer, despite being in all possible states simultaneously, needs at least 0.707 sqrt(N) queries to retrieve a desired item from an unsorted list of items. The proof is refined to show that a quantum computer would need at least 0.785 sqrt(N) queries. The quantum search algorithm needs precisely this many queries. | |
| dc.description | Postscript, 7 pages. This proof tries to give a simple argument why the search algorithm is optimal (This paper was originally put out on quant-ph on September 9, 1998, the present version has several important improvements) | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9809029 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9809029 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93819 | |
| dc.subject | Quantum Physics | |
| dc.title | How fast can a quantum computer search? | |
| dc.type | text |