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:1403.0737 · Physical Review A

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

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

Published Apr 29, 2014• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.89.042331

Related papers

Local transformations of multiple multipartite states

Antoine Neven, David Gunn, Martin Hebenstreit +1 more

Understanding multipartite entanglement is vital, as it underpins a wide range of phenomena across physics. The study of transformations of states via Local Operations assisted by Classical Communication (LOCC) allows one to quantitatively analyse entanglement, as it induces a partial order in the Hilbert space. However, it has been shown that, for systems with fixed local dimensions, this order is generically trivial, which prevents relating multipartite states to each other with respect to any entanglement measure. In order to obtain a non-trivial partial ordering, we study a physically motivated extension of LOCC: multi-state LOCC. Here, one considers simultaneous LOCC transformations acting on a finite number of entangled pure states. We study both multipartite and bipartite multi-state transformations. In the multipartite case, we demonstrate that one can change the stochastic LOCC (SLOCC) class of the individual initial states by only applying Local Unitaries (LUs). We show that, by transferring entanglement from one state to the other, one can perform state conversions not possible in the single copy case; provide examples of multipartite entanglement catalysis; and demonstrate improved probabilistic protocols. In the bipartite case, we identify numerous non-trivial LU transformations and show that the source entanglement is not additive. These results demonstrate that multi-state LOCC has a much richer landscape than single-state LOCC.

arXiv:2007.06256•SciPost Physics•Aug 30, 2021•9 citations

Multipartite Entanglement Theory With Entanglement-Nonincreasing Operations

Alexander Streltsov

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.

arXiv:2305.18999•IEEE Transactions on Information Theory•Jan 9, 2025•2 citations

Robust Gaussian teleportation with attenuation and nonunity gain

A. J. de Faria

The average fidelity of the teleportation of coherent states is calculated for general Gaussian bipartite systems shared by the partners of the protocol, Alice and Bob. It is considered that the shared Gaussian bipartite modes suffer independent attenuations before the processing of Alice and Bob. In addition, the classical communication between the partners can be controlled by a gain not necessarily unitary. Comparing with the classical fidelity threshold of measure-and-prepare methods, we establish several genuinely quantum teleportation conditions which depend on the gain and the local attenuations. If the gain can be tuned to maximize the bipartite state set capable of performing genuinely quantum teleportation, then a condition for teleportation robust against local attenuations is found. This condition is demonstrated to be essentially equivalent to the condition of robust Gaussian bipartite entanglement, obtained in previous articles, showing that the robustness against attenuations is an entanglement property relevant for characterization and application of bipartite systems. For the derivation of the robust teleportation conditions, the Gaussian operations onto the bipartite system are thoroughly studied, so that the transformations that maintain the fidelity invariant are found. Some scenarios for different Gaussian bipartite states are presented and discussed.

arXiv:1609.05972•Physical Review A•Dec 21, 2016•3 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

State transformations within entanglement classes containing permutation-symmetric states

Martin Hebenstreit, Cornelia Spee, Nicky Kai Hong Li +2 more

The study of state transformations under local operations and classical communication (LOCC) plays a crucial role in entanglement theory. While this has been long ago characterized for pure bipartite states, the situation is drastically different for systems of more parties: generic pure qudit states cannot be obtained from nor transformed to any state (i.e., they are isolated), which contains a different amount of entanglement. We consider here the question of LOCC convertibility for permutation-symmetric pure states of an arbitrary number of parties and local dimension, a class of clear interest both for physical and mathematical reasons and for which the aforementioned result does not apply given that it is a zero-measure subset in the state space. While it turns out that generic $n$-qubit symmetric states are also isolated, we consider particular families for which we can determine to be, on the contrary, endowed with a rich local stabilizer, a necessary requirement for LOCC convertibility to be possible. This allows us to identify classes in which LOCC transformations among permutation-symmetric states are possible. Notwithstanding, we provide several results that indicate severe obstructions to LOCC convertibility in general even within these highly symmetrical classes. In the course of the study of LOCC transformations, we also characterize the local symmetries of symmetric states.

arXiv:2107.13949•Physical Review A•Mar 31, 2022•10 citations

Entanglement manipulation of multipartite pure states with finite rounds of classical communication

Julio I. de Vicente, Cornelia Spee, David Sauerwein +1 more

We studied pure state transformations using local operations assisted by finitely many rounds of classical communication (${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$) [C. Spee, J. I. de Vicente, D. Sauerwein, and B. Kraus [Phys. Rev. Lett. (to be published)], arXiv:1606.04418]. Here, we present the details of some of the proofs and generalize the construction of examples of state transformations via ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$ which require a probabilistic step. However, we also present explicit examples of SLOCC classes where any separable transformation can be realized by a protocol in which each step is deterministic (all-det-${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$). Such transformations can be considered as natural generalizations of bipartite transformations. Furthermore, we provide examples of pure state transformations which are possible via separable transformations, but not via ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$. We also analyze an interesting genuinely multipartite effect which we call locking or unlocking the power of other parties. This means that one party can prevent or enable the implementation of LOCC transformations by other parties. Moreover, we investigate the maximally entangled set restricted to ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$ and show how easily computable bounds on some entanglement measures can be derived by restricting to ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$.

arXiv:1607.05145•Physical Review A•Jan 23, 2017•53 citations
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.
Understanding multipartite entanglement is vital, as it underpins a wide range of phenomena across physics. The study of transformations of states via Local Operations assisted by Classical Communication (LOCC) allows one to quantitatively analyse entanglement, as it induces a partial order in the Hilbert space. However, it has been shown that, for systems with fixed local dimensions, this order is generically trivial, which prevents relating multipartite states to each other with respect to any entanglement measure. In order to obtain a non-trivial partial ordering, we study a physically motivated extension of LOCC: multi-state LOCC. Here, one considers simultaneous LOCC transformations acting on a finite number of entangled pure states. We study both multipartite and bipartite multi-state transformations. In the multipartite case, we demonstrate that one can change the stochastic LOCC (SLOCC) class of the individual initial states by only applying Local Unitaries (LUs). We show that, by transferring entanglement from one state to the other, one can perform state conversions not possible in the single copy case; provide examples of multipartite entanglement catalysis; and demonstrate improved probabilistic protocols. In the bipartite case, we identify numerous non-trivial LU transformations and show that the source entanglement is not additive. These results demonstrate that multi-state LOCC has a much richer landscape than single-state LOCC.
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 average fidelity of the teleportation of coherent states is calculated for general Gaussian bipartite systems shared by the partners of the protocol, Alice and Bob. It is considered that the shared Gaussian bipartite modes suffer independent attenuations before the processing of Alice and Bob. In addition, the classical communication between the partners can be controlled by a gain not necessarily unitary. Comparing with the classical fidelity threshold of measure-and-prepare methods, we establish several genuinely quantum teleportation conditions which depend on the gain and the local attenuations. If the gain can be tuned to maximize the bipartite state set capable of performing genuinely quantum teleportation, then a condition for teleportation robust against local attenuations is found. This condition is demonstrated to be essentially equivalent to the condition of robust Gaussian bipartite entanglement, obtained in previous articles, showing that the robustness against attenuations is an entanglement property relevant for characterization and application of bipartite systems. For the derivation of the robust teleportation conditions, the Gaussian operations onto the bipartite system are thoroughly studied, so that the transformations that maintain the fidelity invariant are found. Some scenarios for different Gaussian bipartite states are presented and discussed.
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 study of state transformations under local operations and classical communication (LOCC) plays a crucial role in entanglement theory. While this has been long ago characterized for pure bipartite states, the situation is drastically different for systems of more parties: generic pure qudit states cannot be obtained from nor transformed to any state (i.e., they are isolated), which contains a different amount of entanglement. We consider here the question of LOCC convertibility for permutation-symmetric pure states of an arbitrary number of parties and local dimension, a class of clear interest both for physical and mathematical reasons and for which the aforementioned result does not apply given that it is a zero-measure subset in the state space. While it turns out that generic nnn-qubit symmetric states are also isolated, we consider particular families for which we can determine to be, on the contrary, endowed with a rich local stabilizer, a necessary requirement for LOCC convertibility to be possible. This allows us to identify classes in which LOCC transformations among permutation-symmetric states are possible. Notwithstanding, we provide several results that indicate severe obstructions to LOCC convertibility in general even within these highly symmetrical classes. In the course of the study of LOCC transformations, we also characterize the local symmetries of symmetric states.
We studied pure state transformations using local operations assisted by finitely many rounds of classical communication (LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​) [C. Spee, J. I. de Vicente, D. Sauerwein, and B. Kraus [Phys. Rev. Lett. (to be published)], arXiv:1606.04418]. Here, we present the details of some of the proofs and generalize the construction of examples of state transformations via LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​ which require a probabilistic step. However, we also present explicit examples of SLOCC classes where any separable transformation can be realized by a protocol in which each step is deterministic (all-det-LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​). Such transformations can be considered as natural generalizations of bipartite transformations. Furthermore, we provide examples of pure state transformations which are possible via separable transformations, but not via LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​. We also analyze an interesting genuinely multipartite effect which we call locking or unlocking the power of other parties. This means that one party can prevent or enable the implementation of LOCC transformations by other parties. Moreover, we investigate the maximally entangled set restricted to LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​ and show how easily computable bounds on some entanglement measures can be derived by restricting to LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​.