arXiv (All)
open access
Computational Aspects of the Trace Norm Contraction Coefficient
We show that approximating the trace norm contraction coefficient of a quantum channel within a constant factor is NP-hard. Equivalently, this shows that determining the optimal success probability for encoding a bit in a quantum system undergoing noise is NP-hard. This contrasts with the classical
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
- A pretty-tight converse on the classical capacity of generalized amplitude-damping channels#1084561
- Robust classical and quantum communication over almost-iid channels#1155377
- Strong converse for the quantum capacity of the pure-loss bosonic channel#1122627
- Classical capacity of classical-quantum arbitrarily varying channels#492703
- A Spectrum-Based Converse for Quantum State Discrimination and Its Applications to Classical-Quantum Channel Coding#1215919
Record · ID 1354086
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