|
Problemy Peredachi Informatsii, 2016, Volume 52, Issue 3, Pages 3–16
(Mi ppi2209)
|
|
|
|
This article is cited in 34 scientific papers (total in 34 papers)
Information Theory
Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation
F. Buscemi Department of Computer Science and Mathematical Informatics, Nagoya University, Nagoya, Japan
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.
Received: 09.02.2016
Citation:
F. Buscemi, “Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation”, Probl. Peredachi Inf., 52:3 (2016), 3–16; Problems Inform. Transmission, 52:3 (2016), 201–213
Linking options:
https://www.mathnet.ru/eng/ppi2209 https://www.mathnet.ru/eng/ppi/v52/i3/p3
|
Statistics & downloads: |
Abstract page: | 299 | Full-text PDF : | 38 | References: | 48 | First page: | 7 |
|