REVIEW 4 cited by
Toy Models of Holographic Duality between local Hamiltonians
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Toy Models of Holographic Duality between local Hamiltonians
read the original abstract
Holographic quantum error correcting codes (HQECC) have been proposed as toy models for the AdS/CFT correspondence, and exhibit many of the features of the duality. HQECC give a mapping of states and observables. However, they do not map local bulk Hamiltonians to local Hamiltonians on the boundary. In this work, we combine HQECC with Hamiltonian simulation theory to construct a bulk-boundary mapping between local Hamiltonians, whilst retaining all the features of the HQECC duality. This allows us to construct a duality between models, encompassing the relationship between bulk and boundary energy scales and time dynamics. It also allows us to construct a map in the reverse direction: from local boundary Hamiltonians to the corresponding local Hamiltonian in the bulk. Under this boundary-to-bulk mapping, the bulk geometry emerges as an approximate, low-energy, effective theory living in the code-space of an (approximate) HQECC on the boundary. At higher energy scales, this emergent bulk geometry is modified in a way that matches the toy models of black holes proposed previously for HQECC. Moreover, the duality on the level of dynamics shows how these toy-model black holes can form dynamically.
Forward citations
Cited by 4 Pith papers
-
Multi-entropy in random tensor networks
For n=2, Rényi multi-entropies in RTNs are determined by minimal multiway cuts; the minimal multiway cut conjecture fails for integer n>2 with explicit counterexamples.
-
Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks
Twirled perfect tensor networks are introduced as a class satisfying computational covariance, bounding complexity by the Python's Lunch Conjecture exponent, and combining holographic features of perfect and random te...
-
Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks
Twirled perfect tensor networks achieve computational covariance, bound complexity by the PLC, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.
-
Rethinking quantum information in gravity and fields
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.