Efficient Entanglement Measure for Graph States

Efficient Entanglement Measure for Graph States

In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure (GCM) is more efficient than geometric entanglement measure (GEM) for measuring entanglement quantity in the multi-qubit graph states.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of theoretical physics 2019-10, Vol.58 (10), p.3406-3413
Hauptverfasser: Haddadi, Saeed, Akhound, Ahmad, Chaman Motlagh, Mohammad Ali
Format: Artikel
Sprache:eng
Schlagworte:
Elementary Particles
Mathematical and Computational Physics
Physics
Physics and Astronomy
Quantum entanglement
Quantum Field Theory
Quantum Physics
Theoretical
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure (GCM) is more efficient than geometric entanglement measure (GEM) for measuring entanglement quantity in the multi-qubit graph states.
ISSN:0020-7748
1572-9575
DOI:10.1007/s10773-019-04214-4