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

Entanglement of Assistance is not an entanglement monotone

Gilad Gour, Robert W. Spekkens

Published Dec 17, 2005• 0 citations
OpenAlex

Abstract

The entanglement of assistance quantifies the entanglement that can be generated between two parties, Alice and Bob, given assistance from a third party, Charlie, when the three share a tripartite state and where the assistance consists of Charlie initially performing a measurement on his share and communicating the result to Alice and Bob through a one-way classical channel. We compare this with the entanglement that can be generated between Alice and Bob when they are allowed to make use of a two-way classical channel with Charlie. We show that the latter quantity, which we call the entanglement of collaboration, can be greater than the entanglement of assistance. This demonstrates that the entanglement of assistance, and its multipartite generalizations such as the localizable entanglement, are not entanglement monotones, thereby undermining their operational significance.

Related papers

Entanglement of assistance is not a bipartite measure nor a tripartite monotone

Gilad Gour, Robert W. Spekkens

The entanglement of assistance quantifies the entanglement that can be generated between two parties, Alice and Bob, given assistance from a third party, Charlie, when the three share a tripartite state and where the assistance consists of Charlie initially performing a measurement on his share and communicating the result to Alice and Bob through a one-way classical channel. We argue that if this quantity is to be considered an operational measure of entanglement, then it must be understood to be a tripartite rather than a bipartite measure. We compare it with a distinct tripartite measure that quantifies the entanglement that can be generated between Alice and Bob when they are allowed to make use of a two-way classical channel with Charlie. We show that the latter quantity, which we call the entanglement of collaboration, can be greater than the entanglement of assistance. This demonstrates that the entanglement of assistance (considered as a tripartite measure of entanglement), and its multipartite generalizations such as the localizable entanglement, are not entanglement monotones, thereby undermining their operational significance.

arXiv:quant-ph/0512139•Physical Review A•Jun 26, 2006•47 citations

Entanglement of collaboration

Gilad Gour

The entanglement of collaboration (EOC) quantifies the maximum amount of entanglement that can be generated between two parties, $A$ and $B$, given collaboration with $N\ensuremath{-}2$ other parties, when the $N$ parties share a multipartite (possibly mixed) state and where the collaboration consists of local operations and classical communication by all parties. The localizable entanglement (LE) is defined similarly except that $A$ and $B$ do not participate in the effort to generate bipartite entanglement. We compare between these two operational definitions and find sufficient conditions for which the EOC is equal to the LE. In particular, we find that the two are equal whenever they are measured by the concurrence or by one of its generalizations called the G-concurrence. We also find a simple expression for the LE in terms of the Jamiolkowski isomorphism and prove that it is convex.

arXiv:quant-ph/0610132•Physical Review A•Nov 6, 2006•15 citations

Weaker entanglement between two parties guarantees stronger entanglement with a third party

Masahito Hayashi, Lin Chen

The monogamy of entanglement is one of the basic quantum mechanical features, which says that when two partners Alice and Bob are more entangled then either of them has to be less entangled with the third party. Here we qualitatively present the converse monogamy of entanglement: given a tripartite pure system and when Alice and Bob are weakly entangled, then either of them is generally strongly entangled with the third party. Our result leads to the classification of tripartite pure states based on bipartite reduced density operators, which is an effective way to this longstanding problem compared to the means by stochastic local operations and classical communications. We also systematically indicate the structure of the classified states and generate them.

arXiv:1102.0439•Physical Review A•Jul 21, 2011•36 citations

Multiparty Zero-Error Classical Channel Coding With Entanglement

Teresa Piovesan, Giannicola Scarpa, Christian Schaffner

We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicate a common message to multiple receivers. We show that if the number of receivers is greater than a certain threshold then entanglement does not allow for an improvement in the communication for any finite number of uses of the channel. On the other hand, when the number of receivers is fixed, we exhibit a class of channels for which entanglement gives an advantage. The second problem we consider features multiple collaborating senders and one receiver. Classically, cooperation among the senders might allow them to communicate on average more messages than the sum of their individual possibilities. We show that whenever a channel allows single-sender entanglement-assisted advantage, then the gain extends also to the multisender case. Furthermore, we show that entanglement allows for a peculiar amplification of information which cannot happen classically, for a fixed number of uses of the channels.

arXiv:1403.5003•IEEE Transactions on Information Theory•Dec 10, 2014•4 citations

Entanglement of assistance and multipartite state distillation

John A. Smolin, Frank Verstraete, Andreas Winter

We find that the asymptotic entanglement of assistance of a general bipartite mixed state is equal to the smaller of its two local entropies. Our protocol gives rise to the asymptotically optimal Einstein-Podolsky-Rosen (EPR) pair distillation procedure for a given tripartite pure state, and we show that it actually yields EPR and Greenberger-Horne-Zeilinger (GHZ) states; in fact, under a restricted class of protocols, which we call ``one-way broadcasting,'' the GHZ rate is shown to be optimal. This result implies a capacity theorem for quantum channels where the environment helps transmission by broadcasting the outcome of an optimally chosen measurement. We discuss generalizations to $m$ parties and show (for $m=4$) that the maximal amount of entanglement that can be localized between two parties is given by the smallest entropy of a group of parties of which the one party is a member, but not the other. This gives an explicit expression for the asymptotic localizable entanglement and shows that any nontrivial ground state of a spin system can be used as a perfect quantum repeater if many copies are available in parallel. Finally, we provide evidence that any unital channel is asymptotically equivalent to a mixture of unitaries and any general channel to a mixture of partial isometries.

arXiv:quant-ph/0505038•Physical Review A•Nov 17, 2005•158 citations

Deterministic entanglement of assistance and monogamy constraints

Gilad Gour, David Meyer, Barry C. Sanders

Certain quantum-information tasks require entanglement of assistance, namely, a reduction of a tripartite entangled state to a bipartite entangled state via local measurements. We establish that concurrence of assistance (COA) identifies capabilities of and limitations to producing pure bipartite entangled states from pure tripartite entangled states and prove that COA is an entanglement monotone for $(2\ifmmode\times\else\texttimes\fi{}2\ifmmode\times\else\texttimes\fi{}n)$-dimensional pure states. Moreover, if the COA for the pure tripartite state is at least as large as the concurrence of the desired pure bipartite state, then the former may be transformed to the latter via local operations and classical communication, and we calculate the maximum probability for this transformation when this condition is not met.

arXiv:quant-ph/0505091•Physical Review A•Oct 26, 2005•105 citations
The entanglement of assistance quantifies the entanglement that can be generated between two parties, Alice and Bob, given assistance from a third party, Charlie, when the three share a tripartite state and where the assistance consists of Charlie initially performing a measurement on his share and communicating the result to Alice and Bob through a one-way classical channel. We compare this with the entanglement that can be generated between Alice and Bob when they are allowed to make use of a two-way classical channel with Charlie. We show that the latter quantity, which we call the entanglement of collaboration, can be greater than the entanglement of assistance. This demonstrates that the entanglement of assistance, and its multipartite generalizations such as the localizable entanglement, are not entanglement monotones, thereby undermining their operational significance.
The entanglement of assistance quantifies the entanglement that can be generated between two parties, Alice and Bob, given assistance from a third party, Charlie, when the three share a tripartite state and where the assistance consists of Charlie initially performing a measurement on his share and communicating the result to Alice and Bob through a one-way classical channel. We argue that if this quantity is to be considered an operational measure of entanglement, then it must be understood to be a tripartite rather than a bipartite measure. We compare it with a distinct tripartite measure that quantifies the entanglement that can be generated between Alice and Bob when they are allowed to make use of a two-way classical channel with Charlie. We show that the latter quantity, which we call the entanglement of collaboration, can be greater than the entanglement of assistance. This demonstrates that the entanglement of assistance (considered as a tripartite measure of entanglement), and its multipartite generalizations such as the localizable entanglement, are not entanglement monotones, thereby undermining their operational significance.
The entanglement of collaboration (EOC) quantifies the maximum amount of entanglement that can be generated between two parties, AAA and BBB, given collaboration with $N\ensuremath{-}2$ other parties, when the NNN parties share a multipartite (possibly mixed) state and where the collaboration consists of local operations and classical communication by all parties. The localizable entanglement (LE) is defined similarly except that AAA and BBB do not participate in the effort to generate bipartite entanglement. We compare between these two operational definitions and find sufficient conditions for which the EOC is equal to the LE. In particular, we find that the two are equal whenever they are measured by the concurrence or by one of its generalizations called the G-concurrence. We also find a simple expression for the LE in terms of the Jamiolkowski isomorphism and prove that it is convex.
The monogamy of entanglement is one of the basic quantum mechanical features, which says that when two partners Alice and Bob are more entangled then either of them has to be less entangled with the third party. Here we qualitatively present the converse monogamy of entanglement: given a tripartite pure system and when Alice and Bob are weakly entangled, then either of them is generally strongly entangled with the third party. Our result leads to the classification of tripartite pure states based on bipartite reduced density operators, which is an effective way to this longstanding problem compared to the means by stochastic local operations and classical communications. We also systematically indicate the structure of the classified states and generate them.
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicate a common message to multiple receivers. We show that if the number of receivers is greater than a certain threshold then entanglement does not allow for an improvement in the communication for any finite number of uses of the channel. On the other hand, when the number of receivers is fixed, we exhibit a class of channels for which entanglement gives an advantage. The second problem we consider features multiple collaborating senders and one receiver. Classically, cooperation among the senders might allow them to communicate on average more messages than the sum of their individual possibilities. We show that whenever a channel allows single-sender entanglement-assisted advantage, then the gain extends also to the multisender case. Furthermore, we show that entanglement allows for a peculiar amplification of information which cannot happen classically, for a fixed number of uses of the channels.
We find that the asymptotic entanglement of assistance of a general bipartite mixed state is equal to the smaller of its two local entropies. Our protocol gives rise to the asymptotically optimal Einstein-Podolsky-Rosen (EPR) pair distillation procedure for a given tripartite pure state, and we show that it actually yields EPR and Greenberger-Horne-Zeilinger (GHZ) states; in fact, under a restricted class of protocols, which we call ``one-way broadcasting,'' the GHZ rate is shown to be optimal. This result implies a capacity theorem for quantum channels where the environment helps transmission by broadcasting the outcome of an optimally chosen measurement. We discuss generalizations to mmm parties and show (for m=4m=4m=4) that the maximal amount of entanglement that can be localized between two parties is given by the smallest entropy of a group of parties of which the one party is a member, but not the other. This gives an explicit expression for the asymptotic localizable entanglement and shows that any nontrivial ground state of a spin system can be used as a perfect quantum repeater if many copies are available in parallel. Finally, we provide evidence that any unital channel is asymptotically equivalent to a mixture of unitaries and any general channel to a mixture of partial isometries.
Certain quantum-information tasks require entanglement of assistance, namely, a reduction of a tripartite entangled state to a bipartite entangled state via local measurements. We establish that concurrence of assistance (COA) identifies capabilities of and limitations to producing pure bipartite entangled states from pure tripartite entangled states and prove that COA is an entanglement monotone for $(2\ifmmode\times\else\texttimes\fi{}2\ifmmode\times\else\texttimes\fi{}n)$-dimensional pure states. Moreover, if the COA for the pure tripartite state is at least as large as the concurrence of the desired pure bipartite state, then the former may be transformed to the latter via local operations and classical communication, and we calculate the maximum probability for this transformation when this condition is not met.