Fixed Phase Quantum Search Algorithm
| dc.creator | Younes, Ahmed | |
| dc.date | 2007-04-12 | |
| dc.date | 2007-10-15 | |
| dc.date.accessioned | 2026-07-07T08:35:52Z | |
| dc.date.available | 2026-07-07T08:35:52Z | |
| dc.description | Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm that searches for M matches in an unstructured search space of size N will be presented. Selecting phase shifts of 1.91684πin the standard amplitude amplification will make the technique perform better so as to get probability of success at least 99.58% in O(sqrt(N/M)) better than any know fixed operator quantum search algorithms. The algorithm will be able to handle either a single match or multiple matches in the search space. The algorithm will find a match in O(sqrt(N/M)) whether the number of matches is known or not in advance. | |
| dc.description | 10 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/0704.1585 | |
| dc.identifier | http://arxiv.org/abs/0704.1585 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/139882 | |
| dc.subject | Quantum Physics | |
| dc.title | Fixed Phase Quantum Search Algorithm | |
| dc.type | text |