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

Chinese Physics Letters

A Lower Bound on Concurrence

Liguo Liu, Tian Chenglin, Ping‐Xing Chen, Yuan Naichang

Published Jun 1, 2009• 11 citations
Publisher

Abstract

We derive an analytical lower bound on the concurrence for bipartite quantum systems with an improved computable cross norm or realignment criterion and an improved positive partial transpose criterion respectively. Furthermore we demonstrate that our bound is better than that obtained from the local uncertainty relations criterion with optimal local orthogonal observables which is known as one of the best estimations of concurrence.

DOI
10.1088/0256-307x/26/6/060306

Related papers

Lower bounds on concurrence and separability conditions

Julio I. de Vicente

We obtain analytical lower bounds on the concurrence of bipartite quantum systems in arbitrary dimensions related to the violation of separability conditions based on local uncertainty relations and on the Bloch representation of density matrices. We also illustrate how these results complement and improve those recently derived [Chen, Albeverio, and Fei, Phys. Rev. Lett. 95, 040504 (2005)] by considering the Peres-Horodecki and the computable cross-norm or realignment criteria.

arXiv:quant-ph/0611229•Physical Review A•May 17, 2007•126 citations

Lower bound of concurrence based on positive maps

Xiaosheng Li, Xiu-Hong Gao, Shao-Ming Fei

We study the concurrence of arbitrary dimensional bipartite quantum systems. An explicit analytical lower bound of concurrence is obtained which detects entanglement for some quantum states better than some well-known separability criteria and improves the lower bounds, such as from the positive partial transposition, realignment criteria, and Breuer's entanglement witness.

arXiv:1104.1000•Physical Review A•Mar 25, 2011•17 citations

Lower Bound of Concurrence Based on Generalized Positive Maps

Huihui Qin, Shao-Ming Fei

We study the concurrence of arbitrary dimensional bipartite quantum systems. By using a positive but not completely positive map, we present an analytical lower bound of concurrence. Detailed examples are used to show that our bound can detect entanglement better and can improve the well known existing lower bounds.

arXiv:1401.1624•Communications in Theoretical Physics•Dec 1, 2013•2 citations

Estimating the concurrence for quantum states via symmetric measurements

Hao-Fan Wang, Wen Zhou, Lin Chen +1 more

Concurrence is one of the most well-known entanglement measures. We show that, for arbitrary bipartite states, the lower bound of concurrence induced by symmetric measurements is always tighter than the one obtain from realignment. Besides, we derive an extended version of lower bound of concurrence induced by symmetric measurements, which can also be experimentally identified without state tomography, and further present a corresponding lower bound of genuine tripartite entanglement concurrence.

quant-pharXiv:2606.31010•Jul 1, 2026•0 citations

Lower Bound of Concurrence Based on Generalized Positive Maps

秦慧慧, 费少明

We study the concurrence of arbitrary dimensional bipartite quantum systems. By using a positive but not completely positive map, we present an analytical lower bound of concurrence. Detailed examples are used to show that our bound can detect entanglement better and can improve the well known existing lower bounds.

Communications in Theoretical Physics•Jan 1, 2013•0 citations

Concurrence of Arbitrary Dimensional Bipartite Quantum States

Kai Chen, Sergio A Albeverio, Shao-Ming Fei

We derive an analytical lower bound for the concurrence of a bipartite quantum state in arbitrary dimension. A functional relation is established relating concurrence, the Peres-Horodecki criterion, and the realignment criterion. We demonstrate that our bound is exact for some mixed quantum states. The significance of our method is illustrated by giving a quantitative evaluation of entanglement for many bound entangled states, some of which fail to be identified by the usual concurrence estimation method.

arXiv:quant-ph/0506136•Physical Review Letters•Jul 22, 2005•315 citations
We derive an analytical lower bound on the concurrence for bipartite quantum systems with an improved computable cross norm or realignment criterion and an improved positive partial transpose criterion respectively. Furthermore we demonstrate that our bound is better than that obtained from the local uncertainty relations criterion with optimal local orthogonal observables which is known as one of the best estimations of concurrence.
Concurrence is one of the most well-known entanglement measures. We show that, for arbitrary bipartite states, the lower bound of concurrence induced by symmetric measurements is always tighter than the one obtain from realignment. Besides, we derive an extended version of lower bound of concurrence induced by symmetric measurements, which can also be experimentally identified without state tomography, and further present a corresponding lower bound of genuine tripartite entanglement concurrence.
We derive an analytical lower bound for the concurrence of a bipartite quantum state in arbitrary dimension. A functional relation is established relating concurrence, the Peres-Horodecki criterion, and the realignment criterion. We demonstrate that our bound is exact for some mixed quantum states. The significance of our method is illustrated by giving a quantitative evaluation of entanglement for many bound entangled states, some of which fail to be identified by the usual concurrence estimation method.