The quantum query complexity of finding a Tarski fixed point on the 2D grid is Omega((log n)^2).
Tarski lower bounds from multi-dimensional herringbones
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Quantum Query Complexity of Finding a Tarski Fixed Point on the 2D Grid
The quantum query complexity of finding a Tarski fixed point on the 2D grid is Omega((log n)^2).