Journal
QUANTUM INFORMATION PROCESSING
Volume 6, Issue 1, Pages 1-8Publisher
SPRINGER
DOI: 10.1007/s11128-006-0037-y
Keywords
quantum database search; Grover's algorithm; partial search; sure success
Ask authors/readers for more resources
Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available