Related papers: Sinkhorn-Knopp Theorem for PPT states
Quantum entanglement is an important phenomenon in quantum information theory. To detect entanglement theoretically, positive but not completely positive maps are used. The Kadison-Schwarz (KS) inequality interpolates between positivity and…
We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive integer k, under the restrictions that all inputs are column…
For a given nonnegative matrix $A=(A_{ij})$, the matrix scaling problem asks whether $A$ can be scaled to a doubly stochastic matrix $D_1AD_2$ for some positive diagonal matrices $D_1,D_2$.The Sinkhorn algorithm is a simple iterative…
Stochastic and bistochastic matrices providing positive maps for spin states (for qudits) are shown to form semigroups with dense intersection with the Lie groups $IGL(n, \mathbb{R})$ and $GL(n, \mathbb{R})$ respectively. The density matrix…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…
Quantum measurements can be interpreted as a generalisation of probability vectors, in which non-negative real numbers are replaced by positive semi-definite operators. We extrapolate this analogy to define a generalisation of doubly…
Equivalence between Positive Partial Transpose (PPT) entanglement and bound entanglement is a long-standing open problem in quantum information theory. So far limited progress has been made, even on the seemingly simple case of Werner…
In this paper, we study pure state entanglement in systems of dimension $2\otimes m\otimes n$. Two states are considered equivalent if they can be reversibly converted from one to the other with a nonzero probability using only local…
This paper addresses the problem of checking invariant properties for a large class of symbolic transition systems, defined by a combination of SMT theories and quantifiers. State variables can be functions from an uninterpreted sort…
We classify the completely-positive maps acting on two $d$-dimensional systems which commute with all $U\otimes U$ unitaries, where $U\in SU(d)$. This set of operations map Werner states to Werner states. We find a simple condition for a…
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…
This article introduces PnCP, a MATLAB toolbox for constructing positive maps which are not completely positive. We survey optimization and sum of squares relaxation techniques to find the most numerically efficient methods for this…
Entanglement of any pure state of an N times N bi-partite quantum system may be characterized by the vector of coefficients arising by its Schmidt decomposition. We analyze various measures of entanglement derived from the generalized…
Multiqubit positive-partial-transpose (PPT) entangled states play an important role in quantum information theory. We characterize such states of minimum rank in three-qubit system, namely rank four. Depending on whether the Lorentz…
We report here on the results of numerical searches for PPT states with specified ranks for density matrices and their partial transpose. The study includes several bipartite quantum systems of low dimensions. For a series of ranks extremal…
The convex set of quantum states of a composite $K \times K$ system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an…
We consider time-dependent dynamical systems arising as sequential compositions of self-maps of a probability space. We establish conditions under which the Birkhoff sums for multivariate observations, given a centering and a general…
The positive and not completely positive maps of density matrices, which are contractive maps, are discussed as elements of a semigroup. A new kind of positive map (the purification map), which is nonlinear map, is introduced. The density…
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…
We express the positive partial transpose (PPT) separability criterion for symmetric states of multi-qubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix…