Grover search can determine the hardness-to-round of elementary functions over all n-bit inputs in a binade in O~(2^{n/2}) time, an asymptotic speedup for periodic functions in large binades.
10 [Ste06] Damien Stehlé
1 Pith paper cite this work, alongside 31 external citations. Polarity classification is still indexing.
1
Pith paper citing it
31
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The table maker's quantum search
Grover search can determine the hardness-to-round of elementary functions over all n-bit inputs in a binade in O~(2^{n/2}) time, an asymptotic speedup for periodic functions in large binades.