The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
One-Shot Classical-Quantum Capacity and Hypothesis Testing
Open accessAbstract
The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we show that this capacity is well approximated by a relative-entropy-type measure defined via hypothesis testing. Combined with a quantum version of Stein's lemma, our results give a conceptually simple proof of the well-known Holevo-Schumacher-Westmoreland theorem for the capacity of memoryless channels. More generally, we obtain tight capacity formulas for arbitrary (not necessarily memoryless) channels.
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
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
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
A general formula for channel capacity
Verdu, S., & Han, T. S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335960 · Cited by 779
The proper formula for relative entropy and its asymptotics in quantum probability
Hiai, F., & Petz, D. (1991) · Communications in Mathematical Physics · doi:10.1007/bf02100287 · Cited by 522
Min- 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
A Fully Quantum Asymptotic Equipartition Property
Tomamichel, M., Colbeck, R., & Renner, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032797 · Cited by 356
Self-citationQuantum information : an introduction
林, 正. (2006) · Springer eBooks · Cited by 328
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
Strong converse and Stein's lemma in quantum hypothesis testing
Nagaoka, H., & Ogawa, T. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.887855 · Cited by 324
Kretschmann, D., & Werner, R. F. (2005) · Physical Review A · doi:10.1103/physreva.72.062323 · Cited by 236
The Quantum Capacity of Channels With Arbitrarily Correlated Noise
Buscemi, F., & Datta, N. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2039166 · Cited by 184
Hayashi, M. (2007) · Physical Review A · doi:10.1103/physreva.76.062301 · Cited by 174
Noisy Channel Coding via Privacy Amplification and Information Reconciliation
Renes, J. M., & Renner, R. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2162226 · Cited by 110
Self-citationA new proof of the channel coding theorem via hypothesis testing in quantum information theory
Ogawa, T., & Nagaoka, H. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2002.1023345 · Cited by 77
Generalized relative entropies and the capacity of classical-quantum channels
Mosonyi, M., & Datta, N. (2009) · Journal of Mathematical Physics · doi:10.1063/1.3167288 · Cited by 68
(2006) · doi:10.1007/3-540-30266-2 · Cited by 12
Information-theoretic aspects of optical communications
Wang, L. (2011) · doi:10.3929/ethz-a-006543410 · Cited by 2
Self-citation
Cited by
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Quantum 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
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
Metadata
- Authors
- Wang, L., & Renner, R.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2012-05-15
- Volume
- 108
- Issue
- 20
- Pages
- 200501-200501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2013695092
- Cited by
- 299
- References
- 17
- FWCI
- 18.36
- Type
- journal article
- Language
- en
- Open access
- bronze
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.