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, 2000, Volume 36, Issue 4, Pages 25–34 (Mi ppi491)  

This article is cited in 104 scientific papers (total in 104 papers)

Information Theory

On the Additivity Conjecture in Quantum Information Theory

G. G. Amosov, A. S. Holevo, R. F. Werner
References:
Abstract: A class of problems in quantum information theory, which have elementary formulations but still resist solutions, concerns the additivity properties (with respect to tensor products of channels) of various quantities characterizing quantum channels such as the “classical capacity” or “maximal output purity.” All known results, including extensive numerical work, are consistent with this conjecture. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper, we state some additivity/multiplicativity problems, give relations between them, and prove some new partial results, which also support the conjecture.
Received: 23.05.2000
Bibliographic databases:
Document Type: Article
UDC: 621.391.1
Language: Russian
Citation: G. G. Amosov, A. S. Holevo, R. F. Werner, “On the Additivity Conjecture in Quantum Information Theory”, Probl. Peredachi Inf., 36:4 (2000), 25–34; Problems Inform. Transmission, 36:4 (2000), 305–313
Citation in format AMSBIB
\Bibitem{AmoHolWer00}
\by G.~G.~Amosov, A.~S.~Holevo, R.~F.~Werner
\paper On the Additivity Conjecture in Quantum Information Theory
\jour Probl. Peredachi Inf.
\yr 2000
\vol 36
\issue 4
\pages 25--34
\mathnet{http://mi.mathnet.ru/ppi491}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1813649}
\zmath{https://zbmath.org/?q=an:0983.81004}
\transl
\jour Problems Inform. Transmission
\yr 2000
\vol 36
\issue 4
\pages 305--313
Linking options:
  • https://www.mathnet.ru/eng/ppi491
  • https://www.mathnet.ru/eng/ppi/v36/i4/p25
  • This publication is cited in the following 104 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024