Separability Criterion for multipartite quantum states based on the Bloch representation of density matrices

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

23 pages no figures comments are welcome

Scientific paper

We give a new separability criterion, a necessary condition for separability of $N$-partite quantum states. The criterion is based on the Bloch representation of a $N$-partite quantum state and makes use of multilinear algebra, in particular, the matrization of tensors. Our criterion applies to {\it arbitrary} $N$-partite quantum states in $\mathcal{H}=\mathcal{H}^{d_1}\otimes \mathcal{H}^{d_2} \otimes ... \otimes \mathcal{H}^{d_N}.$ The criterion can test whether a $N$-partite state is entangled and can be applied to different partitions of the $N$-partite system. We provide examples that show the ability of this criterion to detect entanglement. We show that this criterion can detect bound entangled states. We prove a sufficiency condition for separability of a 3-partite state, straightforwardly generalizable to the case $N > 3,$ under certain condition. We also give a necessary and sufficient condition for separability of a class of $N$-qubit states which includes $N$-qubit PPT states.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Separability Criterion for multipartite quantum states based on the Bloch representation of density matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Separability Criterion for multipartite quantum states based on the Bloch representation of density matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Separability Criterion for multipartite quantum states based on the Bloch representation of density matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-415447

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.