We construct a lower bound of the tensor rank for a new class of tensors, which we call persistent tensors . We present three specific families of persistent tensors, of which the lower bound is tight. We show that there is a chain of degenerations between these three families of minimal-rank persistent tensors that can be used to study the entanglement transformation between them. In addition, we show that these three families of persistent tensors are indeed different generalizations of multiqubit W states within multiqudit systems and are geometrically in the orbit closure of multiqudit GHZ states. Consequently, we show that one can obtain every one of the generalizations of W state from a multiqudit GHZ state via asymptotic Stochastic Local Operations and Classical Communication (SLOCC) with rate one. Finally, we extend the obtained lower bound of the tensor rank to direct sums with persistent summands and to even more general combinations of tensors, which we call block pyramidal tensors . As a result, we show that the tensor rank is multiplicative under the Kronecker and tensor products of minimal-rank persistent tensors with the GHZ tensor.
Quantum Entanglement is one of the key manifestations of quantum mechanics that separate the quantum realm from the classical one. Characterization of entanglement as a physical resource for quantum technology became of uppermost importance. While the entanglement of bipartite systems is already well understood, the ultimate goal to cope with the properties of entanglement of multipartite systems is still far from being realized. This paper covers characterization of multipartite entanglement using algebraic-geometric tools. First, we establish an algorithm to classify multipartite entanglement by [Formula: see text]-secant varieties of the Segre variety and [Formula: see text]-multilinear ranks that are invariant under Stochastic Local Operations with Classical Communication (SLOCC). We present a fine-structure classification of multiqubit and tripartite entanglement based on this algorithm. Another fundamental problem in quantum information theory is entanglement transformation that is quite challenging regarding to multipartite systems. It is captivating that the proposed entanglement classification by algebraic geometry can be considered as a reference to study SLOCC and asymptotic SLOCC interconversions among different resources based on tensor rank and border rank, respectively. In this regard, we also introduce a new class of tensors that we call persistent tensors and construct a lower bound for their tensor rank. We further cover SLOCC convertibility of multipartite systems considering several families of persistent tensors.
Characterizing the transformation and classification of multipartite entangled states is a basic problem in quantum information. We study the problem under the two most common environments, local operations and classical communications (LOCC), stochastic LOCC and two more general environments, multicopy LOCC (MCLOCC), and multicopy SLOCC (MCSLOCC). We show that two transformable multipartite states under LOCC or SLOCC are also transformable under MCLOCC and MCSLOCC. What is more, these two environments are equivalent in the sense that two transformable states under MCLOCC are also transformable under MCSLOCC, and vice versa. Based on these environments we classify the multipartite pure states into a few inequivalent sets and orbits, between which we build the partial order to decide their transformation. In particular, we investigate the structure of SLOCC-equivalent states in terms of tensor rank, which is known as the generalized Schmidt rank. Given the tensor rank, we show that Greenberger-Horne-Zeilinger states can be used to generate all states with a smaller or equivalent tensor rank under SLOCC, and all reduced separable states with a cardinality smaller than or equivalent to the tensor rank under LOCC. Using these concepts, we extended the concept of the ``maximally entangled state'' in the multipartite system.
A basic question regarding quantum entangled states is whether one can be probabilistically converted to another through local operations and classical communication exclusively. While the answer for bipartite systems is known, we show that for tripartite systems, this question encodes some of the most challenging open problems in mathematics and computer science. In particular, we show that there is no easy general criterion to determine the feasibility, and in fact, the problem is NP hard. In addition, we find obtaining the most efficient algorithm for matrix multiplication to be precisely equivalent to determining the maximum rate to convert the Greenberger-Horne-Zeilinger state to a triangular distribution of three EPR states. Our results are based on connections between multipartite entanglement and tensor rank (also called Schmidt rank), a key concept in algebraic complexity theory.
We study the rank of a general tensor
u in a tensor product $H_1\ot...\ot H_k$. The rank of
u is the minimal number
p of pure states
v1,...,vp such that
u is a linear combination of the
vj's. This rank is an algebraic measure of the degree of entanglement of
u. Motivated by quantum computation, we completely describe the rank of an arbitrary tensor in $(\C^2)^{\ot 3}$ and give normal forms for tensor states up to local unitary transformations. We also obtain partial results for $(\C^2)^{\ot 4}$; in particular, we show that the maximal rank of a tensor in $(\C^2)^{\ot 4}$ is equal to 4.
The entanglement structure of a bipartite pure state is characterized by its entanglement spectrum, or equivalently, by the family of Rényi-
k entanglement entropies with integer
k. Taking the difference of two such entropies defines a quantity known as an entanglement spread, that is monotonous under local operations, and that vanishes if and only if the entanglement spectrum of the state is flat. We introduce a multipartite generalization of this notion which, for a fixed number
D≥3 of parties, results in a collection of maps indexed by pairs of
D-edge-colored graphs (obeying some condition). Each member of this collection takes the form of a difference of two multipartite Rényi entanglement entropies, each associated to a local unitary polynomial invariant (known in this context as a trace-invariant), and is shown to be monotonous under local operations. We then argue that a previously introduced family of so-called hypergraph-tensor (HT) states can be understood as a multipartite counterpart to the family of flat bipartite states. Indeed, we first prove that, when
D=3, a tripartite pure state is HT if and only if it minimizes a particular (infinite) family of entanglement spreads. Second, we embed the set of HT states into the much larger family of spectral hypergraph-tensor (SHT) states, defined by a new Ansatz we introduce. We then prove that HT states can be uniquely characterized as the minimizers of some fixed entanglement spread among SHT states, for arbitrary
D≥3. We also investigate SHT states in their own right: in particular, we characterize their orbits under local unitary transformations. Finally, along the way, the asymptotic large-
N expectation values of a number of entanglement spreads are computed in the Haar-random state of local dimension
N.
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 invariant is zero, we classify such states into two types. The PPT entangled states constructed by unextendible product bases (UPB) have nonzero invariants, which belong to type I. We provide a method to effectively determine whether a state can be constructed from UPB. For states with zero invariant, which belong to type II, we provide an explicit expression up to equivalence of stochastic local operations and classical communications (SLOCC). It turns out that we can represent them with only one complex parameter. We further study SLOCC-equivalence relation within the expression. We also investigate the Lorentz invariants of multiqubit states with rank less than three and analyze their range.