The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Min- and Max-Relative Entropies and a New Entanglement Monotone
Open accessAbstract
Two new relative entropy quantities, called the min- and max-relative entropies, are introduced and their properties are investigated. The well-known min- and max-entropies, introduced by Renner, are obtained from these. We define a new entanglement monotone, which we refer to as the max-relative entropy of entanglement, and which is an upper bound to the relative entropy of entanglement. We also generalize the min- and max-relative entropies to obtain smooth min-and max-relative entropies. These act as parent quantities for the smooth Renyi entropies (ETH Zurich, Ph.D. dissertation, 2005), and allow us to define the analogues of the mutual information, in the smooth Renyi entropy framework. Further, the spectral divergence rates of the information spectrum approach are shown to be obtained from the smooth min- and max-relative entropies in the asymptotic limit.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
On Measures of Entropy and Information
Rényi, A. (1961) · Project Euclid (Cornell University) · Cited by 4,031
Quantum detection and estimation theory
Helstrom, C. W. (1969) · Journal of Statistical Physics · doi:10.1007/bf01007479 · Cited by 3,776
Bhatia, R. (1996) · Cited by 2,847
Entanglement measures and purification procedures
Vedral, V., & Plenio, M. B. (1998) · Physical Review A · doi:10.1103/physreva.57.1619 · Cited by 1,419
SECURITY OF QUANTUM KEY DISTRIBUTION
RENNER, R. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003256 · Cited by 1,047
大矢, 雅., & Petz, D. (1993) · Cited by 817
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
Ohya, M., & Petz, D. (1993) · doi:10.1007/978-3-642-57997-4 · Cited by 764
Information-Spectrum Methods in Information Theory
Han, T. S. (2003) · Stochastic Modelling and Applied Probability · doi:10.1007/978-3-662-12066-8 · Cited by 682
Conditional expectation in an operator algebra. IV. Entropy and information
Umegaki, H. (1962) · Kodai Mathematical Journal · doi:10.2996/kmj/1138844604 · Cited by 677
The Operational Meaning of Min- and Max-Entropy
Konig, R., Renner, R., & Schaffner, C. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2025545 · Cited by 659
Discriminating States: The Quantum Chernoff Bound
Audenaert, K. M. R., Calsamiglia, J., Muñoz-Tapia, R., Bagan, E., Masanes, L., Acin, A., & Verstraete, F. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.160501 · Cited by 524
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
Coding theorem and strong converse for quantum channels
Winter, A. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796385 · Cited by 451
Local versus nonlocal information in quantum-information theory: Formalism and phenomena
Horodecki, M., Horodecki, P., Horodecki, R., Oppenheim, J., Sen(De), A., Sen, U., & Synak-Radtke, B. (2005) · Physical Review A · doi:10.1103/physreva.71.062307 · Cited by 449
Universally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
Quantum 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
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
Renner, R., & Wolf, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11593447_11 · Cited by 258
Smooth renyi entropy and applications
Renner, R., & Wolf, S. (2004) · International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. · doi:10.1109/isit.2004.1365269 · Cited by 174
An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
Nagaoka, H., & Hayashi, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.889463 · Cited by 133
Smooth Entropies and the Quantum Information Spectrum
Datta, N., & Renner, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018340 · Cited by 89
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
Continuity bounds on the quantum relative entropy — II
Audenaert, K. M. R., & Eisert, J. (2011) · Journal of Mathematical Physics · doi:10.1063/1.3657929 · Cited by 69
General formulas for fixed-length quantum entanglement concentration
Hayashi, M. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.872976 · Cited by 32
Asymptotic Entanglement Manipulation of Bipartite Pure States
Bowen, G., & Datta, N. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926377 · Cited by 17
Self-citationQuantum Coding Theorems for Arbitrary Sources, Channels and Entanglement ResourcesPreprint
Bowen, G., & Datta, N. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0610003 · Cited by 16
Self-citationSmooth Rényi Entropy of Ergodic Quantum Information SourcesPreprint
Schoenmakers, B., Tjoelker, J., Tuyls, P., et al. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0704.3504 · Cited by 6
Cited by
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
Fundamental limitations for quantum and nanoscale thermodynamics
Horodecki, M., & Oppenheim, J. (2013) · Nature Communications · doi:10.1038/ncomms3059 · Cited by 780
On quantum Rényi entropies: A new generalization and some properties
Müller-Lennert, M., Dupuis, F., Szehr, O., Fehr, S., & Tomamichel, M. (2013) · Journal of Mathematical Physics · doi:10.1063/1.4838856 · Cited by 729
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Metadata
- Authors
- Datta, N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-06
- Volume
- 55
- Issue
- 6
- Pages
- 2816-2826
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2132840498
- Cited by
- 491
- References
- 33
- FWCI
- 14.46
- 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.