2005/06/12 by Anupam Gupta, A. S. Gupta, A. Pathak +3
Computer Science · Physics and Astronomy · #Advanced Database Systems and Queries #Algorithms and Data Compression #FOS: Physical sciences #Handwritten Text Recognition Techniques #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0506093
This paper has been withdrawn by the authors due to some conceptual error
openalex publication_date 2005/06/12 · arxiv created 2014/07/10 · arxiv updated 2014/07/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The present letter proposes a modification in the well known Grover's search algorithm, which searches a database of N unsorted items in O(√(N/M)) steps, where M represents the number of solutions to the search problem. Concurrency control techniques and extra registers for marking and storing the solutions are used in the modified algorithm. This requires additional space but it is shown that the use of extra register and marking techniques can reduce the time complexity to O(M+log N).