A Fully Quantum Asymptotic Equipartition Property

From MaRDI portal
Publication:4974118

DOI10.1109/TIT.2009.2032797zbMath1367.81095arXiv0811.1221OpenAlexW3100638609WikidataQ60026431 ScholiaQ60026431MaRDI QIDQ4974118

Renato Renner, Roger Colbeck, Marco Tomamichel

Publication date: 8 August 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.1221



Related Items

Entropic lower bound for distinguishability of quantum states, Non-equilibrium statistical mechanics inspired by modern information theory, Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication, Relating different quantum generalizations of the conditional Rényi entropy, Universal Security for Randomness Expansion from the Spot-Checking Protocol, Quantum sampling and entropic uncertainty, Bounds for smooth min- and max-entropy, Generalized smooth mutual max-information of quantum channel, Geometric distinguishability measures limit quantum channel estimation and discrimination, Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents, Different quantum f-divergences and the reversibility of quantum operations, Equality conditions for the quantum \(f\)-relative entropy and generalized data processing inequalities, Position-based coding and convex splitting for private communication over quantum channels, Min- and max-entropy in infinite dimensions, Families of completely positive maps associated with monotone metrics, Entropy accumulation, Inadequacy of von Neumann entropy for characterizing extractable work, The apex of the family tree of protocols: optimal rates and resource inequalities, One-shot decoupling, Characterizing entropy in statistical physics and in quantum information theory, Simple and Tight Device-Independent Security Proofs, Steganography protocols for quantum channels, Decoupling with unitary approximate two-designs, Quantum conditional mutual information and approximate Markov chains, Convexity of quasi-entropy type functions: Lieb's and Ando's convexity theorems revisited, The α → 1 limit of the sharp quantum Rényi divergence, Analysing causal structures with entropy, Weak locking capacity of quantum channels can be much larger than private capacity, Remarks on Kim's strong subadditivity matrix inequality: Extensions and equality conditions, Entanglement wedge reconstruction and the information paradox, On quantum Rényi entropies: A new generalization and some properties, THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT, Chain rules for quantum Rényi entropies, Rényi generalizations of the conditional quantum mutual information, The quantum reverse Shannon theorem based on one-shot information theory, Contraction coefficients for noisy quantum channels, The smooth entropy formalism for von Neumann algebras, Thermodynamic implementations of quantum processes, Entanglement-assisted private communication over quantum broadcast channels, Optimized quantumf-divergences and data processing, Exponential decay of correlations implies area law, One-shot randomized and nonrandomized partial decoupling, An upper bound on the second order asymptotic expansion for the quantum communication cost of state redistribution, Strong converse theorems using Rényi entropies, Decoding quantum information via the Petz recovery map, QUANTUM f-DIVERGENCES AND ERROR CORRECTION, Duality of privacy amplification against quantum adversaries and data compression with quantum side information, Quantum majorization on semi-finite von Neumann algebras, Applications of position-based coding to classical communication over quantum channels, Distilling entanglement from arbitrary resources, Unnamed Item, Investigating properties of a family of quantum Rényi divergences, Estimating security of the quantum key distribution from the guesswork, Measure of genuine coherence based of quasi-relative entropy, Quantum state discrimination bounds for finite sample size