中国物理B ›› 2014, Vol. 23 ›› Issue (5): 50309-050309.doi: 10.1088/1674-1056/23/5/050309

• GENERAL • 上一篇    下一篇

Measures of genuine multipartite entanglement for graph states

郭群群, 陈小余, 王赟赟   

  1. College of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou 310018, China
  • 收稿日期:2013-06-25 修回日期:2013-10-09 出版日期:2014-05-15 发布日期:2014-05-15
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 60972071 and 11375152).

Measures of genuine multipartite entanglement for graph states

Guo Qun-Qun (郭群群), Chen Xiao-Yu (陈小余), Wang Yun-Yun (王赟赟)   

  1. College of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou 310018, China
  • Received:2013-06-25 Revised:2013-10-09 Online:2014-05-15 Published:2014-05-15
  • Contact: Chen Xiao-Yu E-mail:xychen@zjgsu.edu.cn
  • About author:03.67.Mn; 03.65.Ud
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 60972071 and 11375152).

PDF (PC)

406

赞

摘要： 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.

关键词: genuine entanglement, graph state, iterative algorithm

Abstract: 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.

Key words: genuine entanglement, graph state, iterative algorithm

中图分类号:  (Entanglement measures, witnesses, and other characterizations)

  • 03.67.Mn
03.65.Ud (Entanglement and quantum nonlocality)