中国物理B ›› 2014, Vol. 23 ›› Issue (5): 50309-050309.doi: 10.1088/1674-1056/23/5/050309
郭群群, 陈小余, 王赟赟
Guo Qun-Qun (郭群群), Chen Xiao-Yu (陈小余), Wang Yun-Yun (王赟赟)
摘要: Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.
中图分类号: (Entanglement measures, witnesses, and other characterizations)