Randomized Grover search using random selection among constraint oracles achieves the same Θ(√(N/r)) query complexity and near-unit success probability as standard Grover without requiring a global oracle.
Journal of Systems Science and Complexity , year=
1 Pith paper cite this work, alongside 19 external citations. Polarity classification is still indexing.
1
Pith paper citing it
19
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Random Grover Search
Randomized Grover search using random selection among constraint oracles achieves the same Θ(√(N/r)) query complexity and near-unit success probability as standard Grover without requiring a global oracle.