Smooth Entropy Bounds on One-Shot Quantum State Redistribution

DOI10.1109/TIT.2016.2516006MaRDI QIDQ2976978zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mario Berta, Matthias Christandl, Dave Touchette

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Measures of information, entropy (94A17)

Abstract: In quantum state redistribution as introduced in [Luo and Devetak (2009)] and [Devetak and Yard (2008)], there are four systems of interest: the $A$ system held by Alice, the $B$ system held by Bob, the $C$ system that is to be transmitted from Alice to Bob, and the $R$ system that holds a purification of the state in the $ABC$ registers. We give upper and lower bounds on the amount of quantum communication and entanglement required to perform the task of quantum state redistribution in a one-shot setting. Our bounds are in terms of the smooth conditional min- and max-entropy, and the smooth max-information. The protocol for the upper bound has a clear structure, building on the work [Oppenheim (2008)]: it decomposes the quantum state redistribution task into two simpler quantum state merging tasks by introducing a coherent relay. In the independent and identical (iid) asymptotic limit our bounds for the quantum communication cost converge to the quantum conditional mutual information $I(C:R|B)$, and our bounds for the total cost converge to the conditional entropy $H(C|B)$. This yields an alternative proof of optimality of these rates for quantum state redistribution in the iid asymptotic limit. In particular, we obtain a strong converse for quantum state redistribution, which even holds when allowing for feedback.

Recommendations

• A One-Shot Achievability Result for Quantum State Redistribution
• Entropic lower bound for distinguishability of quantum states
• scientific article; zbMATH DE number 1098885
• Entropy and entanglement bounds for reduced density matrices of fermionic states
• Smooth Entropies and the Quantum Information Spectrum
• Optimal uniform continuity bound for conditional entropy of classical-quantum states
• Optimal decompositions of quantum states with respect to entropy
• One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps
• Entropy-energy inequalities for qudit states

Cited in

(4)

• State transfer with quantum side information
• An upper bound on the second order asymptotic expansion for the quantum communication cost of state redistribution
• Strong converse theorems using Rényi entropies
• One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps

This page was built for publication: Smooth Entropy Bounds on One-Shot Quantum State Redistribution

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