Related papers: Algebraic measures of entanglement
A general description of entanglement is suggested as an action realized by an arbitrary operator over given disentangled states. The related entanglement measure is defined. Because of its generality, this definition can be employed for…
There has been continued interest in seeking a theorem describing optimal low-rank approximations to tensors of order 3 or higher, that parallels the Eckart-Young theorem for matrices. In this paper, we argue that the naive approach to this…
The coefficient matrix is an efficient tool in entanglement classification under stochastic local operation and classical communication. In this work, we take all the ranks of the coefficient matrices into account in the method of…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
A recent general model of entanglement, [5], that goes much beyond the usual one based on tensor products of vector spaces is further developed here. It is shown that the usual Cartesian product can be seen as two extreme particular…
Hankel tensors are generalizations of Hankel matrices. This article studies the relations among various ranks of Hankel tensors. We give an algorithm that can compute the Vandermonde ranks and decompositions for all Hankel tensors. For a…
This paper deals with the entanglement, as quantified by the negativity, of pure quantum states chosen at random from the invariant Haar measure. We show that it is a constant (0.72037) multiple of the maximum possible entanglement. In line…
Though algebraic geometry over $\mathbb C$ is often used to describe the closure of the tensors of a given size and complex rank, this variety includes tensors of both smaller and larger rank. Here we focus on the $n\times n\times n$…
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric…
Suppose that A is a C*-algebra for which A is isomorphic to A tensor Z, where Z is the Jiang-Su algebra: a unital, simple, stably finite, separable, nuclear, infinite dimensional C*-algebra with the same Elliott invariant as the complex…
In this paper, we study typical ranks of 3-tensors and show that there are plural typical ranks for m\times n\times p tensors over R in the following cases: (1) 3\leq m\leq \rho(n) and (m-1)(n-1)+1\leq p\leq (m-1)n, where \rho\ is the…
This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic…
It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here we show that many of these separations disappear…
Octupolar order is described in two space dimensions in terms of the maxima (and conjugated minima) of the probability density associated with a third-rank, fully symmetric and traceless tensor. Such a representation is shown to be…
In a recent paper, Rungta et. al. [Phys. Rev. A, 64, 042315, 2001] introduced a measure of mixed-state entanglement called the I-concurrence for arbitrary pairs of qudits. We find an exact formula for an entanglement measure closely related…
This paper studies the issues about tensors. Three typical kinds of tensor decomposition are mentioned. Among these decompositions, the t-SVD is proposed in this decade. Different definitions of rank derive from tensor decompositions. Based…
Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…
As two of the most important entanglement measures--the entanglement of formation and the entanglement of distillation--have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems…
The problem of partitioning a large and sparse tensor is considered, where the tensor consists of a sequence of adjacency matrices. Theory is developed that is a generalization of spectral graph partitioning. A best rank-$(2,2,\lambda)$…
In the standard geometric approach, the entanglement of a pure state is $\sin^2\theta$, where $\theta$ is the angle between the entangled state and the closest separable state of products of normalised qubit states. We consider here a…