Distributed Monogamy of Entanglement limits Quantum Channel Simulation

Abstract:Entanglement is monogamous: if it is shared among more than two parties, the entanglement between any pair cannot be very strong. For an integer $k\geq 2$, $k$-extendibility of a state $\rho_{AB}$ quantifies this as the number of copies of $B$ that can be simulated by the state's environment. We introduce fractional extendibility, which gives a finer characterization of the quantum correlation that is leaked to the environment, and prove that it is invariant under tensor products and monotonic under local processing. We also establish the distributed monogamy of entanglement: for any state on $AB_1B_2\dots B_n$, the maximum average probability of extracting an EPR pair from a random subset of $k \leq n/2$ systems among the $B_i$'s is the fraction $k/n$. With these tools we resolve a conjecture posed by Matthew Hastings: any quantum erasure channel with erasure probability at least $\frac{1}{2}$ cannot simulate a less noisy erasure channel, even with asymptotically many uses of the noisier channel.

6 pages, 5 pages of supplemental material, 2 figures; Proof of Hastings' conjecture on erasure channel simulation from fractional extendibility and distributed monogamy of entanglement. See arXiv:2607.17319 for an independent proof of the erasure-simulation conjecture

arXiv:2607.08591 [quant-ph]

(or arXiv:2607.08591v2 [quant-ph] for this version)