Papers
Topics
Authors
Recent
Search
2000 character limit reached

Magic spreading in random quantum circuits

Published 4 Jul 2024 in quant-ph and cond-mat.stat-mech | (2407.03929v2)

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.

Citations (5)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.