← all papers · overview

Efficient Entanglement Measure for Graph States

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.

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).