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/0505091 · Physical Review A

Deterministic entanglement of assistance and monogamy constraints

Gilad Gour, DAVID A. MEYER, Barry C. Sanders

Published Oct 26, 2005• 108 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.72.042329

Related papers

Deterministic entanglement of assistance in quantum networks

Barry C. Sanders, Gilad Gour, DAVID A. MEYER

We present a powerful theorem for tripartite remote entanglement distribution protocols, which provides an operational interpretation of concurrence as a type of entanglement capacity, and we establish that concurrence of assistance, which we show is an entanglement monotone, identifies capabilities of and limitations to producing pure bipartite entangled states from pure tripartite entangled states. In addition, we show that, if concurrence of assistance 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.PACS Nos.: 03.67.Mn, 03.67.Hk, 03.65.Ud

Canadian Journal of Physics•Jan 15, 2006•0 citations

Mixed-state entanglement of assistance and the generalized concurrence

Gilad Gour

We consider the maximum bipartite entanglement that can be distilled from a single copy of a multipartite mixed entangled state, where we focus mostly on $(d\ifmmode\times\else\texttimes\fi{}d\ifmmode\times\else\texttimes\fi{}n)$-dimensional tripartite mixed states. We show that this assisted entanglement, when measured in terms of the generalized concurrence (called the $G$ concurrence), is (tightly) bounded by an entanglement monotone, which we call the $G$ concurrence of assistance. The $G$ concurrence is one of the possible generalizations of the concurrence to higher dimensions, and for pure bipartite states it measures the geometric mean of the Schmidt numbers. For a large (nontrivial) class of $(d\ifmmode\times\else\texttimes\fi{}d)$-dimensional mixed states, we are able to generalize Wootters' formula for the concurrence into lower and upper bounds on the $G$ concurrence. Moreover, we have found an explicit formula for the $G$ concurrence of assistance that generalizes the expression for the concurrence of assistance for a large class of $(d\ifmmode\times\else\texttimes\fi{}d\ifmmode\times\else\texttimes\fi{}n)$-dimensional tripartite pure states.

arXiv:quant-ph/0506229•Physical Review A•Oct 19, 2005•40 citations

Bound of entanglement of assistance and monogamy constraints

Zong-Guo Li, Shao-Ming Fei, Sergio A Albeverio +1 more

We investigate the entanglement of assistance which quantifies capabilities of producing pure bipartite entangled states from a pure tripartite state. The lower bound and upper bound of entanglement of assistance are obtained. In the light of the upper bound, monogamy constraints are proved for arbitrary $n$-qubit states.

arXiv:0904.2809•Physical Review A•Sep 25, 2009•41 citations

Entanglement monogamy of tripartite quantum states

Chang‐shui Yu, He‐Shan Song

An interesting monogamy equation with the form of the Pythagorean theorem is found for $2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}n$-dimensional pure states, which reveals the relation among bipartite concurrence, concurrence of assistance, and genuine tripartite entanglement. At the same time, a genuine tripartite entanglement monotone as a generalization of 3-tangle is naturally obtained for $(2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}n)$-dimensional pure states in terms of a distinct idea. For mixed states, the monogamy equation is reduced to a monogamy inequality. Both results for tripartite quantum states can be employed to multipartite quantum states.

arXiv:0803.2954•Physical Review A•Mar 19, 2008•70 citations

A stronger entanglement monogamy inequality in a 2⊗2⊗3 system

Xi-Jun Ren, Yanni Shi

In this paper, we prove a stronger entanglement monogamy inequality in a 2⊗2⊗3 system's pure state |Ψ⟩ABC. Specifically, we show that the linear entropy of ρA, which is the entanglement between A and BC, is always larger than the sum of the square of concurrence between A and B and the square of concurrence of assistance between A and C. Our proof is based on direct generalizations of the qubit system's results. Our inequality is stronger than the known monogamy inequality of concurrence and shows that the entanglement of assistance always comes from the existing entanglement. However, our inequality also shows that unlike the three-qubit case, in higher dimensional systems the entanglement between A and BC cannot be completely transformed into bipartite entanglement with assistance. Through our proof, we also give some cases when the inequality reduces to an equality.

Journal of Physics A Mathematical and Theoretical•Aug 23, 2010•2 citations

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•44 citations
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×\else\texttimes\fi2\ifmmode×\else\texttimes\fin)(2\ifmmode\times\else\texttimes\fi{}2\ifmmode\times\else\texttimes\fi{}n)(2\ifmmode×\else\texttimes\fi2\ifmmode×\else\texttimes\fin)-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.
We present a powerful theorem for tripartite remote entanglement distribution protocols, which provides an operational interpretation of concurrence as a type of entanglement capacity, and we establish that concurrence of assistance, which we show is an entanglement monotone, identifies capabilities of and limitations to producing pure bipartite entangled states from pure tripartite entangled states. In addition, we show that, if concurrence of assistance 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.PACS Nos.: 03.67.Mn, 03.67.Hk, 03.65.Ud
We consider the maximum bipartite entanglement that can be distilled from a single copy of a multipartite mixed entangled state, where we focus mostly on $(d\ifmmode\times\else\texttimes\fi{}d\ifmmode\times\else\texttimes\fi{}n)$-dimensional tripartite mixed states. We show that this assisted entanglement, when measured in terms of the generalized concurrence (called the GGG concurrence), is (tightly) bounded by an entanglement monotone, which we call the GGG concurrence of assistance. The GGG concurrence is one of the possible generalizations of the concurrence to higher dimensions, and for pure bipartite states it measures the geometric mean of the Schmidt numbers. For a large (nontrivial) class of $(d\ifmmode\times\else\texttimes\fi{}d)$-dimensional mixed states, we are able to generalize Wootters' formula for the concurrence into lower and upper bounds on the GGG concurrence. Moreover, we have found an explicit formula for the GGG concurrence of assistance that generalizes the expression for the concurrence of assistance for a large class of $(d\ifmmode\times\else\texttimes\fi{}d\ifmmode\times\else\texttimes\fi{}n)$-dimensional tripartite pure states.
We investigate the entanglement of assistance which quantifies capabilities of producing pure bipartite entangled states from a pure tripartite state. The lower bound and upper bound of entanglement of assistance are obtained. In the light of the upper bound, monogamy constraints are proved for arbitrary nnn-qubit states.
An interesting monogamy equation with the form of the Pythagorean theorem is found for $2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}n$-dimensional pure states, which reveals the relation among bipartite concurrence, concurrence of assistance, and genuine tripartite entanglement. At the same time, a genuine tripartite entanglement monotone as a generalization of 3-tangle is naturally obtained for $(2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}n)$-dimensional pure states in terms of a distinct idea. For mixed states, the monogamy equation is reduced to a monogamy inequality. Both results for tripartite quantum states can be employed to multipartite quantum states.
In this paper, we prove a stronger entanglement monogamy inequality in a 2⊗2⊗3 system's pure state |Ψ⟩ABC. Specifically, we show that the linear entropy of ρA, which is the entanglement between A and BC, is always larger than the sum of the square of concurrence between A and B and the square of concurrence of assistance between A and C. Our proof is based on direct generalizations of the qubit system's results. Our inequality is stronger than the known monogamy inequality of concurrence and shows that the entanglement of assistance always comes from the existing entanglement. However, our inequality also shows that unlike the three-qubit case, in higher dimensional systems the entanglement between A and BC cannot be completely transformed into bipartite entanglement with assistance. Through our proof, we also give some cases when the inequality reduces to an equality.
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.