Related papers: Composition of PPT Maps
For two-parameter families of dissipative twist maps, we investigate the dynamics of invariant graphs as well as the thresholds for their existence and breakdown. Our main results are as follows: (1) For arbitrarily small $C^r$…
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…
A circle packing is a collection of disks with disjoint interiors in the plane. It naturally defines a graph by tangency. It is shown that there exists $p>0$ such that the following holds for every circle packing: If each disk is retained…
In a recent paper, Hirche and Leditzky introduced the notion of bi-PPT channels which are quantum channels that stay completely positive under composition with a transposition and such that the same property holds for one of their…
A necessary and sufficient condition for 1-distillability is formulated in terms of decomposable positive maps. As an application we provide insight into why all states violating the reduction criterion map are distillable and demonstrate…
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…
Positive maps are useful for detecting entanglement in quantum information theory. Any entangled state can be detected by some positive map. In this paper, the relation between positive block matrices and completely positive…
We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon…
Positive definite (p.d.) matrices arise naturally in many areas within mathematics and also feature extensively in scientific applications. In modern high-dimensional applications, a common approach to finding sparse positive definite…
In order to construct a measure of entanglement on the basis of a ``distance'' between two states, it is one of desirable properties that the ``distance'' is nonincreasing under every completely positive trace preserving map. Contrary to a…
Let $\mathcal{P}_G$ be the family of all topologically mixing, but not exact self-maps of a topological graph $G$. It is proved that the infimum of topological entropies of maps from $\mathcal{P}_G$ is bounded from below by $(\log 3/…
We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N >= 4. It is shown that Phi detects many entangled states…
A new family of positive, trace-preserving maps is introduced. It is defined using the mutually unbiased measurements, which generalize the notion of mutual unbiasedness of orthonormal bases. This family allows one to define entanglement…
We provide a generalization of the reduction and Robertson positive maps in matrix algebras. They give rise to a new class of optimal entanglement witnesses. Their structural physical approximation is analyzed. As a byproduct we provide a…
We study families of positive and completely positive maps acting on a bipartite system $\mathbb{C}^M\otimes \mathbb{C}^N$ (with $M\leq N$). The maps have a property that when applied to any state (of a given entanglement class) they result…
Let M and N be full matrix algebras. A unital completely positive (UCP) map \phi:M\to N is said to preserve entanglement if its inflation \phi\otimes \id_N : M\otimes N\to N\otimes N has the following property: for every maximally entangled…
We define an entanglement witness in a composite quantum system as an observable having nonnegative expectation value in every separable state. Then a state is entangled if and only if it has a negative expectation value of some…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the…