Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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
References:
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.
Funding agency Grant number
JSPS KAKENH 26247016
Supported in part by the JSPS KAKENHI, grant no. 26247016.
Received: 09.02.2016
English version:
Problems of Information Transmission, 2016, Volume 52, Issue 3, Pages 201–213
DOI: https://doi.org/10.1134/S0032946016030017
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.7
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Bus16}
\by F.~Buscemi
\paper Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation
\jour Probl. Peredachi Inf.
\yr 2016
\vol 52
\issue 3
\pages 3--16
\mathnet{http://mi.mathnet.ru/ppi2209}
\transl
\jour Problems Inform. Transmission
\yr 2016
\vol 52
\issue 3
\pages 201--213
\crossref{https://doi.org/10.1134/S0032946016030017}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000386570000001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84991670410}
Linking options:
  • https://www.mathnet.ru/eng/ppi2209
  • https://www.mathnet.ru/eng/ppi/v52/i3/p3
  • This publication is cited in the following 34 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:299
    Full-text PDF :38
    References:48
    First page:7
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024