Conditional Mutual Information of Bipartite Unitaries and Scrambling
arXiv:1608.04750 · doi:10.1007/JHEP12(2016)145
Abstract
One way to diagnose chaos in bipartite unitary channels is via the tripartite information of the corresponding Choi state, which for certain choices of the subsystems reduces to the negative conditional mutual information (CMI). We study this quantity from a quantum information-theoretic perspective to clarify its role in diagnosing scrambling. When the CMI is zero, we find that the channel has a special normal form consisting of local channels between individual inputs and outputs. However, we find that arbitrarily low CMI does not imply arbitrary proximity to a channel of this form, although it does imply a type of approximate recoverability of one of the inputs. When the CMI is maximal, we find that the residual channel from an individual input to an individual output is completely depolarizing when the other input is maximally mixed. However, we again find that this result is not robust. We also extend some of these results to the multipartite case and to the case of Haar-random pure input states. Finally, we look at the relationship between tripartite information and its Renyi-2 version which is directly related to out-of-time-order correlation functions. In particular, we demonstrate an arbitrarily large gap between the two quantities.
32 pages, 3 figures
References in corpus (8)
- Black holes as mirrors: quantum information in random subsystems
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- Quantum secret sharing with qudit graph states
- Renyi generalizations of the conditional quantum mutual information
- Interferometric Approach to Probing Fast Scrambling
- Highly Entangled States With Almost No Secrecy
- Lower bounds for communication capacities of two-qudit unitary operations
Cited by in corpus (10)
- On the practical usefulness of the Hardware Efficient Ansatz
- Transitions in Entanglement Complexity in Random Circuits
- Learning efficient decoders for quasi-chaotic quantum scramblers
- Random Matrix Theory of the Isospectral twirling
- Unscrambling Quantum Information with Clifford decoders
- Retrieving information from a black hole using quantum machine learning
- Quantum scrambling via accessible tripartite information
- Clustering of conditional mutual information and quantum Markov structure at arbitrary temperatures
- Classical and quantum parts of conditional mutual information for open quantum systems
- Squashed quantum non-Markovianity: a measure of genuine quantum non-Markovianity in states