Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9908073 · Physical Review A

Exact and asymptotic measures of multipartite pure-state entanglement

Charles H. Bennett, Sandu Popescu, Daniel Rohrlich, John A. Smolin, Ashish V. Thapliyal

Published Dec 12, 2000• 432 citations
arXivHTMLPDF

Abstract

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 $n\mathrm{th}$ 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.

DOI
10.1103/physreva.63.012307

Related papers

Multipartite entanglement gambling: The power of asymptotic state transformations assisted by a sublinear amount of quantum communication

Ashish V. Thapliyal, John A. Smolin

Reversible state transformations under entanglement nonincreasing operations give rise to entanglement measures. It is well known that asymptotic local operations and classical communication (LOCC) are required to get a simple operational measure of bipartite pure state entanglement. For bipartite mixed states and multipartite pure states it is likely that a more powerful class of operations will be needed. To this end more powerful versions of state transformations (or reducibilities), namely, LOCCq (asymptotic LOCC with a sublinear amount of quantum communication) and CLOCC (asymptotic LOCC with catalysis) have been considered in the literature. In this paper we show that LOCCq state transformations are only as powerful as asymptotic LOCC state transformations for multipartite pure states. The basic tool we use is multipartite entanglement gambling: Any pure multipartite entangled state can be transformed to an Einstein-Podolsky-Rosen pair shared by some pair of parties and any irreducible m-party pure state $(m>~2)$ can be used to create any other state (pure or mixed) using LOCC. We consider applications of multipartite entanglement gambling to multipartite distillability and to characterizations of multipartite minimal entanglement generating sets. We briefly consider generalizations of this result to mixed states by defining the class of cat-distillable states, i.e., states from which cat states $(|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉)$ may be distilled.

arXiv:quant-ph/0212098•Physical Review A•Dec 31, 2003•8 citations

Reversible Combination of Inequivalent Kinds of Multipartite Entanglement

Guifré Vidal, Wolfgang Dür, J. I. Cirac

We present a family of tripartite entangled states that, in an asymptotical sense, can be reversibly converted into Einstein-Podolsky-Rosen (EPR) states, shared by parties B and C, and tripartite Greenberger-Horne-Zeilinger (GHZ) states. Thus we show that a bipartite and a genuine tripartite entanglement can be reversibly combined in a tripartite state. For such states the corresponding fractions of GHZ and EPR states represent a complete quantification of their (asymptotical) entanglement resources. More generally, we show that AB, AC, and BC EPR entanglement and GHZ entanglement can be reversibly combined in a single tripartite state. Finally, we generalize this result to any number of parties.

arXiv:quant-ph/0004009•Physical Review Letters•Jul 17, 2000•28 citations

Multicopy and stochastic transformation of multipartite pure states

Lin Chen, Masahito Hayashi

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.

arXiv:1012.3564•Physical Review A•Feb 28, 2011•36 citations

Rates of Multipartite Entanglement Transformations

Alexander Streltsov, Clément Meignant, Jens Eisert

The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: the rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a single number each, the respective entanglement entropy. In the multipartite setting, similar questions of the optimally achievable rates of transforming one pure state into another are notoriously open. This seems particularly unfortunate in the light of the revived interest in such questions due to the perspective of experimentally realizing multipartite quantum networks. In this Letter, we report substantial progress by deriving simple upper and lower bounds on the rates that can be achieved in asymptotic multipartite entanglement transformations. These bounds are based on ideas of entanglement combing and state merging. We identify cases where the bounds coincide and hence provide the exact rates. As an example, we bound rates at which resource states for the cryptographic scheme of quantum secret sharing can be distilled from arbitrary pure tripartite quantum states. This result provides further scope for quantum internet applications, supplying tools to study the implementation of multipartite protocols over quantum networks.

arXiv:1709.09693•Physical Review Letters•Aug 17, 2020•17 citations

All Entanglements in a Multipartite System

Yu Bo Shi

For a multipartite system, we sort out all possible entanglements, each of which is among a set of subsystems. Each entanglement can be measured by a generalized relative entropy of entanglement, which is conserved on average under reversible local operations and classical communication (LOCC) defined for all the parties. Then we derive a series of inequalities of different entanglements that have to be satisfied by any pure state which can be generated by reversible LOCC from the set of all GHZ-like states.

arXiv:quant-ph/0201079•Jan 18, 2002•0 citations

Multipartite pure-state entanglement and the generalized Greenberger-Horne-Zeilinger states

Shengjun Wu, Yongde Zhang

We show that not all four-party pure states are Greenberger-Horne-Zeilinger (GHZ) reducible (i.e., can be generated reversibly from a combination of two-, three-, and four-party maximally entangled states by local quantum operations and classical communication asymptotically). We also present some properties of the relative entropy of entanglement for those three-party pure states that are GHZ reducible, and then we relate these properties to the additivity of the relative entropy of entanglement.

arXiv:quant-ph/0004020•Physical Review A•Dec 12, 2000•36 citations
Hoping to simplify the classification of pure entangled states of multi (m)\ensuremath−partite(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}(m)\ensuremath−partite quantum systems, we study exactly and asymptotically (in n)n)n) reversible transformations among nthn\mathrm{th}nth tensor powers of such states (i.e., nnn copies of the state shared among the same mmm 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−partitem\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}m\ensuremath−partite pure states having an m\ensuremath−waym\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}m\ensuremath−way 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⨂m〉+∣1\ensuremath⨂m〉|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉∣0\ensuremath⨂m〉+∣1\ensuremath⨂m〉 asymptotically interconvertible to the state in question. For general m\ensuremath−partitem\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}m\ensuremath−partite 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=4m=4m=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=4m=4m=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 mmm we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all m\ensuremath−partitem\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}m\ensuremath−partite pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for m>2m>2m>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)][o(n)][o(n)] amount of quantum communication.
Reversible state transformations under entanglement nonincreasing operations give rise to entanglement measures. It is well known that asymptotic local operations and classical communication (LOCC) are required to get a simple operational measure of bipartite pure state entanglement. For bipartite mixed states and multipartite pure states it is likely that a more powerful class of operations will be needed. To this end more powerful versions of state transformations (or reducibilities), namely, LOCCq (asymptotic LOCC with a sublinear amount of quantum communication) and CLOCC (asymptotic LOCC with catalysis) have been considered in the literature. In this paper we show that LOCCq state transformations are only as powerful as asymptotic LOCC state transformations for multipartite pure states. The basic tool we use is multipartite entanglement gambling: Any pure multipartite entangled state can be transformed to an Einstein-Podolsky-Rosen pair shared by some pair of parties and any irreducible m-party pure state (m> 2)(m>~2)(m> 2) can be used to create any other state (pure or mixed) using LOCC. We consider applications of multipartite entanglement gambling to multipartite distillability and to characterizations of multipartite minimal entanglement generating sets. We briefly consider generalizations of this result to mixed states by defining the class of cat-distillable states, i.e., states from which cat states $(|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉)$ may be distilled.
We present a family of tripartite entangled states that, in an asymptotical sense, can be reversibly converted into Einstein-Podolsky-Rosen (EPR) states, shared by parties B and C, and tripartite Greenberger-Horne-Zeilinger (GHZ) states. Thus we show that a bipartite and a genuine tripartite entanglement can be reversibly combined in a tripartite state. For such states the corresponding fractions of GHZ and EPR states represent a complete quantification of their (asymptotical) entanglement resources. More generally, we show that AB, AC, and BC EPR entanglement and GHZ entanglement can be reversibly combined in a single tripartite state. Finally, we generalize this result to any number of parties.
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.
The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: the rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a single number each, the respective entanglement entropy. In the multipartite setting, similar questions of the optimally achievable rates of transforming one pure state into another are notoriously open. This seems particularly unfortunate in the light of the revived interest in such questions due to the perspective of experimentally realizing multipartite quantum networks. In this Letter, we report substantial progress by deriving simple upper and lower bounds on the rates that can be achieved in asymptotic multipartite entanglement transformations. These bounds are based on ideas of entanglement combing and state merging. We identify cases where the bounds coincide and hence provide the exact rates. As an example, we bound rates at which resource states for the cryptographic scheme of quantum secret sharing can be distilled from arbitrary pure tripartite quantum states. This result provides further scope for quantum internet applications, supplying tools to study the implementation of multipartite protocols over quantum networks.
For a multipartite system, we sort out all possible entanglements, each of which is among a set of subsystems. Each entanglement can be measured by a generalized relative entropy of entanglement, which is conserved on average under reversible local operations and classical communication (LOCC) defined for all the parties. Then we derive a series of inequalities of different entanglements that have to be satisfied by any pure state which can be generated by reversible LOCC from the set of all GHZ-like states.
We show that not all four-party pure states are Greenberger-Horne-Zeilinger (GHZ) reducible (i.e., can be generated reversibly from a combination of two-, three-, and four-party maximally entangled states by local quantum operations and classical communication asymptotically). We also present some properties of the relative entropy of entanglement for those three-party pure states that are GHZ reducible, and then we relate these properties to the additivity of the relative entropy of entanglement.