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.
arXiv comment10 pages, 4 tables
References in corpus (34)
- Multi-party entanglement in graph states
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- Decoherence and multipartite entanglement
- Graphical description of the action of local Clifford transformations on graph states
- Concurrence of mixed multi-partite quantum states
- Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication
- Fast simulation of stabilizer circuits using a graph state representation
- Experimental demonstration of graph-state quantum secret sharing
- Quantum Experiments and Graphs: Multiparty States as coherent superpositions of Perfect Matchings
- On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12
- 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
- A Brief Overview of Bipartite and Multipartite Entanglement Measures
- Relative entropy of entanglement for certain multipartite mixed states
- Transforming graph states using single-qubit operations
- Optimal preparation of graph states
- Environment-induced decay of teleportation fidelity of the one-qubit state
- Entanglement in eight-qubit graph states
- Multiparticle entanglement in graph-diagonal states: Necessary and sufficient conditions for four qubits
- Hard limits on the postselectability of optical graph states
- Optimal estimation of entanglement and discord in two-qubit states
- Direct evaluation of pure graph state entanglement
- Bipartite separability and non-local quantum operations on graphs
- Lower Bound of Concurrence for Qubit Systems
- Generalized Graph States Based on Hadamard Matrices
- A lower bound of concurrence for multipartite quantum systems
- Locally inequivalent four qubit hypergraph states
- Entanglement of graph states up to 8 qubits
- Two-colorable graph states with maximal Schmidt measure
- Experimental Test of Bell inequalities with Six-Qubit Graph States
- Comment on: Multipartite entanglement in four-qubit graph state
- Determining X-chains in graph 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