Deciding separability with a fixed error
Copyright policy )Deciding separability with a fixed error
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
Foundations, quantum information and its processing, quantum axioms, and philosophy, Quantum Physics, Applications of functional analysis in quantum physics, separability, tensor norms, FOS: Physical sciences, multipartite quantum system, Tensor products in functional analysis, Quantum Physics (quant-ph), density matrix
Foundations, quantum information and its processing, quantum axioms, and philosophy, Quantum Physics, Applications of functional analysis in quantum physics, separability, tensor norms, FOS: Physical sciences, multipartite quantum system, Tensor products in functional analysis, Quantum Physics (quant-ph), density matrix
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).8 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!