Search 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. 

Low-energy states of quantum spin liquids are thought to involve partons living in a gauge-field background. We study the spectrum of Majorana fermions of the Kitaev honeycomb model on spherical clusters. The gauge field endows the partons with half-integer orbital angular momenta. As a consequence, the multiplicities do not reflect the point-group symmetries of the cluster, but rather its projective symmetries, operations combining physical and gauge transformations. The projective symmetry group of the ground state is the double cover of the point group.

States of a CFT's subregions are consistent with a given global state. For a holographic CFT, this amounts to different entanglement wedges being patches of the same geometry. What relations between them make this possible?

I will propose a Berry experiment to study this question. Berry introduced a connection to describe transformations induced by adiabatically varying Hamiltonians. I will introduce a connection to study how the zero modes of a modular Hamiltonian are affected by varying the CFT subregion that supplies it. I will explain the geometric meaning of modular Berry phases in the bulk and describe an experiment to measure them which involves observers moving with adiabatically varying accelerations. 

In classical General Relativity (GR), an observer falling into an astrophysical black hole (BH) is not expected to experience anything dramatic as she crosses the event horizon. However, tentative resolutions to problems in quantum gravity, such as the cosmological constant problem or the black hole information paradox, invoke significant departures from classicality in the vicinity of the horizon. I outline theoretical and phenomenological arguments for these departures. I will then discuss the tentative observational evidence for Planck-scale structure near BH horizons, seen as "echoes" in LIGO gravitational wave observations,  which has now been found by three independent groups. Finally, I present preliminary analysis which strongly suggest formation of a highly spinning black hole within 0.5 second of GW170817 binary neutron star merger, based on prominent echoes in the LIGO strain data.