Entanglement transitivity problems
arXiv:2203.08023 · doi:10.1038/s41534-022-00616-1
Abstract
One of the goals of science is to understand the relation between a whole and its parts, as exemplified by the problem of certifying the entanglement of a system from the knowledge of its reduced states. Here, we focus on a different but related question: can a collection of marginal information reveal new marginal information? We answer this affirmatively and show that (non-) entangled marginal states may exhibit (meta)transitivity of entanglement, i.e., implying that a different target marginal must be entangled. By showing that the global -qubit state compatible with certain two-qubit marginals in a tree form is unique, we prove that transitivity exists for a system involving an arbitrarily large number of qubits. We also completely characterize -- in the sense of providing both the necessary and sufficient conditions -- when (meta)transitivity can occur in a tripartite scenario when the two-qudit marginals given are either the Werner states or the isotropic states. Our numerical results suggest that in the tripartite scenario, entanglement transitivity is generic among the marginals derived from pure states.
8+10 pages, 9 figures, 2 tables. Virtually the same as the published version
References in corpus (8)
- Quantum Computing
- Entanglement detection
- Taming multiparticle entanglement
- Spin squeezing and entanglement
- Multiparticle covariance matrices and the impossibility of detecting graph state entanglement with two-particle correlations
- Three-party pure quantum states are determined by two two-party reduced states
- Unveiling quantum entanglement in many-body systems from partial information
- Optimal entanglement witnesses: a scalable data-driven approach