arXiv (All)
open access
The Sample Complexity of Quantum Entanglement Allocation
How many past requests are needed to decide which qubits should share entanglement? We show that the answer depends on the allocation choices created by the queries: a larger memory can require no more data. The memory stores a classical bit and answers requests through a fixed detector that preserv
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
- Scaling Network Topologies for Multi-User Entanglement Distribution#155449
- Emulation of Entanglement Distribution Networks on a Quantum Computer#373356
- Asymptotic Entanglement Hiding under Stabilizer Restrictions#1144865
- Static classical-quantum-entanglement trade-offs: an entropic converse and single-letter characterizations#1049041
- Strong converse for the quantum capacity of the pure-loss bosonic channel#1122627
Record · ID 997054
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