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

刘立国, 田成林, 陈平形, 袁乃昌

Published Jan 1, 2009• 0 citations
OpenAlex

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

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

A lower bound of concurrence for multipartite quantum systems

Xue‐Na Zhu, Ming Li, Shao-Ming Fei

arXiv:1801.00078•Quantum Information Processing•Dec 29, 2017•15 citations

Lower bound of concurrence for qubit systems

Xue‐Na Zhu, Shao-Ming Fei

arXiv:1401.0622•Quantum Information Processing•Nov 23, 2013•17 citations

Improved lowers bounds on GME-concurrence

Zhihua Chen, Jingling Chen, Zhihao Ma +1 more

•May 14, 2012•0 citations

Measurable lower bounds on concurrence

Iman Sargolzahi, Sayyed Yahya Mirafzali, Mohsen Sarbishaei

We derive measurable lower bounds on concurrence of arbitrary mixed states, for both bipartite and multipartite cases. First, we construct measurable lower bonds on the purely algebraic bounds of concurrence [F. Mintert et al. (2004), Phys. Rev. lett., 92, 167902]. Then, using the fact that the sum of the square of the algebraic bounds is a lower bound of the squared concurrence, we sum over our measurable bounds to achieve a measurable lower bound on concurrence. With two typical examples, we show that our method can detect more entangled states and also can give sharper lower bonds than the similar ones.

arXiv:0910.1928•Oct 10, 2009•0 citations
We derive measurable lower bounds on concurrence of arbitrary mixed states, for both bipartite and multipartite cases. First, we construct measurable lower bonds on the purely algebraic bounds of concurrence [F. Mintert et al. (2004), Phys. Rev. lett., 92, 167902]. Then, using the fact that the sum of the square of the algebraic bounds is a lower bound of the squared concurrence, we sum over our measurable bounds to achieve a measurable lower bound on concurrence. With two typical examples, we show that our method can detect more entangled states and also can give sharper lower bonds than the similar ones.