The logarithmic negativity: A full entanglement monotone that is not convex
M. B. Plenio
Abstract
It is proven that the logarithmic negativity does not increase on average under positive partial transpose preserving (PPT) operation including subselection (a set of operations that incorporate local operations and classical communication (LOCC) 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 obtained from the negativity applying a concave function and is itself not a convex quantity this result is surprising as convexity is generally considered as describing the local physical process of losing information. The role of convexity and in particular its relation (or lack thereof) to physical processes is discussed in this context.
Create a lesson
Related papers
Using topology to reveal all mutually unbiased bases in dimension six
Mateo Cárdenes Wuttig, Joseph Tindall
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
Tony Newton, Dan-Adrian German
Probing gravity at megahertz frequencies with levitated rotors
Matteo Fadel, Andrea Vinante
Optimal Holding Times for Entanglement Swapping
Van Sy Mai, Richard J. La, Abdella Battou
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route Comparison
Yunlong Liu, Yujin Tang, Miao Xu et al.
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
Nuno Batista, Gabriel Falcao, Penousal Machado