REVIEW 1 cited by
Entanglement and local information access for graph states
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 1 Pith paper
-
Relative entropy of entanglement of Haar random states
For a bipartite mixed state obtained by tracing out one subsystem of a tripartite Haar-random pure state, the relative entropy of entanglement equals log(d_A d_B / max(d_A,d_B,d_C)) plus an absolute constant, with hig...
Discussion (0). Continue with ORCID to comment.