Related papers: Bounding the separable rank via polynomial optimiz…
We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1.…
We consider the Moment-SOS hierarchy in polynomial optimization. We first provide a sufficient condition to solve the truncated K-moment problem associated with a given degree-$2n$ pseudo-moment sequence $\phi$ n and a semi-algebraic set $K…
Many problems in information theory can be reduced to optimizations over matrices, where the rank of the matrices is constrained. We establish a link between rank-constrained optimization and the theory of quantum entanglement. More…
Exploiting the cone structure of the set of unnormalized mixed quantum states, we offer an approach to detect separability independently of the dimensions of the subsystems. We show that any mixed quantum state can be decomposed as…
We introduce a new family of separability criteria that are based on the existence of extensions of a bipartite quantum state $\rho$ to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all…
We prove, using a new method based on map-state duality, lower bounds on entanglement resources needed to deterministically implement a bipartite unitary using separable (SEP) operations, which include LOCC (local operations and classical…
Semidefinite programs (SDPs) are a framework for exact or approximate optimization that have widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs. These…
We study polynomial optimization problems whose objective has a composition or tensor train structure. These polynomials can be evaluated as a sequence of maps, giving rise to intermediate variables (``states'') of dimension lower than the…
We present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it…
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components. Such a problem arises in a number of…
For a quantum state represented as an $n\times n$ density matrix $\sigma \in M_n$, let ${\cal S}(\sigma)$ be the compact convex set of quantum states $\rho = (\rho_{ij}) \in M_{m\cdot n}$ with the first partial trace equal to $\sigma$,…
Moment polytopes of tensors, the study of which is deeply rooted in invariant theory, representation theory and symplectic geometry, have found relevance in numerous places, from quantum information (entanglement polytopes) and algebraic…
The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a…
We investigate questions about the cone $\mathrm{SEP}_n$ of separable bipartite states, consisting of the Hermitian matrices acting on $\mathbb{C}^n\otimes\mathbb{C}^n$ that can be written as conic combinations of rank one matrices of the…
For every $\epsilon>0$, we give an $\exp(\tilde{O}(\sqrt{n}/\epsilon^2))$-time algorithm for the $1$ vs $1-\epsilon$ \emph{Best Separable State (BSS)} problem of distinguishing, given an $n^2\times n^2$ matrix $\mathcal{M}$ corresponding to…
We characterize the boundary of the convex compact set of absolutely separable states, referred as {\bf AS}, that cannot be transformed to entangled states by global unitary operators, in $2\otimes d$ Hilbert space. However, we show that…
We consider polynomial optimization problems (POP) on a semialgebraic set contained in the nonnegative orthant (every POP on a compact set can be put in this format by a simple translation of the origin). Such a POP can be converted to an…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
This paper is being withdrawn due to an error in the proof. Hao Chen has shown the author in the two qubit case that there is an open set of three dimensional subspaces that are spanned by separable states. This means the author's proof is…
The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…