Entanglement and local information access for graph states

Shashank Virmani

Research output: Contribution to journalArticle

46 Citations (Scopus)

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.
Original languageEnglish
JournalNew Journal of Physics
Volume9
Issue number194
DOIs
Publication statusPublished - Jun 2007

Fingerprint

communication
supplying
decoding
entropy

Keywords

  • entanglement
  • local information access
  • graph states
  • multipartite entanglement measures
  • d-dimensional cluster states (d = 1
  • 2
  • 3)
  • Greenberger-Horne-Zeilinger states
  • continuous
  • relative entropy
  • geometric measure

Cite this

@article{04dd31487ae844d39fa6f3d3cb55cad7,
title = "Entanglement and local information access for graph states",
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.",
keywords = "entanglement, local information access, graph states, multipartite entanglement measures, d-dimensional cluster states (d = 1, 2, 3), Greenberger-Horne-Zeilinger states, continuous, relative entropy, geometric measure",
author = "Shashank Virmani",
year = "2007",
month = "6",
doi = "10.1088/1367-2630/9/6/194",
language = "English",
volume = "9",
journal = "New Journal of Physics",
issn = "1367-2630",
number = "194",

}

Entanglement and local information access for graph states. / Virmani, Shashank.

In: New Journal of Physics, Vol. 9, No. 194, 06.2007.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Entanglement and local information access for graph states

AU - Virmani, Shashank

PY - 2007/6

Y1 - 2007/6

N2 - 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.

AB - 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.

KW - entanglement

KW - local information access

KW - graph states

KW - multipartite entanglement measures

KW - d-dimensional cluster states (d = 1

KW - 2

KW - 3)

KW - Greenberger-Horne-Zeilinger states

KW - continuous

KW - relative entropy

KW - geometric measure

UR - http://suprimo.lib.strath.ac.uk/primo_library/libweb/action/display.do?ct=display&doc=SUSFX954926913666&indx=1&frbg=&dum=true&vid=SUVU01&vl(54032236UI0)=lsr02&srt=rank&indx=1&vl(69186824UI1)=all_items&dstmp=1269022481915&tab=local&ct=search&scp.scps=scope

UR - http://dx.doi.org/10.1088/1367-2630/9/6/194

U2 - 10.1088/1367-2630/9/6/194

DO - 10.1088/1367-2630/9/6/194

M3 - Article

VL - 9

JO - New Journal of Physics

JF - New Journal of Physics

SN - 1367-2630

IS - 194

ER -