The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
Open accessAbstract
We consider two fundamental tasks in quantum information theory, data compression with quantum side information, as well as randomness extraction against quantum side information. We characterize these tasks for general sources using so-called one-shot entropies. These characterizations-in contrast to earlier results-enable us to derive tight second-order asymptotics for these tasks in the i.i.d. limit. More generally, our derivation establishes a hierarchy of information quantities that can be used to investigate information theoretic tasks in the quantum domain: The one-shot entropies most accurately describe an operational quantity, yet they tend to be difficult to calculate for large systems. We show that they asymptotically agree (up to logarithmic terms) with entropies related to the quantum and classical information spectrum, which are easier to calculate in the i.i.d. limit. Our technique also naturally yields bounds on operational quantities for finite block lengths.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
Ohya, M., & Petz, D. (1993) · doi:10.1007/978-3-642-57997-4 · Cited by 764
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
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-citationUniversally 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
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
Self-citation
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Self-citationChitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Provably secure and high-rate quantum key distribution with time-bin qudits
Islam, N. T., Lim, C. C. W., Cahall, C., Kim, J., & Gauthier, D. J. (2017) · Science Advances · doi:10.1126/sciadv.1701491 · Cited by 355
Quantum Information Processing with Finite Resources
Tomamichel, M. (2016) · SpringerBriefs in Mathematical Physics · doi:10.1007/978-3-319-21891-5 · Cited by 329
Self-citationBeyond heat baths: Generalized resource theories for small-scale thermodynamics
Yunger Halpern, N., & Renes, J. M. (2016) · Physical Review E · doi:10.1103/physreve.93.022126 · Cited by 85
Metadata
- Authors
- Tomamichel, M., & Hayashi, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2013-11
- Volume
- 59
- Issue
- 11
- Pages
- 7693-7710
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1990187371
- Cited by
- 284
- References
- 24
- FWCI
- 25.40
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks. https://app.cochat.ai/papers/10.1109/tit.2013.2276628
- The paper
- Tomamichel, M., & Hayashi, M. (2013). A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2013.2276628
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.