Conditional mutual information of bipartite unitaries and scrambling
From MaRDI portal
Publication:1636714
DOI10.1007/JHEP12(2016)145zbMath1390.81097arXiv1608.04750MaRDI QIDQ1636714
Michael Walter, Patrick Hayden, Da-wei Ding
Publication date: 12 June 2018
Published in: Journal of High Energy Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.04750
Measures of information, entropy (94A17) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (4)
Bit threads and holographic monogamy ⋮ Entanglement, quantum randomness, and complexity beyond scrambling ⋮ Quantum mutual information and quantumness vectors for multiqubit systems ⋮ A canonical purification for the entanglement wedge cross-section
Cites Work
- Black holes and the butterfly effect
- Multiple shocks
- Conditional mutual information and commutator
- Quantum conditional mutual information and approximate Markov chains
- Robustness of quantum Markov chains
- Holographic duality from random tensor networks
- Chaos in quantum channels
- A bound on chaos
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Entanglement of the antisymmetric state
- A continuity property of the entropy density for spin lattice systems
- Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
- The holographic entropy cone
- Multiboundary wormholes and holographic entanglement
- On the capacities of bipartite hamiltonians and unitary gates
- The Private Classical Capacity and Quantum Capacity of a Quantum Channel
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Time Reversal and Exchange Symmetries of Unitary Gate Capacities
- Rényi generalizations of the conditional quantum mutual information
- A Communication-Efficient Nonlocal Measurement With Application to Communication Complexity and Bipartite Gate Capacities
- A sharp continuity estimate for the von Neumann entropy
- Universal recovery map for approximate Markov chains
- The Cost of Randomness for Converting a Tripartite Quantum State to be Approximately Recoverable
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- Quantum Information Theory
This page was built for publication: Conditional mutual information of bipartite unitaries and scrambling
