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

Quantum Information Processing

A useful strong lower bound on two-qubit concurrence

Mojtaba Jafarpour, Abbass Sabour

Published Aug 27, 2011• 6 citations
Publisher
DOI
10.1007/s11128-011-0288-0

Related papers

Lower bound of concurrence for qubit systems

Xue‐Na Zhu, Shao-Ming Fei

arXiv:1401.0622•Quantum Information Processing•Nov 23, 2013•17 citations

Lower bounds of concurrence for N-qubit systems and the detection of k-nonseparability of multipartite quantum systems

Xianfei Qi, Ting Gao, Fengli Yan

arXiv:1605.05000•Quantum Information Processing•Dec 19, 2016•13 citations

Estimating Entanglement Monotones with a Generalization of the Wootters Formula

Zhihua Chen, Zhihao Ma, Otfried Gühne +1 more

Entanglement monotones, such as the concurrence, are useful tools to characterize quantum correlations in various physical systems. The computation of the concurrence involves, however, difficult optimizations and only for the simplest case of two qubits a closed formula was found by Wootters [Phys. Rev. Lett. 80, 2245 (1998)]. We show how this approach can be generalized, resulting in lower bounds on the concurrence for higher dimensional systems as well as for multipartite systems. We demonstrate that for certain families of states our results constitute the strongest bipartite entanglement criterion so far; moreover, they allow us to recognize novel families of multiparticle bound entangled states.

arXiv:1207.2889•Physical Review Letters•Nov 16, 2012•51 citations

X-matrices provide a lower bound of concurrence

Seyed Mohammad Hashemi Rafsanjani, Shantanu Agarwal

By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for non-separability for bipartite density matrices of arbitrary dimension. Experimentally, our lower bound can be used to confirm non-separability without performing a complete state tomography.

arXiv:1204.3912•Apr 17, 2012•9 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•1 citation

A lower bound of concurrence for multipartite quantum systems

Xue‐Na Zhu, Ming Li, Shao-Ming Fei

arXiv:1801.00078•Quantum Information Processing•Dec 29, 2017•16 citations
Entanglement monotones, such as the concurrence, are useful tools to characterize quantum correlations in various physical systems. The computation of the concurrence involves, however, difficult optimizations and only for the simplest case of two qubits a closed formula was found by Wootters [Phys. Rev. Lett. 80, 2245 (1998)]. We show how this approach can be generalized, resulting in lower bounds on the concurrence for higher dimensional systems as well as for multipartite systems. We demonstrate that for certain families of states our results constitute the strongest bipartite entanglement criterion so far; moreover, they allow us to recognize novel families of multiparticle bound entangled states.
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.