arXiv (All)
open access
Quantum Query Complexity of Finding a Tarski Fixed Point on a High-Dimensional Grid
The Knaster-Tarski fixed-point theorem states that every monotone function over a complete lattice has a fixed point. Beyond its fundamental role in order theory, the theorem and its algorithmic variants have found broad applications in areas such as economics, game theory, and programming languages
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
- The optimal search on graph by continuous-time quantum walks#821630
- Optimal Quantum Algorithms for Ordered Search#1119366
- Resource-Aware Quantum Programming with General Recursion and Quantum Control#670409
- Resource-Aware Quantum Programming with General Recursion and Quantum Control#668344
- Optimal dense materialization of the stabilizer formalism without polynomial overhead#1131507
Record · ID 926685
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