Manipulating Multi-qudit Entanglement Witnesses by Using Linear Programming
arXiv:quant-ph/0611256 · doi:10.1103/PhysRevA.75.052326
Abstract
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 . 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łkowski isomorphism, the corresponding possible positive maps, including the generalized reduction maps of Ref. \cite{Hall1}, are obtained.
29 pages, 4 figures
References in corpus (5)
Cited by in corpus (9)
- Entanglement detection
- Optimal Unambiguous Discrimination of Quantum States
- Practical methods for witnessing genuine multi-qubit entanglement in the vicinity of symmetric states
- Bell-states diagonal entanglement witnesses for relativistic and non-relativistic multispinor systems in arbitrary dimensions
- Multi-qubit stabilizer and cluster entanglement witnesses
- Detecting three-qubit bound MUB diagonal entangled states via Nonlinear optimal entanglement witnesses
- Investigating a Class of Chessboard Density Matrices via Linear and Non-linear Entanglement Witnesses Constructed by Exact Convex Optimization
- Two-qutrit Entanglement Witnesses and Gell-Mann Matrices
- Floating Entanglement Witness Measure and Genetic Algorithm