arXiv (All)
open access
Optimal compression with quantum retrieval
We consider the following data compression problem. Given a string $x \in \{0,1\}^m$ of Hamming weight at most $n$, compress it into a shorter string $y \in \{0,1\}^s$ so that any bit $x_i$ of $x$ can be retrieved without any error using at most $t$ quantum queries to the standard oracle encoding of
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
- Centralised multi link measurement compression with side information#1011934
- An Information-Theoretic Principle for Optimal Quantum Encoding: Tight Frames and Equiangular Ensembles#1248497
- Surpassing the loss-noise robustness trade-off in quantum key distribution#392152
- Quantum Query Advantage Requires Space#1077425
- Empirical Quantum Advantage in Constrained Optimization from Encoded Unitary Designs#1357060
Record · ID 1215790
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