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:quant-ph/0403063 · Physical Review Letters

Concurrence of Mixed Bipartite Quantum States in Arbitrary Dimensions

Florian Mintert, Marek Kuś, Andreas Buchleitner

Published Apr 23, 2004• 252 citations
arXivHTMLPDF

Abstract

We derive a lower bound for the concurrence of mixed bipartite quantum states, valid in arbitrary dimensions. As a corollary, a weaker, purely algebraic estimate is found, which detects mixed entangled states with a positive partial transpose.
DOI
10.1103/physrevlett.92.167902

Related papers

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

Detecting the concurrence of an unknown state with a single observable

Zhihao Ma, Zhihua Chen, Jing‐Ling Chen

While the detection of entanglement has been proved already to be quite a difficult task, experimental quantification of entanglement is even more challenging. In this work, we derive an analytical lower bound for the concurrence of a bipartite mix quantum state in arbitrary dimension. The lower bound is experimentally implementable in a feasible way, which enabling quantification of entanglement in a broad variety of cases

arXiv:1104.1006•Apr 6, 2011•0 citations

A lower bound of concurrence for multipartite quantum states

Ming Li, Shao-Ming Fei, Zhi‐Xi Wang

We study the concurrence of arbitrary multipartite mixed quantum states. An explicit lower bound of the concurrence is derived, which detects quantum entanglement of some states better than some separability criteria, and gives sufficient conditions for distilling GHZ states from tripartite states. An interesting relation between the lower bound of the concurrence for bipartite states and for tripartite states has been presented.

arXiv:0903.3145•Journal of Physics A Mathematical and Theoretical•Mar 17, 2009•59 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

Lower bound on concurrence and distillation for arbitrary-dimensional bipartite quantum states

Ming‐Jing Zhao, Xue‐Na Zhu, Shao-Ming Fei +1 more

We present a lower bound of concurrence for arbitrary-dimensional bipartite quantum states. This lower bound may be used to improve all the known lower bounds of concurrence. Moreover, the lower bound gives rise to an operational sufficient criterion of distillability of quantum entanglement. The significance of our result is illustrated by quantitative evaluation of entanglement for entangled states that fail to be identified by the usual concurrence estimation method and by showing the distillability of mixed states that cannot be recognized by other distillability criteria.

arXiv:1112.5509•Physical Review A•Dec 22, 2011•19 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 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.
We present a lower bound of concurrence for arbitrary-dimensional bipartite quantum states. This lower bound may be used to improve all the known lower bounds of concurrence. Moreover, the lower bound gives rise to an operational sufficient criterion of distillability of quantum entanglement. The significance of our result is illustrated by quantitative evaluation of entanglement for entangled states that fail to be identified by the usual concurrence estimation method and by showing the distillability of mixed states that cannot be recognized by other distillability criteria.
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.