A framework for fast quantum mechanical algorithms
| dc.creator | Grover, Lov K. | |
| dc.date | 1997-11-20 | |
| dc.date | 1998-03-05 | |
| dc.date.accessioned | 2026-07-07T06:14:34Z | |
| dc.date.available | 2026-07-07T06:14:34Z | |
| dc.description | A framework is presented for the design and analysis of quantum mechanical algorithms, the sqrt(N) step quantum search algorithm is an immediate consequence of this framework. It leads to several other search-type applications - several examples are presented. Also, it leads to quantum mechanical algorithms for problems not immediately connected with search - two such algorithms are presented for estimating the mean and median of statistical distributions. Both algorithms require fewer steps than the fastest possible classical algorithms; also both are considerably simpler and faster than existing quantum mechanical algorithms for the respective problems. | |
| dc.description | The paper has been rewritten, two illustrative figures have been added. It is to be presented at STOC '98 in May '98 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9711043 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9711043 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93510 | |
| dc.subject | Quantum Physics | |
| dc.title | A framework for fast quantum mechanical algorithms | |
| dc.type | text |