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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Depth-efficient quantum search algorithms exhibit a palindromic structure allowing substantial circuit-depth reductions over standard Grover search while preserving amplitude amplification.
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.
-
Palindromic structure of depth-efficient quantum search algorithms
Depth-efficient quantum search algorithms exhibit a palindromic structure allowing substantial circuit-depth reductions over standard Grover search while preserving amplitude amplification.