RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2016 Volume 52, Issue 3, Pages 3–16 (Mi ppi2209)

This article is cited in 39 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.

UDC: 621.391.1+519.7

Received: 09.02.2016


 English version:
Problems of Information Transmission, 2016, 52:3, 201–213

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026