The GRK algorithm is asymptotically optimal for partial quantum search in the large-block limit, proven via a control-theoretic analysis using the Pontryagin maximum principle.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm
The GRK algorithm is asymptotically optimal for partial quantum search in the large-block limit, proven via a control-theoretic analysis using the Pontryagin maximum principle.