Deciding separability with a fixed error
classification
🪐 quant-ph
keywords
errorfixedseparabilitycharacterizationchosencomputationcrossdeciding
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.