Sure Success Partial Search

Authors:
Byung-Soo Choi;Thomas A. Walker;Samuel L. Braunstein
Affiliations:
Department of Computer Science, University of York, York, UK Y010 5DD;Department of Computer Science, University of York, York, UK Y010 5DD;Department of Computer Science, University of York, York, UK Y010 5DD
Venue:
Quantum Information Processing
Year:
2007

Citing 5
Cited 2

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Is partial quantum search of a database any easier?

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Simple Algorithm for Partial Quantum Search

Quantum Information Processing
Quest for Fast Partial Search Algorithm

Quantum Information Processing

Quantum Partial Search of a Database with Several Target Items

Quantum Information Processing
Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.