Manipulating Multi-qudit Entanglement Witnesses by Using Linear Programming

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

29 pages, 4 figures

Scientific paper

10.1103/PhysRevA.75.052326

A new class of entanglement witnesses (EWs) called reduction type entanglement witnesses is introduced, which can detect some multi-qudit entangeled states including PPT ones with Hilbert space of dimension $d_{_{1}}\otimes d_{_{2}}\otimes...\otimes d_{_{n}}$. The novelty of this work comes from the fact that the feasible regions turn out to be convex polygons, hence the manipulation of these EWs reduces to linear programming which can be solved \emph{exactly} by using simplex method. The decomposability and non-decomposability of these EWs are studied and it is shown that it has a close connection with eigenvalues and optimality of EWs. Also using the Jamio\l kowski isomorphism, the corresponding possible positive maps, including the generalized reduction maps of Ref. \cite{Hall1}, are obtained.

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

Manipulating Multi-qudit Entanglement Witnesses by Using Linear Programming 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 Manipulating Multi-qudit Entanglement Witnesses by Using Linear Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Manipulating Multi-qudit Entanglement Witnesses by Using Linear Programming will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-627014

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