Two notes on Grover’s search: Programming and discriminating
| Authors | |
|---|---|
| Year of publication | 2014 |
| Type | Article in Periodical |
| Magazine / Source | European Physical Journal Plus |
| MU Faculty or unit | |
| Citation | |
| Web | http://link.springer.com/article/10.1140/epjp/i2014-14128-9 |
| Doi | http://dx.doi.org/10.1140/epjp/i2014-14128-9 |
| Field | Information theory |
| Keywords | quantum computing; Grover's search algorithm |
| Description | In this work we address two questions concerning Grover’s algorithm. In the first part we give an answer to the question on how to employ Grover’s algorithm for actual search over database. We introduce a quantum model of an unordered phone book (quantum database) with programmable queries to search in the phone book either for a number or for a name. In the second part we investigate how successful the algorithm can be if the number of elements of the database is not known precisely. This question reduces to analysis of the distinguishability of states occurring during Grover’s algorithm. We found that using an unambiguous discrimination scheme even a seemingly good guess that is close to the optimal one, can result in a rather small success rate. |
| Related projects: |