Nonarchimedean holographic entropy from networks of perfect tensors
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We consider a class of holographic quantum error-correcting codes, built from perfect tensors in network configurations dual to Bruhat-Tits trees and their quotients by Schottky groups corresponding to BTZ black holes. The resulting holographic states can be constructed in the limit of infinite network size. We obtain a p-adic version of entropy which obeys a Ryu-Takayanagi like formula for bipartite entanglement of connected or disconnected regions, in both genus-zero and genus-one p-adic backgrounds, along with a Bekenstein-Hawking-type formula for black hole entropy. We prove entropy inequalities obeyed by such tensor networks, such as subadditivity, strong subadditivity, and monogamy of mutual information (which is always saturated). In addition, we construct infinite classes of perfect tensors directly from semiclassical states in phase spaces over finite fields, generalizing the CRSS algorithm, and give Hamiltonians exhibiting these as vacua.