CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing

Almost-iid information theory

arXiv Quantum Archived Mar 18, 2026 ✓ Full text saved

arXiv:2603.15792v1 Announce Type: new Abstract: Information-theoretic techniques are based on the assumption that resources are well characterized by independent and identically distributed (iid) states. This assumption cannot be justified operationally, since, for example, correlations between subsequent systems emitted by a source cannot be detected by any practical tomographic protocol. Operationally motivated symmetry assumptions still imply, via de Finetti theorems, that the resources are d

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 16 Mar 2026] Almost-iid information theory Giulia Mazzola, David Sutter, Renato Renner Information-theoretic techniques are based on the assumption that resources are well characterized by independent and identically distributed (iid) states. This assumption cannot be justified operationally, since, for example, correlations between subsequent systems emitted by a source cannot be detected by any practical tomographic protocol. Operationally motivated symmetry assumptions still imply, via de Finetti theorems, that the resources are described by almost-iid states. This raises the question: Are almost-iid resources as effective as perfect iid resources for information-processing tasks? Here we address this question and prove that the conditional entropy of almost-iid states asymptotically coincides with that of iid states. As an application, this implies that squashed entanglement is robust for almost-iid states, asymptotically matching its value on iid states. Comments: 33 pages Subjects: Quantum Physics (quant-ph); Information Theory (cs.IT) Cite as: arXiv:2603.15792 [quant-ph]   (or arXiv:2603.15792v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2603.15792 Focus to learn more Submission history From: David Sutter [view email] [v1] Mon, 16 Mar 2026 18:21:47 UTC (40 KB) Access Paper: view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-03 Change to browse by: cs cs.IT math math.IT References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Archived
    Mar 18, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗