Mischa Woods: Applications of recoverability in quantum information

Subscribers:
351,000
Published on ● Video Link: https://www.youtube.com/watch?v=DzGY9ZgAA64



Category:
Guide
Duration: 29:35
337 views
4


"The fact that the quantum relative entropy $D(\cdot \| \cdot)$ is non-increasing with respect to quantum channels lies at the core of many optimality theorems in quantum information theory. In 1986 Petz showed that for every quantum channel $\mathcal{M}(\cdot)$, the relative entropy is constant for a particular $\rho$ and $\sigma$, $D(\mathcal{M}(\rho) \| \mathcal{M}(\sigma))= D(\rho \| \sigma)$, iff both
$\rho$ and $\sigma$
can be recovered perfectly; namely iff $\tilde{\mathcal{M}}(\mathcal{M}(\rho))=\rho$ and $\tilde {\mathcal{M}}(\mathcal{M}(\sigma))=\sigma$, where $\tilde{\mathcal{M}} (\cdot):=\sigma^{1/2} \mathcal{M}^\dagger \left(\mathcal{M}(\sigma)^{-1/2} (\cdot) \mathcal{M}(\sigma)^{-1/2}\right) \sigma^{1/2}$
is now known as the Petz recovery map (a completely positive trace non-increasing map). Later, Li and Winter conjectured that this could be strengthened to include approximate recovery: $D(\rho \| \sigma)- D(\mathcal{M}(\rho) \| \mathcal{M}(\sigma)) \geq D(\rho\|\bar{\mathcal{M}} ( \mathcal{M}(\sigma)))$, for a recovery map $\bar{\mathcal{M}}$, which enjoys the nice properties that the Petz recovery map possesses \cite{winter-li}.
Li and Winter knew that such a bound is false with $\bar{\mathcal{M}}$ taken as the Petz recovery map, but they conjectured that it might hold for some other natural recovery map.
However, for particular applications for which the map $\mathcal{M}(\cdot)$ has more structure, we have proven that the bound, or variations of it, hold. As a consequence, these bounds have now found applications in a variety of physical contexts in quantum information theory and physics, including thermodynamics, uncertainty relations, resource theories of asymmetry, approximate cloning, and dynamical maps."




Other Videos By Microsoft Research


2017-01-31Kai-Min Chung: General randomness amplification with non-signaling security
2017-01-31Anand Natarajan: Robust self-testing of many qubit states
2017-01-31Andras Gilyen: On preparing ground states of gapped Hamiltonians
2017-01-31David Gosset: Complexity of quantum impurity problems
2017-01-31Thomas Vidick: Rigorous RG algorithms and area laws for low energy eigenstates in 1D
2017-01-31Giulio Chiribella: Optimal compression for identically prepared qubit states
2017-01-31James Lee: Spectrahedral lifts and quantum learning
2017-01-31Optimal Hamiltonian simulation by quantum signal processing
2017-01-31Shalev Ben-David: Sculpting quantum speedups
2017-01-31David Sutter: Multivariate trace inequalities
2017-01-31Mischa Woods: Applications of recoverability in quantum information
2017-01-31Anand Natarajan: Limitations of semidefinite programs for separable states and entangled games
2017-01-31A parallel repetition theorem for all entangled games
2017-01-31Guillaume Dauphinais: Fault-tolerant error correction for non-abelian anyons
2017-01-31Dominic Williamson: Anyons and matrix product operator algebras
2017-01-31Jonathan Oppenheim: From quantum thermodynamical identities to a second law equality
2017-01-31Operator scaling and applications
2017-01-31Xin Wang: Asymptotic entanglement manipulation under PPT operations: new SDP bounds&irreversibility
2017-01-31Srinivasan Arunachalam: Optimal quantum sample complexity of learning algorithms
2017-01-311. Catalytic Decoupling 2. Deconstruction and conditional erasure of quantum correlations
2017-01-31A complete characterization of unitary quantum space



Tags:
microsoft research