2004/07/29 by David Pérez-Garcı́a, David Perez-Garcia · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Advanced Optimization Algorithms Research #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #quant-ph
paper · pdf · doi:10.1016/j.physleta.2004.07.059
published as Phys. Lett. A 330 (2004) 149-154. · 7 pages. To appear in Phys. Lett. A
arxiv created 2004/07/29 · openalex publication_date 2004/08/17 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.