The provided API key is invalid.

Special Joint CMTC/MCFP Colloquium

Thu, Apr 19, 2018 4:00 pm - 5:30 pm
PSC 3150


Speaker: Andy Lucas

Speaker Institution: Stanford University

Title: Fast scrambling on sparse graphs

Abstract: The fast scrambling conjecture is that quantum many-body systems with few-body interactions can scramble information among N degrees of freedom in a time that grows no slower than log(N). I will review this conjecture and some simple cartoons which justify it. By studying 2-local Hamiltonians with general connectivity graphs, I will then clarify why arbitrarily fast information scrambling is generally impossible. Using a mix of formal perspectives and simple models of chaotic quantum dynamics including random unitary circuits and generalized Sachdev-Ye-Kitaev models, I will describe both the spread of entanglement between initially unentangled subsystems and the growth of (out-of-time-ordered) correlation functions. On many graphs, I will prove the fast scrambling conjecture for 2-local Hamiltonians and give a simple graph-theoretic diagnostic for determining whether a given graph can host a fast scrambler. I will propose new ways to look for fast scramblers in cold atom experiments.

Upcoming Events

5 Mar
Date Fri, Mar 5, 2021 12:00 pm - 1:00 pm
5 Mar
Materials Science Engineering Seminar
Fri, Mar 5, 2021 1:00 pm - 2:00 pm
5 Mar
Online Nuclear Theory Seminar
Fri, Mar 5, 2021 2:00 pm - 3:30 pm
8 Mar
JQI Seminar (Virtually)
Mon, Mar 8, 2021 11:00 am - 12:00 pm
8 Mar
Online Biophysics Seminar
Mon, Mar 8, 2021 4:00 pm - 5:00 pm