Entanglement and entropy in multipartite systems: a useful approach
Quantum entanglement and quantum entropy are crucial concepts in the study of multipartite quantum systems. In this work, we show how the notion of concurrence vector, re-expressed in a particularly useful form, provides new insights and computational tools for the analysis of both. In particular, u...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | España |
| Recursos: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositorio: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/381886 |
| Acesso em linha: | http://hdl.handle.net/10261/381886 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85185008739&doi=10.1007%2fs11128-023-04246-0&partnerID=40&md5=ac27d16ab0f9a970e850b8c19e4bb559 |
| Access Level: | acceso abierto |
| Palavra-chave: | Concurrence Entropy Quantum entanglement |
| Resumo: | Quantum entanglement and quantum entropy are crucial concepts in the study of multipartite quantum systems. In this work, we show how the notion of concurrence vector, re-expressed in a particularly useful form, provides new insights and computational tools for the analysis of both. In particular, using this approach for a general multipartite pure state, one can easily prove known relations in an easy way and to build up new relations between the concurrences associated with the different bipartitions. The approach is also useful to derive sufficient conditions for genuine entanglement in generic multipartite systems that are computable in polynomial time. From an entropy-of-entanglement perspective, the approach is powerful to prove properties of the Tsallis-2 entropy, such as the subadditivity, and to derive new ones, e.g., a modified version of the strong subadditivity which is always fulfilled; thanks to the purification theorem these results hold for any multipartite state, whether pure or mixed. © The Author(s) 2024. |
|---|