arXiv Analytics

Sign in

arXiv:1204.3912 [quant-ph]AbstractReferencesReviewsResources

X-matrices provide a lower bound of concurrence

S. M. Hashemi rafsanjani, S. Agarwal

Published 2012-04-17Version 1

By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for non-separability for bipartite density matrices of arbitrary dimension. Experimentally, our lower bound can be used to confirm non-separability without performing a complete state tomography.

Related articles: Most relevant | Search more
arXiv:quant-ph/0610219 (Published 2006-10-26)
Concurrence of superposition
arXiv:1007.1294 [quant-ph] (Published 2010-07-08)
Factorization Law for Two Lower Bounds of Concurrence
arXiv:1401.0622 [quant-ph] (Published 2014-01-03, updated 2014-02-09)
Lower Bound of Concurrence for Qubit Systems