Abstract
AbstractOne 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 n-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.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Statistical and Nonlinear Physics,Computer Science (miscellaneous)
Reference71 articles.
1. Horodecki, R., Horodecki, P., Horodecki, M. & Horodecki, K. Quantum entanglement. Rev. Mod. Phys. 81, 865–942 (2009).
2. Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information (Cambridge University Press, 2000).
3. Jozsa, R. & Linden, N. On the role of entanglement in quantum-computational speed-up. Proc. R. Soc. Lond. A. 459, 2011–2032 (2003).
4. Vidal, G. Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91, 147902 (2003).
5. Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献