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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Quantum, classical, and total amount of correlations in a quantum state
Groisman, B., Popescu, S., & Winter, A. (2005) · Physical Review A · doi:10.1103/physreva.72.032317 · Cited by 615
Self-citationEvaluating capacities of bosonic Gaussian channels
Holevo, A., & Werner, R. (2001) · Physical Review A · doi:10.1103/physreva.63.032312 · Cited by 576
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Wilde, M. M., Winter, A., & Yang, D. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2122-x · Cited by 516
Self-citationMin- and Max-Relative Entropies and a New Entanglement Monotone
Datta, N. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018325 · Cited by 491
Fundamental rate-loss tradeoff for optical quantum key distribution
Takeoka, M., Guha, S., & Wilde, M. M. (2014) · Nature Communications · doi:10.1038/ncomms6235 · Cited by 456
The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
Devetak, I., & Shor, P. W. (2005) · Communications in Mathematical Physics · doi:10.1007/s00220-005-1317-6 · Cited by 445
“Thus by the gentle measurement lemma [26]”
Strong converse for identification via quantum channels
Ahlswede, R., & Winter, A. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.985947 · Cited by 423
Self-citationQuantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.1203 · Cited by 330
General formulas for capacity of classical-quantum channels
Hayashi, M., & Nagaoka, H. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813556 · Cited by 327
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Shadow Tomography of Quantum States
Aaronson, S. (2020) · SIAM Journal on Computing · doi:10.1137/18m120275x · Cited by 315
The extraction of work from quantum coherence
Korzekwa, K., Lostaglio, M., Oppenheim, J., & Jennings, D. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023045 · Cited by 314
Relating the Resource Theories of Entanglement and Quantum Coherence
Chitambar, E., & Hsieh, M.-H. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.020402 · Cited by 276
Quantum State Merging and Negative Information
Horodecki, M., Oppenheim, J., & Winter, A. (2006) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0118-x · Cited by 269
Self-citationSecurity of quantum key distribution
Renner, R. (2005) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-005115027 · Cited by 263
A Decoupling Approach to the Quantum Capacity
Hayden, P., Horodecki, M., Winter, A., & Yard, J. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000043 · Cited by 170
Self-citationEntanglement-Assisted Communication of Classical and Quantum Information
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2053903 · Cited by 112
“Let denote the following “pruned state”: (75) For any and sufficiently large , the state is close to by the gentle measurement lemma [36] and the typical subspace theorem [8] For any density operator , it is possible to construct an EAQ code that achieves the quantum communication rate and…”
BackgroundIdentifying the Information Gain of a Quantum Measurement
Berta, M., Renes, J. M., & Wilde, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2365207 · Cited by 60
Weak Decoupling Duality and Quantum Identification
Hayden, P., & Winter, A. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191695 · Cited by 36
Self-citation
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.