Quantum Markov chains and logarithmic trace inequalities
METADATA ONLY
Loading...
Author / Producer
Date
2017
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
A Markov chain is a tripartite quantum state ρ ABC where there exists a recovery map R B→BC such that ρ ABC = R B→BC (ρ AB ). More generally, an approximate Markov chain ρ ABC is a state whose distance to the closest recovered state R B→BC (ρ AB ) is small. Recently it has been shown that this distance can be bounded from above by the conditional mutual information I(A : C|B) ρ of the state. We improve on this connection by deriving the first bound that is tight in the commutative case and features an explicit recovery map that only depends on the reduced state pBC. The key tool in our proof is a multivariate extension of the Golden-Thompson inequality, which allows us to extend logarithmic trace inequalities from two to arbitrarily many matrices.
Permanent link
Publication status
published
External links
Editor
Book title
2017 IEEE International Symposium on Information Theory (ISIT)
Journal / series
Volume
Pages / Article No.
1988 - 1992
Publisher
IEEE
Event
2017 IEEE International Symposium on Information Theory (ISIT 2017)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
03781 - Renner, Renato / Renner, Renato