The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Strong converse for identification via quantum channels
Open accessAbstract
We present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's (1979, 1992) approach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in self-adjoint operators on a Hilbert space. This theory is presented separately in an appendix, and we illustrate it by showing its application to quantum generalizations of classical hypergraph covering problems.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
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
Operator Algebras and Quantum Statistical Mechanics
Bratteli, O., & Robinson, D. W. (1997) · Springer eBooks · doi:10.1007/978-3-662-03444-6 · Cited by 2,985
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
Schumacher, B. (1995) · Physical Review A · doi:10.1103/physreva.51.2738 · Cited by 1,090
Operator Algebras and Quantum Statistical Mechanics
Bratteli, O., & Robinson, D. W. (1979) · Springer eBooks · doi:10.1007/978-3-662-02313-6 · Cited by 929
�ber monotone Matrixfunktionen
L�wner, K. (1934) · Mathematische Zeitschrift · doi:10.1007/bf01170633 · Cited by 752
Convex trace functions and the Wigner-Yanase-Dyson conjecture
Lieb, E. H. (1973) · Advances in Mathematics · doi:10.1016/0001-8708(73)90011-x · Cited by 653
Coding theorem and strong converse for quantum channels
Winter, A. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796385 · Cited by 451
Self-citationAhlswede, R., & Dueck, G. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.42172 · Cited by 316
Self-citationProbabilities on Algebraic Structures.
Loynes, R. M., & Grenander, U. (1964) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344022 · Cited by 316
Jensen's inequality for operators and L�wner's theorem
Hansen, F., & Kj�rg�rd Pedersen, G. (1982) · Mathematische Annalen · doi:10.1007/bf01450679 · Cited by 257
Lower Bounds for the Helmholtz Function
Golden, S. (1965) · Physical Review · doi:10.1103/physrev.137.b1127 · Cited by 233
Inequality with Applications in Statistical Mechanics
Thompson, C. J. (1965) · Journal of Mathematical Physics · doi:10.1063/1.1704727 · Cited by 232
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
The coding of messages subject to chance errors
Wolfowitz, J. (1957) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255380682 · Cited by 162
Problems 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
Compression of quantum-measurement operations
Winter, A., & Massar, S. (2001) · Physical Review A · doi:10.1103/physreva.64.012311 · Cited by 31
Self-citation
Cited by
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R. (2012) · Compressed Sensing · doi:10.1017/cbo9780511794308.006 · Cited by 2,150
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
Quantum State Tomography via Compressed Sensing
Gross, D., Liu, Y.-K., Flammia, S. T., Becker, S., & Eisert, J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.150401 · Cited by 1,093
Operational Resource Theory of Coherence
Winter, A., & Yang, D. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.120404 · Cited by 933
Self-citationHigh-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Metadata
- Authors
- Ahlswede, R., & Winter, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2002-03
- Volume
- 48
- Issue
- 3
- Pages
- 569-579
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2134348739
- Cited by
- 423
- References
- 20
- FWCI
- 6.69
- 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.