Petz map and Python's lunch
arXiv:2003.03406 · doi:10.1007/JHEP11(2020)038
Abstract
We look at the interior operator reconstruction from the point of view of Petz map and study its complexity. We show that Petz maps can be written as precursors under the condition of perfect recovery. When we have the entire boundary system its complexity is related to the volume / action of the wormhole from the bulk operator to the boundary. When we only have access to part of the system, Python's lunch appears and its restricted complexity depends exponentially on the size of the subsystem one loses access to.
arXiv commentPublished version
References in corpus (19)
- Bulk Locality and Quantum Error Correction in AdS/CFT
- Complexity and Shock Wave Geometries
- Time Evolution of Entanglement Entropy from Black Hole Interiors
- Reconstruction of Bulk Operators within the Entanglement Wedge in Gauge-Gravity Duality
- Relative entropy equals bulk relative entropy
- Holographic representation of local bulk operators
- An Apologia for Firewalls
- Diving into traversable wormholes
- State-Dependent Bulk-Boundary Maps and Black Hole Complementarity
- Quantum Computation vs. Firewalls
- Bulk locality from modular flow
- Quantum Complexity and Negative Curvature
- Switchbacks and the Bridge to Nowhere
- Efficient decoding for the Hayden-Preskill protocol
- Quantum algorithm for Petz recovery channels and pretty good measurements
- Entanglement Wedge Reconstruction using the Petz Map
- Uncomplexity and Black Hole Geometry
- Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality
- Horizons Protect Church-Turing