A Generalization of Grover's Algorithm
| dc.creator | Accardi, Luigi | |
| dc.creator | Sabbadini, Ruben | |
| dc.date | 2000-12-27 | |
| dc.date.accessioned | 2026-07-07T06:01:26Z | |
| dc.date.available | 2026-07-07T06:01:26Z | |
| dc.description | We investigate the necessary and sufficient conditions in order that a unitary operator can amplify a pre-assigned component relative to a particular basis of a generic vector at the expense of the other components. This leads to a general method which allows, given a vector and one of its components we want to amplify, to choose the optimal unitary operator which realizes that goal. Grover's quantum algorithm is shown to be a particular case of our general method. However the general structure of the unitary we find is remarkably similar to that of Grover's one: a sign flip of one component combined with a reflection with respect to a vector. In Grover's case this vector is fixed; in our case it depends on a parameter and this allows optimization. | |
| dc.description | 20 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0012143 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0012143 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/89258 | |
| dc.subject | Quantum Physics | |
| dc.title | A Generalization of Grover's Algorithm | |
| dc.type | text |