Efficient Entanglement Measure for Graph States
arXiv:1809.02019 · doi:10.1007/s10773-019-04214-4
Abstract
In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure is more efficient than geometric entanglement measure for measuring entanglement quantity in the multi-qubit graph states.
10 pages, 4 tables
References in corpus (13)
- Multi-party entanglement in graph states
- Fast simulation of stabilizer circuits using a graph state representation
- Experimental demonstration of graph-state quantum secret sharing
- Entanglement and nonclassical properties of hypergraph states
- Entanglement and local information access for graph states
- Quantum Experiments and Graphs III: High-Dimensional and Multi-Particle Entanglement
- Estimation on geometric measure of quantum coherence
- Optimal preparation of graph states
- Relative entropy of entanglement for certain multipartite mixed states
- Optimal estimation of entanglement and discord in two-qubit states
- Direct evaluation of pure graph state entanglement
- A lower bound of concurrence for multipartite quantum systems
- Locally inequivalent four qubit hypergraph states
Cited by in corpus (5)
- Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer
- Phase Squeezing of Quantum Hypergraph States
- A brief review of Scott measure as a multipartite entanglement criterion
- Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
- Studies of properties of bipartite graphs with quantum programming