The continuous min flow-max cut principle is used to
reformulate the 'complexity=volume' conjecture using Lorentzian
flows. Conceptually, discretized flows are interpreted in terms of
`gatelines', one-dimensional time-like curves that connect...
Although it is known that AdS/CFT as a quantum erasure
correction code is only approximate, there is still much to learn
about the precise bulk physical consequences of deviating from
exact erasure correction codes. In this talk, I will take...
Computing the entropy of probability distributions and quantum
states is a fundamental task in information processing. In this
talk I'll discuss recent work with Matty Hoban (arXiv:2002.12814)
in which we show that estimating the entropy of quantum...
The spread of a matrix is defined as the diameter of its
spectrum. This quantity has been well-studied for general matrices
and has recently grown in popularity for the specific case of the
adjacency matrix of a graph. Most notably, Gregory...
The ABNNR encoding is a classical encoding scheme that amplifies
the distance of an error correcting code. The encoding takes an
error correcting code with a small distance and constructs an error
correcting code with distance approaching one, by...
We introduce a theoretical framework to study experimental
physics using quantum complexity theory. This allows us to address:
what is the computational complexity of an experiment? For several
'model' experiments, we prove that there is an...
We take the tensor network describing explicit p-adic CFT
partition functions proposed in 1902.01411, and consider boundary
conditions of the network describing a deformed Bruhat-Tits (BT)
tree geometry. We demonstrate that this geometry satisfies...
