Deciding separability with a fixed error
Quantum Physics
2009-11-10 v1
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.
Cite
@article{arxiv.quant-ph/0407247,
title = {Deciding separability with a fixed error},
author = {David Perez-Garcia},
journal= {arXiv preprint arXiv:quant-ph/0407247},
year = {2009}
}
Comments
7 pages. To appear in Phys. Lett. A