arXiv (All)
open access
Bootstrapping Classical and Quantum Query Lower Bounds for Finding Tarski Fixed Points
The Tarski fixed-point problem asks for a fixed point of a monotone map on a $k$-dimensional grid lattice of width $n$ and has applications in game theory, economics, and verification. Substantial gaps remain between the known upper and lower bounds on its quantum query complexity. We prove two ha
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms#972144
- Stronger Welch Bounds and Optimal Approximate $k$-Designs#1141487
- A note on the quantum Wielandt inequality#139157
- Time-space lower bounds for breaking quantum cryptography#1160915
- Time-space lower bounds for breaking quantum cryptography#1157449
Record · ID 1327799
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive