Quantum Markov chains, sufficiency of quantum channels, and Renyi information measures
January 22, 2015 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Nilanjana Datta, Mark M. Wilde
arXiv ID
1501.05636
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT,
math-ph
Citations
22
Venue
arXiv.org
Last Checked
5 months ago
Abstract
A short quantum Markov chain is a tripartite state $Ο_{ABC}$ such that system $A$ can be recovered perfectly by acting on system $C$ of the reduced state $Ο_{BC}$. Such states have conditional mutual information $I(A;B|C)$ equal to zero and are the only states with this property. A quantum channel $\mathcal{N}$ is sufficient for two states $Ο$ and $Ο$ if there exists a recovery channel using which one can perfectly recover $Ο$ from $\mathcal{N}(Ο)$ and $Ο$ from $\mathcal{N}(Ο)$. The relative entropy difference $D(Ο\VertΟ)-D(\mathcal{N}(Ο)\Vert\mathcal{N}(Ο))$ is equal to zero if and only if $\mathcal{N}$ is sufficient for $Ο$ and $Ο$. In this paper, we show that these properties extend to Renyi generalizations of these information measures which were proposed in [Berta et al., J. Math. Phys. 56, 022205, (2015)] and [Seshadreesan et al., J. Phys. A 48, 395303, (2015)], thus providing an alternate characterization of short quantum Markov chains and sufficient quantum channels. These results give further support to these quantities as being legitimate Renyi generalizations of the conditional mutual information and the relative entropy difference. Along the way, we solve some open questions of Ruskai and Zhang, regarding the trace of particular matrices that arise in the study of monotonicity of relative entropy under quantum operations and strong subadditivity of the von Neumann entropy.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
π»
Ghosted
Quantum Recommendation Systems
R.I.P.
π»
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted