Abstract Multipartite entanglement has a much more complex structure than bipartite entanglement. A state that lacks generic multipartite entanglement is 2-producible, i.e. it can be written as a tensor product of at most 2-partite entangled states. Recently, it has been proved that a tripartite pure state is 2-producible if and only if the gap between the entanglement of purification and its lower bound vanishes. Here, we show that the entanglement of purification gap is insufficient to detect more than tripartite entanglement in 4-partite stabilizer states. We then generalize entanglement of purification to the multipartite cases, and demonstrate that a multipartite pure state is 2-producible if and only if all the generalized entanglement of purification gaps vanish. The generalized entanglement of purification gap quantifies the quantum communication cost for redistributing one part of the system to the others, and also relates to the local recoverability of a multipartite state and the relative entropy between that state and 2-producible states. Moreover, we calculate the generalized entanglement of purification for states satisfying the general Schmidt decomposition, which implies that 4-partite stabilizer states do not necessarily have a general Schmidt decomposition. Our results provide a quantitative characterization of multipartite entanglement in multipartite system, which will promote further investigations and understanding of multipartite entanglement.
Entanglement between three or more parties exhibits a realm of properties unknown to two-party states. Bipartite states are easily classified using the Schmidt decomposition. The Schmidt coefficients of a bipartite pure state encompass all the nonlocal properties of the state and can be ``seen'' by looking at one party's density matrix only. Pure states of three and more parties, however, lack such a simple form. They have more invariants under local unitary transformations than any one party can ``see'' on their subsystem. These ``hidden nonlocalities'' will allow us to exhibit a class of multipartite states that cannot be distinguished from each other by any party. Generalizing a result of Bennett, Popescu, Rohrlich, Smolin, and Thapliyal, and using a recent result by Nielsen, we will show that these states cannot be transformed into each other by local actions and classical communication. Furthermore, we will use an orthogonal subset of such states to hint at applications to cryptography and illustrate an extension to quantum secret sharing [using recently suggested
((n,k))-threshold schemes].
Abstract The relation between the distillability of entanglement of three bipartite reduced density matrices from a tripartite pure state has been studied in Hayashi and Chen [2011 Phys. Rev. A 84 012325]. We extend this result to the tripartite mixed state of rank at most three. In particular we show that if the state has two bipartite reduced density operators with rank two, then the third bipartite reduced density operator additionally having non positive partial transpose (non-PPT) is distillable. In contrast, we show that the tripartite PPT state with two reduced density operators of rank two is a three-qubit fully separable state. We obtain these facts by proving a conjectured matrix inequality for the bipartite matrix M with Schmidt rank at most three. This is one of the main results of this paper. We also prove it for some M with arbitrary Schmidt rank.
The entanglement in a pure state of N qudits (d-dimensional distinguishable quantum particles) can be characterized by specifying how entangled its subsystems are. A generally mixed subsystem of m qudits is obtained by tracing over the other $N\ensuremath{-}m$ qudits. We examine the entanglement in the space of mixed states of m qudits. We show that for a typical pure state of N qudits, its subsystems smaller than
N/3 qudits will have a positive partial transpose and hence are separable or bound entangled. Additionally, our numerical results show that the probability of finding entangled subsystems smaller than
N/3 falls exponentially in the dimension of the Hilbert space. The bulk of pure state Hilbert space thus consists of highly entangled states with multipartite entanglement encompassing at least a third of the qudits in the pure state.
Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in
n) reversible transformations among
nth tensor powers of such states (i.e.,
n copies of the state shared among the same
m parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the
m=4 cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the
m=4 cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties
m we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for
m>2 we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible
[o(n)] amount of quantum communication.