2005/05/31 by Martin B. Plenio, M. B. Plenio · 10 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physrevlett.95.090503
published as Phys. Rev. Lett. 95, 090503 (2005) · Replaced with published version which includes one figure
openalex publication_date 2005/08/26 · arxiv created 2006/02/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31
It is proven that logarithmic negativity does not increase on average under a general positive partial transpose preserving operation (a set of operations that incorporate local operations and classical communication as a subset) and, in the process, a further proof is provided that the negativity does not increase on average under the same set of operations. Given that the logarithmic negativity is not a convex function this result is surprising, as it is generally considered that convexity describes the local physical process of losing information. The role of convexity and, in particular, its relation (or lack thereof) to physical processes is discussed and importance of continuity in this context is stressed.