Conditional mutual information of bipartite unitaries and scrambling
From MaRDI portal
Publication:1636714
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.
Recommendations
- Quantum information scrambling and entanglement in bipartite quantum states
- MUTUAL INFORMATION OF BIPARTITE STATES AND QUANTUM DISCORD IN TERMS OF COHERENCE INFORMATION
- Rényi generalizations of the conditional quantum mutual information
- Conditional mutual information and commutator
- A lower bound of quantum conditional mutual information
- On lower semicontinuity of the quantum conditional mutual information and its corollaries
- Conditional entropy and information in quantum systems
- Generalized conditional entropy in bipartite quantum systems
- Mutual information and Bose-Einstein condensation
- Quantum conditional mutual information and approximate Markov chains
Cites work
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- A Communication-Efficient Nonlocal Measurement With Application to Communication Complexity and Bipartite Gate Capacities
- A bound on chaos
- A continuity property of the entropy density for spin lattice systems
- A sharp continuity estimate for the von Neumann entropy
- Black holes and the butterfly effect
- Chaos in quantum channels
- Conditional mutual information and commutator
- Entanglement of the antisymmetric state
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Holographic duality from random tensor networks
- Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
- Multiboundary wormholes and holographic entanglement
- Multiple shocks
- On the capacities of bipartite hamiltonians and unitary gates
- Quantum conditional mutual information and approximate Markov chains
- Quantum information theory
- Robustness of quantum Markov chains
- Rényi generalizations of the conditional quantum mutual information
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- The Cost of Randomness for Converting a Tripartite Quantum State to be Approximately Recoverable
- The Private Classical Capacity and Quantum Capacity of a Quantum Channel
- The holographic entropy cone
- Time Reversal and Exchange Symmetries of Unitary Gate Capacities
- Universal recovery map for approximate Markov chains
Cited in
(7)- Entanglement, quantum randomness, and complexity beyond scrambling
- Quantum information scrambling and entanglement in bipartite quantum states
- A canonical purification for the entanglement wedge cross-section
- MUTUAL INFORMATION OF BIPARTITE STATES AND QUANTUM DISCORD IN TERMS OF COHERENCE INFORMATION
- Quantum mutual information and quantumness vectors for multiqubit systems
- Analysis of the conditional mutual information in ballistic and diffusive non-equilibrium steady-states
- Bit threads and holographic monogamy
This page was built for publication: Conditional mutual information of bipartite unitaries and scrambling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1636714)
