Amplitude amplification constructs dynamic search trees of depth m with query complexity √(b_avg^m), outperforming worst-case assumptions and quantum backtracking for problems lacking natural backtracking structure.
Q., Tcholtchev, N., and Hauswirt, M
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
-
Beyond Worst-Case Branching: Quantum Tree Search via Amplitude Amplification
Amplitude amplification constructs dynamic search trees of depth m with query complexity √(b_avg^m), outperforming worst-case assumptions and quantum backtracking for problems lacking natural backtracking structure.