arXiv (All)
open access
A Sum-of-Squares Hierarchy with Quadratic Convergence for Quantum Channel Coding
Computing the optimal success probability for transmitting classical messages through a single use of a quantum channel is NP-hard, even for two messages. An existing semidefinite programming hierarchy based on symmetric extensions provides convergent upper bounds with an a priori error estimate tha
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
- Explicit channels with unbounded gains in classical communication using entangled inputs#1062669
- Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes#642074
- A weak Hellinger inequality for noisy Boolean channels#1076191
- On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions#1129204
- Scaling Network Topologies for Multi-User Entanglement Distribution#155449
Record · ID 987965
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