Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation

November 28, 2015 Β· Declared Dead Β· πŸ› Problems of Information Transmission

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Francesco Buscemi arXiv ID 1511.08893 Category quant-ph: Quantum Computing Cross-listed cs.IT, math.ST Citations 37 Venue Problems of Information Transmission Last Checked 6 months ago
Abstract
Two partial orderings among communication channels, namely, `being degradable into' and `being less noisy than,' are reconsidered in the light of recent results about statistical comparisons of quantum channels. Though our analysis covers at once both classical and quantum channels, we also provide a separate treatment of classical noisy channels, and show how, in this case, an alternative self-contained proof can be constructed, with its own particular merits with respect to the general result.
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