Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 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

Positively Factorizable Maps (2012.02429v2)

Published 4 Dec 2020 in math.OA, math.FA, and quant-ph

Abstract: We initiate a study of linear maps on $M_n(\mathbb{C})$ that have the property that they factor through a tracial von Neumann algebra $(\mathcal{A,\tau})$ via operators $Z\in M_n(\mathcal{A})$ whose entries consist of positive elements from the von-Neumann algebra. These maps often arise in the context of non-local games, especially in the synchronous case. We establish a connection with the convex sets in $\mathbb{R}n$ containing self-dual cones and the existence of these maps. The Choi matrix of a map of this kind which factors through an abelian von-Neumann algebra turns out to be a completely positive (CP) matrix. We fully characterize positively factorizable maps whose Choi rank is 2. We also provide some applications of this analysis in finding doubly nonnegative matrices which are not CPSD. A special class of these examples is found from the concept of Unextendible Product Bases in quantum information theory.

Summary

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