Heuristic for estimation of multiqubit genuine multipartite entanglement
arXiv:1501.07026 · doi:10.1142/S0219749915500239
Abstract
For every N-qubit density matrix written in the computational basis, an associated "X-density matrix" can be obtained by vanishing all entries out of the main- and anti-diagonals. It is very simple to compute the genuine multipartite (GM) concurrence of this associated N-qubit X-state, which, moreover, lower bounds the GM-concurrence of the original (non-X) state. In this paper, we rely on these facts to introduce and benchmark a heuristic for estimating the GM-concurrence of an arbitrary multiqubit mixed state. By explicitly considering two classes of mixed states, we illustrate that our estimates are usually very close to the standard lower bound on the GM-concurrence, being significantly easier to compute. In addition, while evaluating the performance of our proposed heuristic, we provide the first characterization of GM-entanglement in the steady states of the driven Dicke model at zero temperature.
19 pages, 5 figures
References in corpus (13)
- Entanglement detection
- Taming multiparticle entanglement
- Measure of genuine multipartite entanglement with computable lower bounds
- Detecting multiparticle entanglement of Dicke states
- Quantifying Entanglement with Witness Operators
- Characterizing the entanglement of symmetric many-particle spin-1/2 systems
- Entanglement and permutational symmetry
- Genuinely Multipartite Concurrence of N-qubit X-matrices
- Partial separability and entanglement criteria for multiqubit quantum states
- Entanglement universality of two-qubit X-states
- Multi-partite entanglement and quantum phase transition in the one-, two-, and three-dimensional transverse field Ising model
- Genuine Multipartite Entanglement in the Cluster-Ising Model
- X-matrices provide a lower bound of concurrence