Entropy accumulation
From MaRDI portal
Abstract: We ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an -partite system corresponds to the sum of the entropies of its parts . The Asymptotic Equipartition Property implies that this is indeed the case to first order in , under the assumption that the parts are identical and independent of each other. Here we show that entropy accumulation occurs more generally, i.e., without an independence assumption, provided one quantifies the uncertainty about the individual systems by the von Neumann entropy of suitably chosen conditional states. The analysis of a large system can hence be reduced to the study of its parts. This is relevant for applications. In device-independent cryptography, for instance, the approach yields essentially optimal security bounds valid for general attacks, as shown by Arnon-Friedman et al.
The authors show that entropy accumulation (in the sense that the total uncertainty about an \(n\)-partite system \(A = (A_1, \dots, A_n)\) corresponds to the sum of the entropies of its parts \(A_i\)) takes place in a more general framework than expected, no independence assumption being necessary, when one quantifies the uncertainty about the individual systems \(A_i\) via the von Neumann entropy of suitably chosen conditional states. Under this hypothesis, one can analyze the parts of a large system instead of studying it in its entirety, a property which turns out to be very useful when dealing with applications like the one in device-independent cryptography discussed here.
Recommendations
Cites work
- A Fully Quantum Asymptotic Equipartition Property
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- A limit of the quantum Rényi divergence
- A Mathematical Theory of Communication
- A monogamy-of-entanglement game with applications to device-independent quantum cryptography
- A proof of the security of quantum key distribution (extended abstract)
- Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
- Chain Rules for Smooth Min- and Max-Entropies
- Conditional density operators and the subjectivity of quantum operations
- Cryptography in the Bounded-Quantum-Storage Model
- De Finetti reductions for correlations
- Dense quantum coding and a lower bound for 1-way quantum automata
- Dense quantum coding and quantum finite automata
- Duality Between Smooth Min- and Max-Entropies
- Entanglement Sampling and Applications
- Entropy Accumulation With Improved Second-Order Term
- From repeated to continuous quantum interactions
- scientific article; zbMATH DE number 3533409 (Why is no real title available?)
- Monotonicity of a relative Rényi entropy
- New hash functions and their use in authentication and set equality
- On an inequality of Lieb and Thirring
- On quantum Rényi entropies: a new generalization and some properties
- Quantum conditional mutual information and approximate Markov chains
- Quantum cryptography based on Bell’s theorem
- Quantum cryptography without Bell’s theorem
- Quantum cryptography: public key distribution and coin tossing
- Relating different quantum generalizations of the conditional Rényi entropy
- Relations Between Quantum Maps and Quantum States
- Repeated interactions in open quantum systems
- Sandwiched Rényi divergence satisfies data processing inequality
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Simple and tight device-independent security proofs
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- SUFFICIENCY OF CHANNELS OVER VON NEUMANN ALGEBRAS
- The theory of quantum information
- Unconditional Security From Noisy Quantum Storage
- Unconditional security in quantum cryptography
Cited in
(19)- Estimating security of the quantum key distribution from the guesswork
- Trading locality for time: certifiable randomness from low-depth circuits
- Simple and tight device-independent security proofs
- Asymptotic reversibility of thermal operations for interacting quantum spin systems via generalized quantum Stein's lemma
- Estimating the Shannon entropy and (un)certainty relations for design-structured POVMs
- Universal security for randomness expansion from the spot-checking protocol
- Uniform continuity bound for sandwiched Rényi conditional entropy
- De Finetti theorems for quantum conditional probability distributions with symmetry
- Certified randomness from quantum supremacy
- Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
- Improved device-independent randomness expansion rates using two sided randomness
- Smooth min-entropy lower bounds for approximation chains
- Additivity and chain rules for quantum entropies via multi-index Schatten norms
- The future of secure communications: device independence in quantum key distribution
- Asymptotic equipartition theorems in von Neumann algebras
- Universal chain rules from entropic triangle inequalities
- A direct product theorem for quantum communication complexity with applications to device-independent cryptography
- Generalized quantum asymptotic equipartition
- Generalised entropy accumulation
This page was built for publication: Entropy accumulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2206013)
