Related papers: Composition of PPT Maps
For many completely positive maps repeated compositions will eventually become entanglement breaking. To quantify this behaviour we develop a technique based on the Schmidt number: If a completely positive map breaks the entanglement with…
We analyze certain class of linear maps on matrix algebras that become entanglement breaking after composing a finite or infinite number of times with themselves. This means that the Choi matrix of the iterated linear map becomes separable…
In this paper, we provide a structure theorem and various characterizations of degradable strongly entanglement breaking maps on separable Hilbert spaces. In the finite dimensional case, we prove that unital degradable entanglement breaking…
We prove that the PPT$^2$ conjecture holds for linear maps between matrix algebras which are covariant under the action of the diagonal unitary group. Many salient examples, like the Choi-type maps, depolarizing maps, dephasing maps,…
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…
In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure…
Structural approximations to positive, but not completely positive maps are approximate physical realizations of these non-physical maps. They find applications in the design of direct entanglement detection methods. We show that many of…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
We analyze a class of entangled states for bipartite $d \otimes d$ systems, with $d$ non-prime. The entanglement of such states is revealed by the construction of canonically associated entanglement witnesses. The structure of the states is…
We consider entanglement witnesses arising from positive linear maps which generate exposed extremal rays. We show that every entanglement can be detected by one of these witnesses, and this witness detects a unique set of entanglement…
One of the most fundamental questions in quantum information theory is PPT-entanglement of quantum states, which is an NP-hard problem in general. In this paper, however, we prove that all PPT $(\overline{\pi}_A\otimes \pi_B)$-invariant…
In \cite{CMW19}, the authors introduced $k$-entanglement breaking linear maps to understand the entanglement breaking property of completely positive maps on taking composition. In this article, we do a systematic study of $k$-entanglement…
The problem of bound entanglement detection is a challenging aspect of quantum information theory for higher dimensional systems. Here, we propose an indecomposable positive map for two-qutrit systems, which is shown to generate a class of…
We apply random matrix and free probability techniques to the study of linear maps of interest in quantum information theory. Random quantum channels have already been widely investigated with spectacular success. Here, we are interested in…
Physical transformations are described by linear maps that are completely positive and trace preserving (CPTP). However, maps that are positive (P) but not completely positive (CP) are instrumental to derive separability/entanglement…
Recently Paw\l{}ucki showed that compact sets that are definable in some o-minimal structure admit triangulations of class $\mathcal{C}^p$ for each integer $p\geq 1$. In this work, we make use of these new techniques of triangulation to…
In this paper we show an explicit construction of multipartite class of entangled states with the PPT (Positive Partial Transposition) property in every cut. We investigate properties of this class of states focusing on the trace distance…
We show that every entanglement with positive partial transpose may be constructed from an indecomposable positive linear map between matrix algebras.
We consider the bifurcation structure of one-parameter families of unimodal maps whose differentiability is only $C^1$. The structure of its bifurcation diagram can be a very wild one in such case. However we prove that in a certain…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…