A Modification of Grover's Algorithm as a Fast Database Search
classification
🪐 quant-ph
keywords
databasealgorithmfastgrovermodificationsearchcasecorresponding
read the original abstract
A modification of Grover's algorithm is proposed, which can be used directly as a fast database search. An explicit two q-bit example is displayed in detail. We discuss the case where the database has multiple entries corresponding to the same target value.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.