Two Notes on Grover's Search: Programming and Discriminating
arXiv:1406.6391 · doi:10.1140/epjp/i2014-14128-9
Abstract
In this work we address two questions concerning Grover's algorithm. In the first we give an answer to the question 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 unambiguous discrimination scheme even a seemingly good guess, that is close to the optimal one can result in a rather small success rate.
few pages, some figures
References in corpus (11)
- Quantum Mechanics helps in searching for a needle in a haystack
- Strengths and Weaknesses of Quantum Computing
- Grover's quantum searching algorithm is optimal
- Testing the Hilbert space dimension
- Optimum Unambiguous Discrimination Between Linearly Independent Symmetric States
- Effects of Noisy Oracle on Search Algorithm Complexity
- On the conditions for discrimination between quantum states with minimum error
- Assessing dimensions from evolution
- Unambiguous discrimination among oracle operators
- On Grover's Search Algorithm from a Quantum Information Geometry Viewpoint
- Exact Quantum Search by Parallel Unitary Discrimination Schemes