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:2211.04868 · Quantum Information Processing

A family of separability criteria and lower bounds of concurrence

Xian Shi, Yashuai Sun

Published Feb 27, 2023• 12 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-03875-9

Related papers

Separability Criteria and Lower Bound for Concurrence Based on Hermitian Maps

Hao Guo, Fei Qi, Qiang Lei

International Journal of Theoretical Physics•Feb 2, 2015•0 citations

Realignment-based separability criteria and lower bounds of entanglement

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

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

Separability and lower bounds of concurrence via symmetric measurement correlations

Yuhang Xie, Yanjun Chu, Shao-Ming Fei

The detection and quantification of quantum entanglement is a central issue in quantum information science, particularly for unknown quantum states. Based on symmetric measurement correlation matrices, we present a family of separability criteria that can be experimentally applied without state tomography, and recover some related existing criteria as special cases. Using the constructed correlation matrices, we further derive a class of lower bounds of concurrence. Through illustrative examples, we demonstrate that our criteria outperform some existing separability criteria in entanglement detection, and that the obtained lower bounds on concurrence are tighter than known counterparts.

arXiv:2611.07727•Nov 5, 2026•0 citations

Some aspects of separability revisited

Oliver Rudolph

Physics Letters A•Jan 7, 2004•3 citations

Separability criteria via some classes of measurements

Lu Liu, Ting Gao, FengLi Yan

arXiv:1704.08486•Science China Physics Mechanics and Astronomy•Aug 17, 2017•16 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.
The detection and quantification of quantum entanglement is a central issue in quantum information science, particularly for unknown quantum states. Based on symmetric measurement correlation matrices, we present a family of separability criteria that can be experimentally applied without state tomography, and recover some related existing criteria as special cases. Using the constructed correlation matrices, we further derive a class of lower bounds of concurrence. Through illustrative examples, we demonstrate that our criteria outperform some existing separability criteria in entanglement detection, and that the obtained lower bounds on concurrence are tighter than known counterparts.