An upper bound on the second order asymptotic expansion for the quantum communication cost of state redistribution

Abstract

State redistribution is the protocol in which, given an arbitrary tripartite quantum state, with two of the subsystems initially being with Alice and one being with Bob, the goal is for Alice to send one of her subsystems to Bob, possibly with the help of prior shared entanglement. We derive an upper bound on the second order asymptotic expansion for the quantum communication cost of achieving state redistribution with a given finite accuracy. In proving our result, we also obtain an upper bound on the quantum communication cost of this protocol in the one-shot setting, by using the protocol of coherent state merging as a primitive.

11 pages, 1 figure

References in corpus (3)

• The mother of all protocols: Restructuring quantum information's family tree
• Smooth Entropy Bounds on One-Shot Quantum State Redistribution
• State redistribution as merging: introducing the coherent relay

Cited by in corpus (11)

• Quantum message compression with applications
• Fidelity of recovery, geometric squashed entanglement, and measurement recoverability
• The Fidelity of Recovery is Multiplicative
• Deconstruction and conditional erasure of quantum correlations
• Conditional quantum one-time pad
• A one-shot achievability result for quantum state redistribution
• Efficient methods for one-shot quantum communication
• One-Shot Hybrid State Redistribution
• Quantum State Merging for Arbitrarily Small-Dimensional Systems
• Noisy quantum state redistribution with promise and the Alpha-bit
• Squashed quantum non-Markovianity: a measure of genuine quantum non-Markovianity in states