Magic spreading in random quantum circuits

TL;DR

This paper investigates how magic, a quantum resource necessary for universal quantum computing, spreads in random unitary circuits, revealing rapid equilibration and distinct behavior from entanglement spreading in chaotic many-body systems.

Contribution

It introduces scalable measures of magic, enabling analysis of magic spreading in large systems up to 1024 qudits, and uncovers that magic equilibrates logarithmically fast, differing from entanglement dynamics.

Findings

Magic equilibrates on logarithmic timescales with system size.

Magic spreading is qualitatively different from entanglement spreading.

Scalable measures allow analysis of large quantum systems.

Abstract

Magic is the resource that quantifies the amount of beyond-Clifford operations necessary for universal quantum computing. It bounds the cost of classically simulating quantum systems via stabilizer circuits central to quantum error correction and computation. How rapidly do generic many-body dynamics generate magic resources under the constraints of locality and unitarity? We address this central question by exploring magic spreading in brick-wall random unitary circuits. We explore scalable magic measures intimately connected to the algebraic structure of the Clifford group. These metrics enable the investigation of the spreading of magic for system sizes of up to $N=1024$ qudits, surpassing the previous state-of-the-art, which was restricted to about a dozen qudits. We demonstrate that magic resources equilibrate on timescales logarithmic in the system size, akin to anti-concentration and Hilbert space delocalization phenomena, but qualitatively different from the spreading of entanglement entropy. As random circuits are minimal models for chaotic dynamics, we conjecture that our findings describe the phenomenology of magic resources growth in a broad class of chaotic many-body systems.