Efficient Entanglement Measure for Graph States
Saeed Haddadi, Ahmad Akhound, Mohammad Ali Chaman Motlagh
TL;DR
This paper compares entanglement measures for graph states up to seven qubits, finding that generalized concurrence is more efficient than geometric entanglement for quantifying multipartite entanglement.
Contribution
It introduces a comparative analysis of entanglement measures, highlighting the efficiency of generalized concurrence over geometric entanglement in multi-qubit graph states.
Findings
Generalized concurrence outperforms geometric entanglement in efficiency.
Analysis conducted on graph states up to seven qubits.
Provides insights into suitable entanglement measures for multi-qubit systems.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.