Semidefinite Programming Strong Converse Bounds for Classical Capacity
Semidefinite Programming Strong Converse Bounds for Classical Capacity
We investigate the classical communication over quantum channels when assisted by no-signaling and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the one-shot E-error capacity are formalized as semidefinite programs (SDPs). Based on this, we obtain improved SDP finite blocklength converse bounds …