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

Applications of multipartite entanglement and state transformations / von Martin Hebenstreit

Martin Hebenstreit

Published Jan 1, 2019• 0 citations
OpenAlex

Related papers

Multipartite entangled quantum states: Transformation, Entanglement monotones and Application

Wei Cui

•Feb 23, 2017•0 citations

Towards the operational characterization of multipartite entanglement / von Katharina Schwaiger

Katharina Schwaiger

•Jan 1, 2017•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

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

Ingemar Bengtsson, Karol Życzkowski

Cambridge University Press eBooks•Aug 14, 2017•17 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
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.
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.
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.