2001/03/31 by Katrien Audenaert, K. Audenaert, Jens Eisert +8 · 5 citations
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics #Computer science #Dimension (graph theory) #Entropy (arrow of time) #Generalized relative entropy #Kullback–Leibler divergence #Mathematics #Measure (data warehouse) #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum discord #Quantum entanglement #Quantum mechanics #Quantum relative entropy #Regular polygon #Squashed entanglement #Statistical physics #Statistics #Subadditivity #quant-ph
paper · pdf · doi:10.1103/physrevlett.87.217902
published as Phys. Rev. Lett. 87 (2001) 217902 · 4 pages, 1 figure, Minor changes and stylistic improvements, conclusions and results unchanged
arxiv created 2001/09/28 · openalex publication_date 2001/11/06 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present an analytical formula for the asymptotic relative entropy of entanglement with respect to positive partial transpose states for Werner states of arbitrary dimension. We then demonstrate its validity using methods from convex optimization. This is the first case in which the asymptotic value of a subadditive entanglement measure has been calculated.