Speaker
Description
Black holes are conjectured to be the fastest scramblers in nature, and Hayden and Preskill showed that information thrown into an old black hole can be recovered from only a few qubits of its radiation. We aim to demonstrate these ideas computationally on small quantum circuits simulated in Qiskit. Scrambling is quantified with out-of-time-order correlators (OTOCs), $F(t)=\langle W^\dagger(t)V^\dagger W(t)V\rangle$, whose decay signals the spreading of a local operator. We compare chaotic random circuits with integrable (non-scrambling) circuits, tracking OTOC decay with circuit depth and qubit number. We then implement a minimal Hayden–Preskill teleportation protocol, using the recovery fidelity of a message qubit from a subset of output qubits as an operational test of scrambling. We expect fast OTOC decay and high recovery fidelity only for scrambling dynamics, and will examine how hardware noise degrades these signatures.
| Nature of work | Computational |
|---|