Semidefinite programming converse bounds for quantum communication

Understand

We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime.

• First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of quantum information that can be transmitted over a single use of a quantum channel, which improve the previous bound from [Tomamichel/Berta/Renes, Nat.
• Commun.
• 7, 2016].