Positivity of linear maps under tensor powers

Abstract

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with $n$ copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every $n\in \mathbb{N}$ there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all $n$. For higher dimensions we reduce the existence question of such non-trivial "tensor-stable positive maps" to a one-parameter family of maps and show that an affirmative answer would imply the existence of NPPT bound entanglement. As an application we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We furthermore show that the latter is an upper bound even for the LOCC-assisted quantum capacity, and that moreover it is a strong converse rate for this task.

25 pages, no figures

References in corpus (2)

• Unitary designs and codes
• Entanglement-annihilating and entanglement-breaking channels

Cited by in corpus (32)

• Converse bounds for private communication over quantum channels
• Monotonicity of the Quantum Relative Entropy Under Positive Maps
• Divisibility of quantum dynamical maps and collision models
• Multivariate Trace Inequalities
• Relative Entropy Bounds on Quantum, Private and Repeater Capacities
• Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map
• Semidefinite programming relaxations for quantum correlations
• Semidefinite programming converse bounds for quantum communication
• Fundamental limitation on quantum broadcast networks
• When Do Composed Maps Become Entanglement Breaking?
• Causal limit on quantum communication
• Amortization does not enhance the max-Rains information of a quantum channel
• Exponentially many entanglement and correlation constraints for multipartite quantum states
• Pursuing the fundamental limits for quantum communication
• Capacity Estimates via comparison with TRO channels
• Absolutely separating quantum maps and channels
• Ultimate entanglement robustness of two-qubit states against general local noises
• Entanglement detection with trace polynomials
• Positive tensor products of qubit maps and n-tensor-stable positive qubit maps
• Positive maps and trace polynomials from the symmetric group
• Temperley-Lieb quantum channels
• Exact entanglement cost of quantum states and channels under PPT-preserving operations
• Decomposability of Linear Maps under Tensor Products
• Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
• Annihilating Entanglement Between Cones
• Estimate distillable entanglement and quantum capacity by squeezing useless entanglement
• Halos and undecidability of tensor stable positive maps
• Many bounded versions of undecidable problems are NP-hard
• All incompatible measurements on qubits lead to multiparticle Bell nonlocality
• Bipartite Bound Entanglement
• Spin polarization-scaling quantum maps and channels
• Decomposable Pauli diagonal maps and Tensor Squares of Qubit Maps