Smooth Entropy Bounds on One-Shot Quantum State Redistribution

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.

v3: 29 pages, 1 figure, extended strong converse discussion

References in corpus (6)

• Quantum information can be negative
• The mother of all protocols: Restructuring quantum information's family tree
• Renyi generalizations of the conditional quantum mutual information
• Smooth Entropy Bounds on One-Shot Quantum State Redistribution
• Quantum state redistribution based on a generalized decoupling
• On simultaneous min-entropy smoothing

Cited by in corpus (24)

• Quantum message compression with applications
• Quantum Channel Simulation and the Channel's Smooth Max-Information
• Fundamental work cost of quantum processes
• The Fidelity of Recovery is Multiplicative
• Catalytic Decoupling of Quantum Information
• Strong converse theorems using Rényi entropies
• Smooth Entropy Bounds on One-Shot Quantum State Redistribution
• Deconstruction and conditional erasure of quantum correlations
• A generalized quantum Slepian-Wolf
• Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction
• Conditional quantum one-time pad
• An upper bound on the second order asymptotic expansion for the quantum communication cost of state redistribution
• A one-shot achievability result for quantum state redistribution
• Efficient methods for one-shot quantum communication
• One-shot quantum state redistribution and quantum Markov chains
• One-Shot Hybrid State Redistribution
• Quantum State Merging for Arbitrarily Small-Dimensional Systems
• Teleportation with Embezzling Catalysts
• One-shot quantum state exchange
• Noisy quantum state redistribution with promise and the Alpha-bit
• Communication with Quantum Catalysts
• State transfer with quantum side information
• Expected communication cost of distributed quantum tasks
• On the Entanglement Cost of One-Shot Compression