arXiv (All)
open access
Optimal Quantum Algorithms for Ordered Search
Ordered search is the problem of locating a target element in a sorted list of size $n$ using comparison queries. Classically, binary search requires $\lceil \log_2 n\rceil$ queries, which is optimal. Quantum algorithms offer a constant-factor speedup, but the precise constant has been a longstandin
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
- To What Extent Could Quantum Computing Pose a Threat to Global Modern Data Security?#311303
- Simultaneously Query-Optimal Quantum Linear-System Algorithm#1118759
- Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding#1157296
- Quantum Query Complexity of Finding a Tarski Fixed Point on a High-Dimensional Grid#926685
Record · ID 1119366
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