pith. sign in

arxiv: 1011.1974 · v1 · pith:UJCJHU6Bnew · submitted 2010-11-09 · 🪐 quant-ph · cs.IT· math.IT

One-shot Multiparty State Merging

classification 🪐 quant-ph cs.ITmath.IT
keywords protocolmergingstateperforminganalyzeentanglementmixedmultiparty
0
0 comments X
read the original abstract

We present a protocol for performing state merging when multiple parties share a single copy of a mixed state, and analyze the entanglement cost in terms of min- and max-entropies. Our protocol allows for interpolation between corner points of the rate region without the need for time-sharing, a primitive which is not available in the one-shot setting. We also compare our protocol to the more naive strategy of repeatedly applying a single-party merging protocol one party at a time, by performing a detailed analysis of the rates required to merge variants of the embezzling states. Finally, we analyze a variation of multiparty merging, which we call split-transfer, by considering two receivers and many additional helpers sharing a mixed state. We give a protocol for performing a split-transfer and apply it to the problem of assisted entanglement distillation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.