arXiv Analytics

Sign in

arXiv:0910.1928 [quant-ph]AbstractReferencesReviewsResources

Measurable lower bounds on concurrence

Iman Sargolzahi, Sayyed Yahya Mirafzali, Mohsen Sarbishaei

Published 2009-10-10, updated 2011-01-20Version 2

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.

Comments: 16 pages, 2 figures, 1 Appendix
Journal: Quantum Information and Computation, Vol. 11, No. 1&2 (2011) 0079-0094
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:quant-ph/0605103 (Published 2006-05-11)
On Concurrence and Entanglement of Rank Two Channels
arXiv:0712.1015 [quant-ph] (Published 2007-12-06)
Concurrence and negativity as distances
arXiv:1007.1294 [quant-ph] (Published 2010-07-08)
Factorization Law for Two Lower Bounds of Concurrence