pith. sign in

arxiv: 1204.3912 · v1 · pith:D65EWN54new · submitted 2012-04-17 · 🪐 quant-ph

X-matrices provide a lower bound of concurrence

classification 🪐 quant-ph
keywords boundlowerconcurrencedensitynon-separabilityqubitsalgebraicarbitrary
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.