2006/09/30 by Damian Markham, Akimasa Miyake, S. Virmani +1 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Cluster state #Combinatorics #Discrete mathematics #LOCC #Mathematics #Multipartite #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #Quantum discord #Quantum entanglement #Quantum mechanics #Separable space #Separable state #Squashed entanglement #quant-ph
paper · pdf · doi:10.1088/1367-2630/9/6/194
published as New J. Phys. 9, 194 (2007) · 8 pages, 4 figures, to appear in the special issue of New J. Phys. on measurement-based quantum information processing
openalex publication_date 2007/06/29 · arxiv created 2007/07/04 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d -dimensional cluster states ( d = 1,2,3), the Greenberger–Horne–Zeilinger states, and some related mixed states. The entanglement measures that we consider are continuous, 'distance from separable states' measures, including the relative entropy, the so-called geometric measure, and robustness of entanglement. We also show that for our class of graph states these entanglement values give an operational interpretation as the maximal number of graph states distinguishable by local operations and classical communication (LOCC), as well as supplying a tight bound on the fixed letter classical capacity under LOCC decoding.