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

Family of concurrence monotones and its applications

Gilad Gour

Published Jan 13, 2005• 137 citations
arXivHTMLPDF

Abstract

We extend the definition of concurrence into a family of entanglement monotones, which we call concurrence monotones. We discuss their properties and advantages as computational manageable measures of entanglement, and show that for pure bipartite states all measures of entanglement can be written as functions of the concurrence monotones. We then show that the concurrence monotones provide bounds on quantum information tasks. As an example, we discuss their applications to remote entanglement distributions (RED) such as entanglement swapping and remote preparation of bipartite entangled states (RPBES). We prove a powerful theorem which states what kind of (possibly mixed) bipartite states or distributions of bipartite states cannot be remotely prepared. The theorem establishes an upper bound on the amount of $G$-concurrence (one member in the concurrence family) that can be created between two single-qudit nodes of quantum networks by means of tripartite RED. For pure bipartite states the bound on the $G$-concurrence can always be saturated by RPBES.

DOI
10.1103/physreva.71.012318

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

Remote Preparation and Distribution of Bipartite Entangled States

Gilad Gour, Barry C. Sanders

We prove a powerful theorem for tripartite remote entanglement distribution protocols that establishes an upper bound on the amount of entanglement of formation that can be created between two single-qubit nodes of a quantum network. Our theorem also provides an operational interpretation of concurrence as a type of entanglement capacity.

arXiv:quant-ph/0410016•Physical Review Letters•Dec 20, 2004•61 citations

Multipartite monogamy of the concurrence

Marcio F. Cornelio

The monogamy of entanglement is generally discussed using a bipartite entanglement measure as an upper bound. Here we discuss a new kind of monogamous relation where the upper bound is given by a multipartite measure of entanglement, the generalized concurrence. We show a monogamous equality involving the multipartite concurrence, all the bipartite concurrences, and the genuine tripartite entanglement for pure three-qubit systems. The result extends to mixed states in an inequality involving the generalized concurrence and all the bipartite concurrences. We provide a counterexample showing that the result cannot be extended for systems with more than three qubits.

arXiv:1302.1179•Physical Review A•Mar 25, 2013•35 citations

Two-parameter bipartite entanglement measure

Chen-Ming Bai, Yu Luo

Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies. In this work, inspired by unified entropy, we introduce a two-parameter family of entanglement measures, referred to as the unified $(q,s)$-concurrence. Both the standard entanglement concurrence and the recently proposed $q$-concurrence emerge as special cases within this family. By combining the positive partial transposition and realignment criteria, we derive an analytical lower bound for this measure for arbitrary bipartite mixed states, revealing a connection to strong separability criteria. Explicit expressions are obtained for the unified $(q,s)$-concurrence in the cases of isotropic and Werner states under the constraint $q>1$ and $qs\geq 1$. Furthermore, we explore the monogamy properties of the unified $(q,s)$-concurrence for $q\geq 2$, $0\leq s\leq 1$ and $1\leq qs\leq 3$, in qubit systems. In addition, we derive an entanglement polygon inequality for the unified $(q,s)$-concurrence with $q\geq 1$ and $qs\geq 1$, which manifests the relationship among all the marginal entanglements in any multipartite qudit system.

quant-pharXiv:2601.22568•Feb 2, 2026•0 citations

Computable lower bound of the parameterized entanglement monotone

Ning Yang, Yu Guo, Shuanping Du

Although numerous measures of entanglement have been proposed so far, the calculation of a given faithful entanglement measure is a hard work since it is always involved in some optimization process. It is, therefore, important to estimate the lower bound of a given entanglement measure for an arbitrary quantum state. This results in a subject of intensive mathematical research. In particular, along this line, the lower bounds of concurrence or other measures that are induced from concurrence have been explored a lot. Here, we investigate the lower bounds of two kinds of entanglement monotones, i.e., $q$-concurrence ($q>1$) and $α$-concurrence ($0<α<1$), or termed the parameterized entanglement monotone together. We obtain, in the light of the informationally complete ($N$, $M$)-positive operator-valued measure [($N$, $M$)-POVM], the lower bounds for the case of $\frac12<α<1$, $1<q<2$ for two-qudit states, and the case of $2\leqslant q<3$ for two-qubit states. We list several examples which show that the lower bounds based on ($N$, $M$)-POVM outperform that of GSIC-POVM and SIC-POVM, and all these measurement based bounds are better then the ones induced by positive partial transpose (PPT) and realignment criteria in literature. In addition, we obtain an analytical formula of the parameterized entanglement monotone with $\frac12<α<1$ and $1<q<2$ for the isotropic state.

quant-pharXiv:2605.22165•May 22, 2026•0 citations

Proof of a lower bound for bipartite concurrence via equivalence to an observable entanglement measure

Xi-Jun Ren, Zheng-Wei Zhou, Xingxiang Zhou +1 more

In this Brief Report, we prove that an analytically solvable two-qubit entanglement monotone introduced by Zhang et al. [Phys. Rev. A 76, 032306 (2007)] is no greater than the square of concurrence. This proof is based on the equivalence between Zhang et al.'s monotone and an observable entanglement measure for mixed states suggested by Mintert and Buchleitner [Phys. Rev. Lett. 98, 140505 (2007)]. Our result may clarify the connections between several recently defined entanglement measures and help understand their possible applications in quantum-information theory.

Physical Review A•May 22, 2008•5 citations
We extend the definition of concurrence into a family of entanglement monotones, which we call concurrence monotones. We discuss their properties and advantages as computational manageable measures of entanglement, and show that for pure bipartite states all measures of entanglement can be written as functions of the concurrence monotones. We then show that the concurrence monotones provide bounds on quantum information tasks. As an example, we discuss their applications to remote entanglement distributions (RED) such as entanglement swapping and remote preparation of bipartite entangled states (RPBES). We prove a powerful theorem which states what kind of (possibly mixed) bipartite states or distributions of bipartite states cannot be remotely prepared. The theorem establishes an upper bound on the amount of GGG-concurrence (one member in the concurrence family) that can be created between two single-qudit nodes of quantum networks by means of tripartite RED. For pure bipartite states the bound on the GGG-concurrence can always be saturated by RPBES.
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
The monogamy of entanglement is generally discussed using a bipartite entanglement measure as an upper bound. Here we discuss a new kind of monogamous relation where the upper bound is given by a multipartite measure of entanglement, the generalized concurrence. We show a monogamous equality involving the multipartite concurrence, all the bipartite concurrences, and the genuine tripartite entanglement for pure three-qubit systems. The result extends to mixed states in an inequality involving the generalized concurrence and all the bipartite concurrences. We provide a counterexample showing that the result cannot be extended for systems with more than three qubits.
Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies. In this work, inspired by unified entropy, we introduce a two-parameter family of entanglement measures, referred to as the unified (q,s)(q,s)(q,s)-concurrence. Both the standard entanglement concurrence and the recently proposed qqq-concurrence emerge as special cases within this family. By combining the positive partial transposition and realignment criteria, we derive an analytical lower bound for this measure for arbitrary bipartite mixed states, revealing a connection to strong separability criteria. Explicit expressions are obtained for the unified (q,s)(q,s)(q,s)-concurrence in the cases of isotropic and Werner states under the constraint q>1q>1q>1 and qs≥1qs\geq 1qs≥1. Furthermore, we explore the monogamy properties of the unified (q,s)(q,s)(q,s)-concurrence for q≥2q\geq 2q≥2, 0≤s≤10\leq s\leq 10≤s≤1 and 1≤qs≤31\leq qs\leq 31≤qs≤3, in qubit systems. In addition, we derive an entanglement polygon inequality for the unified (q,s)(q,s)(q,s)-concurrence with q≥1q\geq 1q≥1 and qs≥1qs\geq 1qs≥1, which manifests the relationship among all the marginal entanglements in any multipartite qudit system.
Although numerous measures of entanglement have been proposed so far, the calculation of a given faithful entanglement measure is a hard work since it is always involved in some optimization process. It is, therefore, important to estimate the lower bound of a given entanglement measure for an arbitrary quantum state. This results in a subject of intensive mathematical research. In particular, along this line, the lower bounds of concurrence or other measures that are induced from concurrence have been explored a lot. Here, we investigate the lower bounds of two kinds of entanglement monotones, i.e., qqq-concurrence (q>1q>1q>1) and ααα-concurrence (0<α<10<α<10<α<1), or termed the parameterized entanglement monotone together. We obtain, in the light of the informationally complete (NNN, MMM)-positive operator-valued measure [(NNN, MMM)-POVM], the lower bounds for the case of 12<α<1\frac12<α<121​<α<1, 1<q<21<q<21<q<2 for two-qudit states, and the case of 2⩽q<32\leqslant q<32⩽q<3 for two-qubit states. We list several examples which show that the lower bounds based on (NNN, MMM)-POVM outperform that of GSIC-POVM and SIC-POVM, and all these measurement based bounds are better then the ones induced by positive partial transpose (PPT) and realignment criteria in literature. In addition, we obtain an analytical formula of the parameterized entanglement monotone with 12<α<1\frac12<α<121​<α<1 and 1<q<21<q<21<q<2 for the isotropic state.
In this Brief Report, we prove that an analytically solvable two-qubit entanglement monotone introduced by Zhang et al. [Phys. Rev. A 76, 032306 (2007)] is no greater than the square of concurrence. This proof is based on the equivalence between Zhang et al.'s monotone and an observable entanglement measure for mixed states suggested by Mintert and Buchleitner [Phys. Rev. Lett. 98, 140505 (2007)]. Our result may clarify the connections between several recently defined entanglement measures and help understand their possible applications in quantum-information theory.