.png){kind=icon}
Return
Magic spreading in random quantum circuits
.png){kind=icon}
OA
AI
DOI：10.1038/s41467-025-57704-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. In this paper, we investigate how fast generic many-body dynamics generate magic resources under the constraints of locality and unitarity, focusing on 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.
Keywords:
ENTANGLEMENT
Journal
IF:
15.7
Papers:
9.4W
Citations:
91.2W
Organization
Cited Papers
.png){kind=icon}
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerOAAI
OAAIShareSaveShareSaveShareSaveShareSaveShareSave
View more