Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Decomposability of Linear Maps under Tensor Products (1805.11570v2)

Published 29 May 2018 in quant-ph, math-ph, math.FA, math.MP, and math.OA

Abstract: Both completely positive and completely copositive maps stay decomposable under tensor powers, i.e under tensoring the linear map with itself. But are there other examples of maps with this property? We show that this is not the case: Any decomposable map, that is neither completely positive nor completely copositive, will lose decomposability eventually after taking enough tensor powers. Moreover, we establish explicit bounds to quantify when this happens. To prove these results we use a symmetrization technique from the theory of entanglement distillation, and analyze when certain symmetric maps become non-decomposable after taking tensor powers. Finally, we apply our results to construct new examples of non-decomposable positive maps, and establish a connection to the PPT squared conjecture.

Summary

We haven't generated a summary for this paper yet.