Tensor network and (p-adic) AdS/CFT

Playing this video requires the latest flash player from Adobe.

Download link (right click and 'save-as') for playing in VLC or other compatible player.

Recording Details

PIRSA Number: 


We will describe how the reconstruction of a bulk operator can be organised systematically. With a suitable parametrisation, an analogue of the HKLL formula emerges, involving a smearing function satisfying a Klein Gordon equation in the graph. The parametrisation also allows us to read off interaction vertices, and build up loop diagrams systematically. When we interpret the Bruhat-Tits tree as a tensor network, we recover (partially) features of the p-adic AdS/CFT dictionary discussed recently in the literature.