Related papers: Bounding the separable rank via polynomial optimiz…
Detection of entanglement through partial knowledge of the quantum state is a challenge to implement efficiently. Here we propose a separability criterion for detecting bipartite entanglement in arbitrary dimensional quantum states using…
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…
It is known that he bipartite quantum states, with rank strictly smaller than the maximum of the ranks of its two reduced states, are distillable by local operations and classical communication. Our first main result is that this is also…
We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…
We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal…
Generalizing the well-known spin-squeezing inequalities, we study the relation between squeezing of collective $N$-particle $su(d)$ operators and many-body entanglement geometry in multi-particle systems. For that aim, we define the set of…
We use the geometry of the moment map to investigate properties of pure entangled states of composite quantum systems. The orbits of equally entangled states are mapped by the moment map on coadjoint orbits of local transformations (unitary…
Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural…
Given a known matrix that is the sum of a low rank matrix and a masked sparse matrix, we wish to recover both the low rank component and the sparse component. The sparse matrix is masked in the sense that a linear transformation has been…
The reduction criterion is a well known necessary condition for separable states, and states violating this condition are entangled and also 1-distillable. In this paper we introduce a new set of necessary conditions for separability of…
We introduce a new method to reconstruct the density matrix $\rho$ of a system of $n$-qubits and estimate its rank $d$ from data obtained by quantum state tomography measurements repeated $m$ times. The procedure consists in minimizing the…
We explore the relation between the rank of a bipartite density matrix and the existence of bound entanglement. We show a relation between the rank, marginal ranks, and distillability of a mixed state and use this to prove that any rank n…
A tensor is a multi-way array that can represent, in addition to a data set, the expression of a joint law or a multivariate function. As such it contains the description of the interactions between the variables corresponding to each of…
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and…
In this paper, we propose a general framework for tensor singular value decomposition (tensor SVD), which focuses on the methodology and theory for extracting the hidden low-rank structure from high-dimensional tensor data. Comprehensive…
Recent efforts have focused on characterizing the set of separable states that cannot be made entangled by any global unitary transformation. Here we characterize the set of states whose entanglement content cannot be increased under any…
We study partial coherence and its connections with entanglement. First, we provide a sufficient and necessary condition for bipartite pure state transformation under partial incoherent operations: A bipartite pure state can be transformed…
This work focuses on non-adaptive combinatorial group testing, with a primary goal of efficiently identifying a set of at most $d$ defective elements among a given set of $n$ elements using the fewest possible tests. Non-adaptive…
We consider the relation between three different approaches to defining quantum states across several times and locations: the pseudo-density matrix (PDM), the process matrix, and the multiple-time state approaches. Previous studies have…