Related papers: Algebraic measures of entanglement
We provide a novel analysis of low-rank tensor completion based on hypergraph expanders. As a proxy for rank, we minimize the max-quasinorm of the tensor, which generalizes the max-norm for matrices. Our analysis is deterministic and shows…
The geometric measure of entanglement, which expresses the minimum distance to product states, has been generalized to distances to sets that remain invariant under the stochastic reducibility relation. For each such set, an associated…
We study the optimal transport problem for $d>2$ discrete measures. This is a linear programming problem on $d$-tensors. It gives a way to compute a "distance" between two sets of discrete measures. We introduce an entropic regularization…
We study the rank one completion problem for tensors of arbitrary orders. The notion of rank one determinable tensors is introduced. We explore its properties and propose a recursive algorithm for computing rank one tensor completion. This…
We construct a family of additive entanglement measures for pure multipartite states. The family is parametrised by a simplex and interpolates between the R\'enyi entropies of the one-particle reduced states and the recently-found universal…
We present a multipartite entanglement measure for $N$-qubit pure states, using the norm of the correlation tensor which occurs in the Bloch representation of the state. We compute this measure for several important classes of $N$-qubit…
In this paper, we show that the low rank matrix completion problem can be reduced to the problem of finding the rank of a certain tensor.
We consider the mixed three-qubit bound entangled state defined as the normalized projector on the subspace that is complementary to an Unextendible Product Basis [C. H. Bennett et. al., Phys. Rev. Lett. 82, 5385 (1999)]. Using the fact…
The injective norm is a natural generalization to tensors of the operator norm of a matrix. In quantum information, the injective norm is one important measure of genuine multipartite entanglement of quantum states, where it is known as the…
Entanglement is a cornerstone in quantum information science, yet detecting it efficiently remains a challenging task. Focusing on non-positive partially transposed (NPT) states, we establish a hierarchy among entropy-based, majorization,…
We construct an entanglement measure that coincides with the generalized concurrence for a general pure bipartite state based on wedge product. Moreover, we construct an entanglement measure for pure multi-qubit states, which are…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings [A. Shimony, Ann. NY.…
In the problem of entanglement there exist two different notions. One is the entanglement of a quantum state, characterizing the state structure. The other is entanglement production by quantum operators, describing the action of operators…
In quantum information theory, the Schmidt rank is a fundamental measure for the entanglement dimension of a pure bipartite state. Its natural definition uses the Schmidt decomposition of vectors on bipartite Hilbert spaces, which does not…
We introduce a protocol to classify three-qubit pure states into different entanglement classes and implement it on an NMR quantum processor. The protocol is designed in such a way that the experiments performed to classify the states can…
The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…
We derive explicit bounds for the average entropy characterizing measurements of a pure quantum state of size $N$ in $L$ orthogonal bases. Lower bounds lead to novel entropic uncertainty relations, while upper bounds allow us to formulate…
We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time…
In this paper we study typical ranks of real $m\times n \times \ell$ tensors. In the case $ (m-1)(n-1)+1 \leq \ell \leq mn$ the typical ranks are contained in $\{\ell, \ell +1\}$, and $\ell$ is always a typical rank. We provide a geometric…
In this article the notion of the nondecreasing (ND) rank of a matrix or tensor is introduced. A tensor has an ND rank of r if it can be represented as a sum of r outer products of vectors, with each vector satisfying a monotonicity…