The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Coding theorem and strong converse for quantum channels
Open accessAbstract
We present a new proof of Holevo's (1973, 1977) coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfwitz's (1964) combinatorial approach using types of sequences. As a byproduct of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Quantum theory of open systems
Davies, E. B. (1976) · Cited by 2,416
The capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
Quantum nonlocality without entanglement
Bennett, C. H., DiVincenzo, D. P., Fuchs, C. A., Mor, T., Rains, E., Shor, P. W., Smolin, J. A., & Wootters, W. K. (1999) · Physical Review A · doi:10.1103/physreva.59.1070 · Cited by 1,130
Schumacher, B. (1995) · Physical Review A · doi:10.1103/physreva.51.2738 · Cited by 1,090
Sending classical information via noisy quantum channels
Schumacher, B., & Westmoreland, M. D. (1997) · Physical Review A · doi:10.1103/physreva.56.131 · Cited by 1,087
Classical information capacity of a quantum channel
Hausladen, P., Jozsa, R., Schumacher, B., Westmoreland, M., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.1869 · Cited by 498
Coding Theorems of Information Theory
Wolfowitz, J. (1978) · Springer eBooks · doi:10.1007/978-3-642-66822-7 · Cited by 391
A new basic theorem of information theory
Feinstein, A. (1954) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1954.1057459 · Cited by 245
Strong converse to the quantum channel coding theorem
Ogawa, T., & Nagaoka, H. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796386 · Cited by 173
Coding Theorems for Quantum Channels
Holevo, A. S. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9809023 · Cited by 164
Coding Theorems of Information Theory
Wolfowitz, J. (1964) · Springer eBooks · doi:10.1007/978-3-662-00237-7 · Cited by 151
Coding Theorems of Quantum Information TheoryPreprint
Winter, A. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9907077 · Cited by 143
Self-citationProblems in the mathematical theory of quantum communication channels
Holevo, A. S. (1977) · Reports on Mathematical Physics · doi:10.1016/0034-4877(77)90010-6 · Cited by 82
Operational capacity and pseudoclassicality of a quantum channel
Fujiwara, A., & Nagaoka, H. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.669165 · Cited by 63
On Quantum Communication Channels with Constrained InputsPreprint
Holevo, A. S. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9705054 · Cited by 28
Coding theorems for quantum communication channels
Holevo, A. S. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.1998.708669 · Cited by 23
Languages of Quantum Information TheoryPreprint
Winter, A. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9807008 · Cited by 5
Self-citation
Cited by
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
The Physics of Quantum Information
(2000) · doi:10.1007/978-3-662-04209-0 · Cited by 1,086
Distillation of secret key and entanglement from quantum states
Devetak, I., & Winter, A. (2005) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2004.1372 · Cited by 877
Self-citationThe Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823
Metadata
- Authors
- Winter, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1999
- Volume
- 45
- Issue
- 7
- Pages
- 2481-2485
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2114473497
- Cited by
- 451
- References
- 18
- FWCI
- 4.07
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.