arXiv (All)
open access
Random Order in Quantum Streaming: Replenishment and Robust Lower Bounds
How can random order change the role of quantum memory in streaming? Later classical input can restore the usefulness of a quantum state consumed by earlier queries. We call this replenishment. We construct an artificial problem based on Hidden Matching, with repeated coordinate data and online ma
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
- Technical analysis of the Resource-efficient Quantum Walkers Quantum Random Access Memory#1145187
- Improved Join Order Optimization for Database Queries using Hybrid Quantum-Classical Approaches for QUBO Problems#282897
- An Information-Theoretic Principle for Optimal Quantum Encoding: Tight Frames and Equiangular Ensembles#1248497
- Centralised multi link measurement compression with side information#1011934
- Optimal Quantum Algorithms for Ordered Search#1119366
Record · ID 1215814
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