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

International Journal of Theoretical Physics

Separability Criteria and Lower Bound for Concurrence Based on Hermitian Maps

Hao Guo, Fei Qi, Qiang Lei

Published Feb 2, 2015• 0 citations
Publisher
DOI
10.1007/s10773-015-2540-3

Related papers

A family of separability criteria and lower bounds of concurrence

Xian Shi, Yashuai Sun

arXiv:2211.04868•Quantum Information Processing•Feb 27, 2023•11 citations

Realignment-based separability criteria and lower bounds of entanglement

Yu Shan Lu, Zhong‐Xi Shen, Shao-Ming Fei +1 more

Quantum Information Processing•May 13, 2025•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

A Lower Bound on Concurrence

刘立国, 田成林, 陈平形 +1 more

Chinese Physics Letters•Jan 1, 2009•0 citations

Separability criteria and lower bounds of entanglement via realignment

Yuhang Xie, Yanjun Chu, Shao-Ming Fei

The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.

quant-pharXiv:2610.15664•Oct 13, 2026•0 citations

Quantum entanglement estimation via symmetric-measurement-based positive maps

Jiaxin Li, Hongmei Yao, Shao-Ming Fei +2 more

We provide a class of positive and trace-preserving maps based on symmetric measurements. From these positive maps we present separability criteria, entanglement witnesses, and the lower bounds of concurrence. We show by detailed examples that our separability criteria, entanglement witnesses, and lower bounds can detect and estimate the quantum entanglement better than existing related results.

arXiv:2405.11741•Physical Review A•May 15, 2024•11 citations
The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.