# Strong Subadditivity Lower Bound and Quantum Channels

## TL;DR

This paper establishes a strict lower bound for the strong subadditivity of von Neumann entropy based on quantum correlations, analyzing states that saturate this bound and implications for quantum data processing.

## Contribution

It introduces a new lower bound for strong subadditivity dependent on quantum correlations and explores its implications for quantum information theory.

## Key findings

- Derived a strict lower bound for strong subadditivity
- Characterized states saturating the bound
- Linked the bound to quantum data processing inequality

## Abstract

We derive the strong subadditivity of the von Neumann entropy with a strict lower bound dependent on the distribution of quantum correlation in the system. We investigate the structure of states saturating the bounded subadditivity and explore its consequences for the quantum data processing inequality. The quantum data processing achieves a lower bound associated with the locally inaccessible information.