2020/09/30 by Gilad Gour, Carlo Maria Scandolo · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Amplitude damping channel #Bipartite graph #Discrete mathematics #Eigenvalues and eigenvectors #Logarithm #Mathematical analysis #Mathematics #Negativity effect #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum discord #Quantum entanglement #Quantum mechanics #Squashed entanglement #Statistical physics #Transpose #quant-ph
paper · pdf · doi:10.1103/physrevlett.125.180505
published as Phys. Rev. Lett. 125 (18), 180505 (2020) · 6+1 pages, 3 figures. Short version of arXiv:1907.02552, close to published version
arxiv created 2020/10/30 · openalex publication_date 2020/10/30 · arxiv updated 2020/11/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Unlike the entanglement of quantum states, very little is known about the entanglement of bipartite channels, called dynamical entanglement. Here we work with the partial transpose of a superchannel, and use it to define computable measures of dynamical entanglement, such as the negativity. We show that a version of it, the max-logarithmic negativity, represents the exact asymptotic dynamical entanglement cost. We discover a family of dynamical entanglement measures that provide necessary and sufficient conditions for bipartite channel simulation under local operations and classical communication and under operations with positive partial transpose.