Strength and Weakness in Grover's Quantum Search Algorithm
| dc.creator | Younes, Ahmed | |
| dc.date | 2008-11-27 | |
| dc.date.accessioned | 2026-07-07T12:06:09Z | |
| dc.date.available | 2026-07-07T12:06:09Z | |
| dc.description | Grover's quantum search algorithm is considered as one of the milestone in the field of quantum computing. The algorithm can search for a single match in a database with $N$ records in $O(\sqrt{N})$ assuming that the item must exist in the database with quadratic speedup over the best known classical algorithm. This review paper discusses the performance of Grover's algorithm in case of multiple matches where the problem is expected to be easier. Unfortunately, we will find that the algorithm will fail for $M>3N/4$, where $M$ is the number of matches in the list. | |
| dc.description | Review paper, 15 pages | |
| dc.identifier | https://arxiv.org/abs/0811.4481 | |
| dc.identifier | http://arxiv.org/abs/0811.4481 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/208575 | |
| dc.subject | Quantum Physics | |
| dc.title | Strength and Weakness in Grover's Quantum Search Algorithm | |
| dc.type | text |