The branching time in SYK-like models is defined as the average
time separation of rungs when computing the out-of-time-order
correlator. We argue that a parametrically large branching time is
necessary to obtain holographic models with non-trivial...
Recently, a new quantum information measure called pseudo
entropy was introduced as a generalization of entanglement entropy
to quantify quantum correlation between initial and final states in
a time-dependent system. In this talk, I will examine...
The connections between disordered quantum systems (specifically
the SYK model), ensemble averaging, and two-dimensional dilaton
gravity underlie much of the recent progress on holography and
quantum gravity. I will discuss simple disordered systems...
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...
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...
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...
