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

IEEE Congress on Evolutionary Computation (CEC)

Trace norm related to concurrence

Wei Cheng

Published Jun 1, 2008• 0 citations
Publisher

Abstract

By investigating the property of the trace norm which appeared in the analytical lower bound for the concurrence of arbitrary dimensional bipartite quantum states [Phys. Rev. Lett. 95, 040504 (2005)], we demonstrate the limitation of the bound in that paper and provide several concrete examples.
DOI
10.1109/cec.2008.4630798

Related papers

Lower bounds on concurrence and separability conditions

Julio I. de Vicente

We obtain analytical lower bounds on the concurrence of bipartite quantum systems in arbitrary dimensions related to the violation of separability conditions based on local uncertainty relations and on the Bloch representation of density matrices. We also illustrate how these results complement and improve those recently derived [Chen, Albeverio, and Fei, Phys. Rev. Lett. 95, 040504 (2005)] by considering the Peres-Horodecki and the computable cross-norm or realignment criteria.

arXiv:quant-ph/0611229•Physical Review A•May 17, 2007•122 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.16291•Laser Physics•Mar 18, 2025•1 citation

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 Letters•Jun 1, 2009•11 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

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•310 citations

Tight bounds on the concurrence of quantum superpositions

Julien Niset, Nicolas J. Cerf

The entanglement content of superpositions of quantum states is investigated based on a measure called concurrence. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we find simple inequalities relating the concurrence of the state to that of its components. We derive an exact expression for the concurrence when the component states are biorthogonal and provide elegant upper and lower bounds in all other cases. For quantum bits, our upper bound is tighter than the previously derived bound [N. Linden et al., Phys. Rev. Lett. 97, 100502 (2006)].

arXiv:0705.4650•Physical Review A•Oct 23, 2007•29 citations
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.
The entanglement content of superpositions of quantum states is investigated based on a measure called concurrence. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we find simple inequalities relating the concurrence of the state to that of its components. We derive an exact expression for the concurrence when the component states are biorthogonal and provide elegant upper and lower bounds in all other cases. For quantum bits, our upper bound is tighter than the previously derived bound [N. Linden et al., Phys. Rev. Lett. 97, 100502 (2006)].