Tensorization of the strong data processing inequality for quantum chi-square divergences

April 13, 2019 Β· Declared Dead Β· πŸ› Quantum

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yu Cao, Jianfeng Lu arXiv ID 1904.06562 Category quant-ph: Quantum Computing Cross-listed cs.IT, math-ph Citations 4 Venue Quantum Last Checked 5 months ago
Abstract
It is well-known that any quantum channel $\mathcal{E}$ satisfies the data processing inequality (DPI), with respect to various divergences, e.g., quantum $Ο‡^2_ΞΊ$divergences and quantum relative entropy. More specifically, the data processing inequality states that the divergence between two arbitrary quantum states $ρ$ and $Οƒ$ does not increase under the action of any quantum channel $\mathcal{E}$. For a fixed channel $\mathcal{E}$ and a state $Οƒ$, the divergence between output states $\mathcal{E}(ρ)$ and $\mathcal{E}(Οƒ)$ might be strictly smaller than the divergence between input states $ρ$ and $Οƒ$, which is characterized by the strong data processing inequality (SDPI). Among various input states $ρ$, the largest value of the rate of contraction is known as the SDPI constant. An important and widely studied property for classical channels is that SDPI constants tensorize. In this paper, we extend the tensorization property to the quantum regime: we establish the tensorization of SDPIs for the quantum $Ο‡^2_{ΞΊ_{1/2}}$ divergence for arbitrary quantum channels and also for a family of $Ο‡^2_ΞΊ$ divergences (with $ΞΊ\ge ΞΊ_{1/2}$) for arbitrary quantum-classical channels.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted