Deciding separability with a fixed error
arXiv:quant-ph/0407247 · doi:10.1016/j.physleta.2004.07.059
Abstract
We give a short proof of the cross norm characterization of separability due to O. Rudolph and show how its computation, for a fixed chosen error, can be reduced to a linear programming problem whose dimension grows polynomially with the inverse of the error.
7 pages. To appear in Phys. Lett. A