On the Power of PPT-Preserving and Non-Signalling Codes
On the Power of PPT-Preserving and Non-Signalling Codes
We derive one-shot upper bounds for quantum noisy channel codes. We do so by regarding a channel code as a bipartite operation with an encoder belonging to the sender and a decoder belonging to the receiver, and imposing constraints on the bipartite operation. We investigate the power of codes whose …