Name
Abstract | ||
|---|---|---|
We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in connected graph states of N qubits there is no genuine k-qubit entanglement, 2 ≤ k ≤ N - 1, among every k qubits. These results about connected graph states naturally lead to the definition of fully multi-qubit entangled states. We also find that the connected graph states of four qubits is one but not the only one class of fully four-qubit entangled states. |
Year | Venue | Keywords |
|---|---|---|
2007 | Quantum Information & Computation | different level,graph state,graph states,k qubits,four-qubit entangled state,quantum computation,connected graph state,entanglement measure,multi-qubit entangled state,multi-qubit entanglement,connected graph,operational definition,genuine k-qubit entanglement,quantum physics |
Field | DocType | Volume |
Multipartite entanglement,Discrete mathematics,Combinatorics,W state,Quantum entanglement,Quantum mechanics,Squashed entanglement,Cluster state,Quantum teleportation,Graph state,Connectivity,Mathematics | Journal | 7 |
Issue | ISSN | Citations |
8 | 1533-7146 | 1 |
PageRank | References | Authors |
0.47 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian-Ming Cai | 1 | 1 | 1.83 |
| Zheng-Wei Zhou | 2 | 6 | 1.08 |
| Guangcan Guo | 3 | 22 | 9.33 |