Quantum Achievability Proof via Collision Relative Entropy

DOI10.1109/TIT.2014.2361632MaRDI QIDQ2979187zbMATH OpenFDO

Authors Salman Beigi, Amin Gohari

Publication date 2 May 2017

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

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

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Measures of information, entropy (94A17)

Abstract: In this paper, we provide a simple framework for deriving one-shot achievable bounds for some problems in quantum information theory. Our framework is based on the joint convexity of the exponential of the collision relative entropy, and is a (partial) quantum generalization of the technique of Yassaee et al. (2013) from classical information theory. Based on this framework, we derive one-shot achievable bounds for the problems of communication over classical-quantum channels, quantum hypothesis testing, and classical data compression with quantum side information. We argue that our one-shot achievable bounds are strong enough to give the asymptotic achievable rates of these problems even up to the second order.

Cited in

(7)

• The holographic entropy zoo
• Fundamental finite key limits for one-way information reconciliation in quantum key distribution
• Decoding quantum information via the Petz recovery map
• On the second-order asymptotics for entanglement-assisted communication
• Rényi relative entropies of quantum Gaussian states
• Common Information, Noise Stability, and Their Extensions
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels

This page was built for publication: Quantum Achievability Proof via Collision Relative Entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979187)