On the Power of PPT-Preserving and Non-Signalling Codes
From MaRDI portal
Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68) Quantum coding (general) (81P70) Information theory (general) (94A15)
Abstract: 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 bipartite operation is non-signalling from Alice to Bob, positive-partial transpose (PPT) preserving, or both, and derive a simple semidefinite program for the achievable entanglement fidelity. Using the semidefinite program, we show that the non-signalling assisted quantum capacity for memoryless channels is equal to the entanglement-assisted capacity. We also relate our PPT-preserving codes and the PPT-preserving entanglement distillation protocols studied by Rains. Applying these results to a concrete example, the 3-dimensional Werner-Holevo channel, we find that codes that are non-signalling and PPT-preserving can be strictly less powerful than codes satisfying either one of the constraints, and therefore provide a tighter bound for unassisted codes. Furthermore, PPT-preserving non-signalling codes can send one qubit perfectly over two uses of the channel, which has no quantum capacity. We discuss whether this can be interpreted as a form of superactivation of quantum capacity.
Cited in
(9)- Semidefinite programming hierarchies for constrained bilinear optimization
- Amortized channel divergence for asymptotic quantum channel discrimination
- On the second-order asymptotics for entanglement-assisted communication
- Converse bounds for quantum and private communication over Holevo-Werner channels
- Computable lower bounds on the entanglement cost of quantum channels
- Semi-definite programming and quantum information
- Postselected communication over quantum channels
- Linear programming with unitary-equivariant constraints
- Error exponent of activated non-signaling-assisted classical-quantum channel coding
This page was built for publication: On the Power of PPT-Preserving and Non-Signalling Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977357)
