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:2305.18999 · IEEE Transactions on Information Theory

Multipartite Entanglement Theory With Entanglement-Nonincreasing Operations

Alexander Streltsov

Published Jan 9, 2025• 2 citations
arXivHTMLPDF

Abstract

A key problem in quantum information science is to determine optimal protocols for the interconversion of entangled states shared between remote parties. While for two parties a large number of results in this direction is available, the multipartite setting still remains a major challenge. In this article, this problem is addressed by extending the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. Specifically, we consider transformations capable of introducing a small, controllable increase of entanglement of a state, with the requirement that the increase can be made arbitrarily small. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states. Remarkably, this approach allows the reduction of tripartite entanglement to its bipartite analog, indicating that every pure tripartite state can be reversibly synthesized from a suitable number of singlets distributed between pairs of parties.

DOI
10.1109/tit.2025.3526419

Related papers

Application and Manipulation of Bipartite and Multipartite Entangled States

Ben Fortescue

The phenomenon of quantum entanglement is a fundamental feature of quantum mechanics which, as a counterintuitive and inherently ”quantum” phenomenon (with no classical analogue) has been the subject of much study, especially in quantum information theory. One fruitful approach to the description of entanglement has been in its operational description - that is, in the consideration of what can be achieved using entangled states under certain restrictions, typically the regime of local operations and classical communications.\n\nWe present results here related to the operational characterisation of entanglement in the resource model, in both bipartite and multipartite cases. First, we consider the conversion between pure bipartite entangled states in terms of an often-ignored resource - the classical communication cost. Using prior results for more specific conversions, we derive lower bounds on this cost (and the related quantity of the conversion inefficiency) for general bipartite pure states.\n\nWe also consider pure-state conversions of multipartite entanglement, in particular the class of protocols in which multipartite states are converted to states shared between fewer parties. We have found a previously-unconsidered variety of such conversions, in which the target state of the conversion is a state shared between a random subset of the parties. We find that when such post-selection of parties in the protocol is permitted allows for a wider variety of achievable target states; certain states which can not be reliably obtained between predetermined parties (even some where the probability of doing so is arbitrarily small) can be obtained between random parties. We consider a variety of states in which this phenomenon occurs, as well as bounds on such protocols can achieve.\n\nFinally we consider a practical use of entanglement as a resource, in an experimental implementation of a multipartite QKD protocol. This is based on the tripartite GHZ entangled state, but can be implemented using only bipartite entanglement. We adapt existing QKD results for both the bipartite and multipartite case to derive a secure key rate for this implementation, taking into account the ways in which it differs from the idealised theoretical case.

•Sep 24, 2009•0 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•26 citations

Multipartite Entangled States: Transformations, Entanglement Monotones, and Applications

Wei Cui

Entanglement is one of the fundamental features of quantum information science.\nThough bipartite entanglement has been analyzed thoroughly in theory and shown to\nbe an important resource in quantum computation and communication protocols, the\ntheory of entanglement shared between more than two parties, which is called multipartite\nentanglement, is still not complete. Specifically, the classification of multipartite\nentanglement and the transformation property between different multipartite states by\nlocal operators and classical communications (LOCC) are two fundamental questions in\nthe theory of multipartite entanglement.\nIn this thesis, we present results related to the LOCC transformation between multipartite\nentangled states. Firstly, we investigate the bounds on the LOCC transformation\nprobability between multipartite states, especially the GHZ class states. By analyzing\nthe involvement of 3-tangle and other entanglement measures under weak two-outcome\nmeasurement, we derive explicit upper and lower bound on the transformation probability\nbetween GHZ class states. After that, we also analyze the transformation between\nN-party W type states, which is a special class of multipartite entangled states that\nhas an explicit unique expression and a set of analytical entanglement monotones. We\npresent a necessary and sufficient condition for a known upper bound of transformation\nprobability between two N-party W type states to be achieved.\nWe also further investigate a novel entanglement transformation protocol, the random\ndistillation, which transforms multipartite entanglement into bipartite entanglement\nii\nshared by a non-deterministic pair of parties. We find upper bounds for the random distillation\nprotocol for general N-party W type states and find the condition for the upper\nbounds to be achieved. What is surprising is that the upper bounds correspond to entanglement\nmonotones that can be increased by Separable Operators (SEP), which gives\nthe first set of analytical entanglement monotones that can be increased by SEP.\nFinally, we investigate the idea of a new class of multipartite entangled states, the\nAbsolutely Maximal Entangled (AME) states, which is characterized by the fact that\nany bipartition of the states would give a maximal entangled state between the two sets.\nThe relationship between AME states and Quantum secret sharing (QSS) protocols is\nexhibited and the application of AME states in novel quantum communication protocols\nis also explored.

•Jan 7, 2014•0 citations

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•10 citations

Interconversion of pure Gaussian states requiring non-Gaussian operations

Michael G. Jabbour, Raúl García−Patrón, Nicolas J. Cerf

We analyze the conditions under which local operations and classical communication enable entanglement transformations within the set of bipartite pure Gaussian states. A set of necessary and sufficient conditions had been found in [Quant. Inf. Comp. 3, 211 (2003)] for the interconversion between such states that is restricted to Gaussian local operations and classical communication. Here, we exploit majorization theory in order to derive more general (sufficient) conditions for the interconversion between bipartite pure Gaussian states that goes beyond Gaussian local operations. While our technique is applicable to an arbitrary number of modes for each party, it allows us to exhibit surprisingly simple examples of 2 x 2 Gaussian states that necessarily require non-Gaussian local operations to be transformed into each other.

arXiv:1409.8217•Physical Review A•Jan 12, 2015•9 citations

Transformations of symmetric multipartite Gaussian states by Gaussian local operations and classical communication

Ondřej Černotík, Jaromír Fiurášek

Multipartite quantum correlations, in spite of years of intensive research, still leave many questions unanswered. While bipartite entanglement is relatively well understood for Gaussian states, the complexity of mere qualitative characterization grows rapidly with increasing number of parties. Here, we present two schemes for transformations of multipartite permutation invariant Gaussian states by Gaussian local operations and classical communication. To this end, we use a scheme for possible experimental realization, making use of the fact that in this picture the whole $N$-partite state can be described by specifying the states of two separable modes. Numerically, we study entanglement transformations of tripartite states. Finally, we look at the effect our protocols have on fidelity of assisted quantum teleportation and find that, while adding correlated noise does not affect the fidelity at all, there is strong evidence that partial nondemolition measurement leads to a drop in teleportation fidelity.

arXiv:1403.0737•Physical Review A•Apr 29, 2014•3 citations
A key problem in quantum information science is to determine optimal protocols for the interconversion of entangled states shared between remote parties. While for two parties a large number of results in this direction is available, the multipartite setting still remains a major challenge. In this article, this problem is addressed by extending the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. Specifically, we consider transformations capable of introducing a small, controllable increase of entanglement of a state, with the requirement that the increase can be made arbitrarily small. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states. Remarkably, this approach allows the reduction of tripartite entanglement to its bipartite analog, indicating that every pure tripartite state can be reversibly synthesized from a suitable number of singlets distributed between pairs of parties.
The phenomenon of quantum entanglement is a fundamental feature of quantum mechanics which, as a counterintuitive and inherently ”quantum” phenomenon (with no classical analogue) has been the subject of much study, especially in quantum information theory. One fruitful approach to the description of entanglement has been in its operational description - that is, in the consideration of what can be achieved using entangled states under certain restrictions, typically the regime of local operations and classical communications.\n\nWe present results here related to the operational characterisation of entanglement in the resource model, in both bipartite and multipartite cases. First, we consider the conversion between pure bipartite entangled states in terms of an often-ignored resource - the classical communication cost. Using prior results for more specific conversions, we derive lower bounds on this cost (and the related quantity of the conversion inefficiency) for general bipartite pure states.\n\nWe also consider pure-state conversions of multipartite entanglement, in particular the class of protocols in which multipartite states are converted to states shared between fewer parties. We have found a previously-unconsidered variety of such conversions, in which the target state of the conversion is a state shared between a random subset of the parties. We find that when such post-selection of parties in the protocol is permitted allows for a wider variety of achievable target states; certain states which can not be reliably obtained between predetermined parties (even some where the probability of doing so is arbitrarily small) can be obtained between random parties. We consider a variety of states in which this phenomenon occurs, as well as bounds on such protocols can achieve.\n\nFinally we consider a practical use of entanglement as a resource, in an experimental implementation of a multipartite QKD protocol. This is based on the tripartite GHZ entangled state, but can be implemented using only bipartite entanglement. We adapt existing QKD results for both the bipartite and multipartite case to derive a secure key rate for this implementation, taking into account the ways in which it differs from the idealised theoretical case.
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.
Entanglement is one of the fundamental features of quantum information science.\nThough bipartite entanglement has been analyzed thoroughly in theory and shown to\nbe an important resource in quantum computation and communication protocols, the\ntheory of entanglement shared between more than two parties, which is called multipartite\nentanglement, is still not complete. Specifically, the classification of multipartite\nentanglement and the transformation property between different multipartite states by\nlocal operators and classical communications (LOCC) are two fundamental questions in\nthe theory of multipartite entanglement.\nIn this thesis, we present results related to the LOCC transformation between multipartite\nentangled states. Firstly, we investigate the bounds on the LOCC transformation\nprobability between multipartite states, especially the GHZ class states. By analyzing\nthe involvement of 3-tangle and other entanglement measures under weak two-outcome\nmeasurement, we derive explicit upper and lower bound on the transformation probability\nbetween GHZ class states. After that, we also analyze the transformation between\nN-party W type states, which is a special class of multipartite entangled states that\nhas an explicit unique expression and a set of analytical entanglement monotones. We\npresent a necessary and sufficient condition for a known upper bound of transformation\nprobability between two N-party W type states to be achieved.\nWe also further investigate a novel entanglement transformation protocol, the random\ndistillation, which transforms multipartite entanglement into bipartite entanglement\nii\nshared by a non-deterministic pair of parties. We find upper bounds for the random distillation\nprotocol for general N-party W type states and find the condition for the upper\nbounds to be achieved. What is surprising is that the upper bounds correspond to entanglement\nmonotones that can be increased by Separable Operators (SEP), which gives\nthe first set of analytical entanglement monotones that can be increased by SEP.\nFinally, we investigate the idea of a new class of multipartite entangled states, the\nAbsolutely Maximal Entangled (AME) states, which is characterized by the fact that\nany bipartition of the states would give a maximal entangled state between the two sets.\nThe relationship between AME states and Quantum secret sharing (QSS) protocols is\nexhibited and the application of AME states in novel quantum communication protocols\nis also explored.
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 analyze the conditions under which local operations and classical communication enable entanglement transformations within the set of bipartite pure Gaussian states. A set of necessary and sufficient conditions had been found in [Quant. Inf. Comp. 3, 211 (2003)] for the interconversion between such states that is restricted to Gaussian local operations and classical communication. Here, we exploit majorization theory in order to derive more general (sufficient) conditions for the interconversion between bipartite pure Gaussian states that goes beyond Gaussian local operations. While our technique is applicable to an arbitrary number of modes for each party, it allows us to exhibit surprisingly simple examples of 2 x 2 Gaussian states that necessarily require non-Gaussian local operations to be transformed into each other.
Multipartite quantum correlations, in spite of years of intensive research, still leave many questions unanswered. While bipartite entanglement is relatively well understood for Gaussian states, the complexity of mere qualitative characterization grows rapidly with increasing number of parties. Here, we present two schemes for transformations of multipartite permutation invariant Gaussian states by Gaussian local operations and classical communication. To this end, we use a scheme for possible experimental realization, making use of the fact that in this picture the whole NNN-partite state can be described by specifying the states of two separable modes. Numerically, we study entanglement transformations of tripartite states. Finally, we look at the effect our protocols have on fidelity of assisted quantum teleportation and find that, while adding correlated noise does not affect the fidelity at all, there is strong evidence that partial nondemolition measurement leads to a drop in teleportation fidelity.