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:2503.16291 · Laser Physics

A note on lower bounds of concurrence for arbitrary dimensional bipartite quantum states

Zhi-Bo Chen, Shao-Ming Fei

Published Mar 18, 2025• 1 citation
arXivHTMLPDF

Abstract

Abstract Quantification of quantum entanglement plays a crucial role in the study of quantum information tasks. We present analytical lower bounds for both concurrence and 2-concurrence based on the correlation matrices of bipartite quantum states. Compared with other related lower bounds, our approach provides a better estimation of the entanglement, particularly for states with large purity.

DOI
10.1088/1555-6611/adbadd

Related papers

Detecting the concurrence of an unknown state with a single observable

Zhihao Ma, Zhihua Chen, Jing‐Ling Chen

While the detection of entanglement has been proved already to be quite a difficult task, experimental quantification of entanglement is even more challenging. In this work, we derive an analytical lower bound for the concurrence of a bipartite mix quantum state in arbitrary dimension. The lower bound is experimentally implementable in a feasible way, which enabling quantification of entanglement in a broad variety of cases

arXiv:1104.1006•Apr 6, 2011•0 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

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

Lower bound on concurrence and distillation for arbitrary-dimensional bipartite quantum states

Ming‐Jing Zhao, Xue‐Na Zhu, Shao-Ming Fei +1 more

We present a lower bound of concurrence for arbitrary-dimensional bipartite quantum states. This lower bound may be used to improve all the known lower bounds of concurrence. Moreover, the lower bound gives rise to an operational sufficient criterion of distillability of quantum entanglement. The significance of our result is illustrated by quantitative evaluation of entanglement for entangled states that fail to be identified by the usual concurrence estimation method and by showing the distillability of mixed states that cannot be recognized by other distillability criteria.

arXiv:1112.5509•Physical Review A•Dec 22, 2011•19 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

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
Abstract Quantification of quantum entanglement plays a crucial role in the study of quantum information tasks. We present analytical lower bounds for both concurrence and 2-concurrence based on the correlation matrices of bipartite quantum states. Compared with other related lower bounds, our approach provides a better estimation of the entanglement, particularly for states with large purity.
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.
We present a lower bound of concurrence for arbitrary-dimensional bipartite quantum states. This lower bound may be used to improve all the known lower bounds of concurrence. Moreover, the lower bound gives rise to an operational sufficient criterion of distillability of quantum entanglement. The significance of our result is illustrated by quantitative evaluation of entanglement for entangled states that fail to be identified by the usual concurrence estimation method and by showing the distillability of mixed states that cannot be recognized by other distillability criteria.