2015/01/28 by Paulo E. M. F. Mendonca, Paulo E. M. F. Mendonça, Marcelo A. Marchiolli +2 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Applied mathematics #Basis (linear algebra) #Benchmark (surveying) #Computer science #Concurrence #Density matrix #Diagonal #Heuristic #Mathematical optimization #Mathematics #Matrix (chemical analysis) #Multipartite #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Qubit #Squashed entanglement #State (computer science) #Statistical physics #W state #quant-ph
paper · pdf · doi:10.1142/s0219749915500239
published as Int. J. Quantum Inform. 13, 1550023 (2015) · 19 pages, 5 figures
arxiv created 2015/01/28 · openalex publication_date 2015/04/01 · arxiv updated 2015/05/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.