arXiv (All)
open access
On the undecidability of quantum channel capacities
An important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or even efficiently compute) the capacity? While there is overwhelming evidence suggesting that quantum channel capacities 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
- Strong converse for the quantum capacity of the pure-loss bosonic channel#1122627
- Explicit channels with unbounded gains in classical communication using entangled inputs#1062669
- Ancilla-assisted nondestructive discrimination of distributed GHZ-class states#975148
- Entanglement distribution protocols under imperfect fidelity and quantum memory conditions#246487
- Quantifying Nonstabilizerness of Quantum Codes by Removing the Inert Background#973778
Record · ID 997463
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