8,667 research outputs found
Dynamics for holographic codes
We describe how to introduce dynamics for the holographic states and codes
introduced by Pastawski, Yoshida, Harlow and Preskill. This task requires the
definition of a continuous limit of the kinematical Hilbert space which we
argue may be achieved via the semicontinuous limit of Jones. Dynamics is then
introduced by building a unitary representation of a group known as Thompson's
group T, which is closely related to the conformal group in 1+1 dimensions. The
bulk Hilbert space is realised as a special subspace of the semicontinuous
limit Hilbert space spanned by a class of distinguished states which can be
assigned a discrete bulk geometry. The analogue of the group of large bulk
diffeomorphisms is given by a unitary representation of the Ptolemy group Pt,
on the bulk Hilbert space thus realising a toy model of the AdS/CFT
correspondence which we call the Pt/T correspondence.Comment: 40 pages (revised version submitted to journal). See video of related
talk: https://www.youtube.com/watch?v=xc2KIa2LDF
Applications of Automata and Graphs: Labeling-Operators in Hilbert Space I
We show that certain representations of graphs by operators on Hilbert space
have uses in signal processing and in symbolic dynamics. Our main result is
that graphs built on automata have fractal characteristics. We make this
precise with the use of Representation Theory and of Spectral Theory of a
certain family of Hecke operators. Let G be a directed graph. We begin by
building the graph groupoid G induced by G, and representations of G. Our main
application is to the groupoids defined from automata. By assigning weights to
the edges of a fixed graph G, we give conditions for G to acquire fractal-like
properties, and hence we can have fractaloids or G-fractals. Our standing
assumption on G is that it is locally finite and connected, and our labeling of
G is determined by the "out-degrees of vertices". From our labeling, we arrive
at a family of Hecke-type operators whose spectrum is computed. As
applications, we are able to build representations by operators on Hilbert
spaces (including the Hecke operators); and we further show that automata built
on a finite alphabet generate fractaloids. Our Hecke-type operators, or
labeling operators, come from an amalgamated free probability construction, and
we compute the corresponding amalgamated free moments. We show that the free
moments are completely determined by certain scalar-valued functions.Comment: 69 page
- …