2008/11/30 by Jan Sperling, J. Sperling, W. Vogel · 3 citations
Computer Science · Mathematics · Physics and Astronomy · Psychology · #Ambiguity #Bipartite graph #Computer science #Concurrence #Discrete mathematics #Mathematical analysis #Mathematics #Multipartite entanglement #Negativity effect #Physics #Psychology #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum discord #Quantum entanglement #Quantum mechanics #Quantum state #Representation (politics) #Separable space #Separable state #Squashed entanglement #Statistical physics #quant-ph
paper · pdf · doi:10.1103/physreva.79.042337
published as Phys. Rev. A 79, 042337 (2009) · 9 pages, 2 figures; An optimization procedure for the quasi-probabilities has been added
arxiv created 2009/03/18 · openalex publication_date 2009/04/28 · arxiv updated 2015/05/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Any bipartite quantum state has quasiprobability representations in terms of separable states. For entangled states these quasiprobabilities necessarily exhibit negativities. Based on the general structure of composite quantum states, one may reconstruct such quasiprobabilities from experimental data. Because of ambiguity, the quasiprobabilities obtained by the bare reconstruction are insufficient to identify entanglement. An optimization procedure is introduced to derive quasiprobabilities with a minimal amount of negativity. Negativities of optimized quasiprobabilities are necessary and sufficient for entanglement; their positivity proves separability.