arXiv (All)
open access
Quantum Query Complexity for List Search
Searching in a linked list is one of the most basic problems in classical algorithms. Although the nodes of the list come with memory addresses, classically those addresses play no role in the cost of search: one simply starts at the head and follows successor pointers to search for an element. In t
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 Quantum Algorithms for Ordered Search#1119366
- Quantum Algorithms on Edge Lists: Hiding, Shuffling, and Cycle Finding#1037691
- Simultaneously Query-Optimal Quantum Linear-System Algorithm#1118759
- Quantum lower bounds for convex optimization and real matrix-vector query problems#972730
- Centralised multi link measurement compression with side information#1011934
Record · ID 1143337
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