Talks

Quantum computers can only offer a computational advantage when they have sufficiently many qubits operating with sufficiently small error rates. In this talk, I will show how both these requirements can be practically characterized by variants of randomized benchmarking protocols. I will first show that a simple modification to protocols based on randomized benchmarking allows multiplicative-precision estimates of error rates.  I will then outline a new protocol for estimating the fidelity of arbitrarily large quantum systems using only single-qubit randomizing gates.

We  examine 1D spin-chains evolving under random local unitary circuits and prove a number of exact results on the behavior of out-of-time-ordered commutators (OTOCs), and entanglement growth. These results follow from the observation that the spreading of operators in random circuits is described by a ``hydrodynamical'' equation of motion. In this hydrodynamic picture quantum information travels in a front with a `butterfly velocity' $v_{\text{B}}$ that is smaller than the light cone velocity of the system, while the front itself broadens diffusively in time. The OTOC increases sharply after the arrival of the light cone, but we do \emph{not} observe a prolonged exponential regime of the form $\sim e^{\lambda_\text{L}(t-x/v)}$ for a fixed Lyapunov exponent $\lambda_\text{L}$, in disagreement with the existing QFT literature on OTOCs. We find that the diffusive broadening of the front has important consequences for entanglement growth, leading to an entanglement velocity that can be significantly smaller than the butterfly velocity. We conjecture that the hydrodynamical description applies to more generic ergodic systems and support this with numerical simulations. When the circuits are constrained so as to conserve a U$(1)$ charge, we show that the OTOC acquires a diffusively decaying component.