Strong subadditivity inequality for quantum entropies and four-particle entanglement

2003/07/29 by Asoka Biswas, G. S. Agarwal
Computer Science · Mathematics · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #math-ph #math.MP #quant-ph

paper · pdf · doi:10.1103/physreva.68.054303

published as Phys. Rev. A 68, 054303 (2003). · 5 pages, 3 figures, RevTeX4, submitted to PRA

arxiv created 2003/07/29 · openalex publication_date 2003/11/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The strong subadditivity inequality for a three-particle composite system is an important inequality in quantum information theory which can be studied via a four-particle entangled state. We use two three-level atoms in \ensuremathΛ configuration interacting with a two-mode cavity and the Raman adiabatic passage technique for the production of the four-particle entangled state. Using this four-particle entanglement, we study various aspects of the strong subadditivity inequality.

Citations

• Information and computation: Classical and quantum aspects
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Coherent population transfer among quantum states of atoms and molecules
• Separability Criterion for Density Matrices
• Entanglement of a Pair of Quantum Bits
• Separability of mixed states: necessary and sufficient conditions
• The role of relative entropy in quantum information theory
• Quantifying Entanglement
• Distributed Entanglement