Entanglement and local information access for graph states

Details Entanglement and local information access for graph states Entanglement and local information access for graph states

2006-09-13

arxiv.org/abs/quant-ph/0609102v3

New J. Phys. 9, 194 (2007)

Physics

Quantum Physics

8 pages, 4 figures, to appear in the special issue of New J. Phys. on measurement-based quantum information processing

Scientific paper

10.1088/1367-2630/9/6/194

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.

Affiliated with

Also associated with

No associations

Rating

Entanglement and local information access for graph states does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Entanglement and local information access for graph states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entanglement and local information access for graph states will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554747