Entanglement-assisted capacities of compound quantum channels

March 07, 2016 Β· Declared Dead Β· πŸ› IEEE Transactions on Information Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Mario Berta, Hrant Gharibyan, Michael Walter arXiv ID 1603.02282 Category quant-ph: Quantum Computing Cross-listed cs.IT, math-ph Citations 15 Venue IEEE Transactions on Information Theory Last Checked 5 months ago
Abstract
We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the set that the channel is selected from. We investigate different variations of the problem: uninformed users, informed receiver, informed sender, and feedback assistance. We derive single-letter formulas for all corresponding channel capacities. Our proofs are based on one-shot decoupling bounds and properties of smooth entropies.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted