The entanglement of several graph states
Xiao-Yu Chen (陈小余)
Front. Phys. ›› 2012, Vol. 7 ›› Issue (4) : 444 -448.
The entanglement of several graph states
We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non “two-colorable” graphs. The upper bound of entanglement for five vertex ring graph state is improved to 2.9275, less than the upper bound determined by local operations and classical communication. An upper bound of entanglement is proposed based on the definition of graph state.
graph state / closest separable state / multipartite entanglement
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
Higher Education Press and Springer-Verlag Berlin Heidelberg
/
| 〈 |
|
〉 |