RECORD
Petz map and Python's lunch
High Energy Physics - Theory · Submitted 6 Mar 2020
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim 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.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
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.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We look at the interior operator reconstruction from the point of view of Petz map and study its complexity. | contribution 0.92 | 0.77 | 0.08 | unclear 0.59 |
| s1 | We show that Petz maps can be written as precursors under the condition of perfect recovery. | result 0.96 | 0.89 | 0.22 | asserted 1.00 |
| s2 | 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. | result 0.98 | 0.66 | 0.17 | asserted 1.00 |
| s3 | 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. | result 1.00 | 0.71 | 0.40 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original 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.
Human review
References
How the literature uses it
5 arXiv papers cite this in 8 sentences
Papers citing it · 7 sentences without a confident label
Cites it as background 1 paper
-
Next we review the Petz map reconstruction of code space operation from the boundary theory and its operational complexity in the presence of the Python's lunch degrees of freedom [ref] .
Python's Lunches in Jackiw-Teitelboim gravity with matter · Complexity, reconstruction and ghostly interactions · 0.95
What it cites · 23 sentences without a confident label
Uses the method or tool of 2 papers
-
In this paper we will use the following definition of Petz map from [ref] [ref] . $W$ is an operator on the code subspace. $V$ is the embedding of the code subspace into the CFT Hilbert space.
Entanglement Wedge Reconstruction using the Petz Map · Petz maps as precursors · 0.86
-
In this paper we will use the following definition of Petz map from [ref] [ref] . $W$ is an operator on the code subspace. $V$ is the embedding of the code subspace into the CFT Hilbert space.
Replica wormholes and the black hole interior · Petz maps as precursors · 0.86
Cites as support 2 papers
-
The complexity of doing this can be at least exponential in the complexity of the operator [ref] [ref] .
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality · Comparison with exterior operator reconstruction · 0.98
-
The complexity of doing this can be at least exponential in the complexity of the operator [ref] [ref] .
Horizons Protect Church-Turing · Comparison with exterior operator reconstruction · 0.98
Cites as background 7 papers
-
The complexity of such operators was studied in [ref] [ref] [ref] .
Complexity and Shock Wave Geometries · Complexity of Petz map and wormhole geometry · 0.82
-
The complexity of such operators was studied in [ref] [ref] [ref] .
Switchbacks and the Bridge to Nowhere · Complexity of Petz map and wormhole geometry · 0.82
-
The complexity of such operators was studied in [ref] [ref] [ref] .
Quantum Complexity and Negative Curvature · Complexity of Petz map and wormhole geometry · 0.82
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.