arXiv:1401.1624 · Communications in Theoretical Physics

Lower Bound of Concurrence Based on Generalized Positive Maps

Huihui Qin, Shao-Ming Fei

Published Dec 1, 2013• 2 citations

Abstract

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.

DOI: 10.1088/0253-6102/60/6/05

Related papers

Lower Bound of Concurrence Based on Generalized Positive Maps

秦慧慧, 费少明

Communications in Theoretical PhysicsJan 1, 20130 citations

Lower bound of concurrence based on D-type positive map

Lifang Niu, Zhoubo Duan

In this paper, by using the D-type map, we provide an analytical lower bound of concurrence of arbitrary dimensional bipartite quantum system. It is shown that this lower bound is able to improve the existing bounds and detect entanglement better.

International Journal of Quantum InformationAug 1, 20180 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.1000Physical Review AMar 25, 201117 citations

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

Zhi-Bo Chen, Shao-Ming Fei

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.

arXiv:2503.16291Laser PhysicsMar 18, 20251 citation

Lower bound of multipartite concurrence based on subquantum state decomposition

Xue‐Na Zhu, Ming‐Jing Zhao, Shao-Ming Fei

We study the entanglement of tripartite quantum states and provide analytical lower bounds of concurrence in terms of the concurrence of substates. The lower bound may improve all of the existing lower bounds of concurrence. The approach is generalized to arbitrary dimensional multipartite systems.

arXiv:1208.1745Physical Review AAug 7, 201212 citations

A Lower Bound on Concurrence

Liguo Liu, Tian Chenglin, Ping‐Xing Chen +1 more

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.

Chinese Physics LettersJun 1, 200911 citations