Communication Over Entanglement-Breaking Channels With Unreliable Entanglement Assistance

05/28/2023

∙

by   Uzi Pereg, et al.

∙

0

∙

share

Entanglement assistance can improve communication rates significantly. Yet, its generation can easily fail. The recently-introduced model of unreliable assistance accounts for those challenges. Previous work provided an asymptotic formula for the tradeoff between the unassisted and excess rates from entanglement assistance. We derive a full characterization for entanglement-breaking channels, and show that combining entanglement-assisted and unassisted coding is suboptimal. From a networking perspective, this finding is nontrivial and highlights a quantum behavior arising from superposition.