Nonlocal Magic Generation and Information Scrambling in Noisy Clifford Circuits

2025/09/24 by Emanuel Dallas, Dallas, Emanuel, Paolo Zanardi +1 · 1 citation
Computer Science · #Chaos-based Image/Signal Encryption #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata

paper · pdf · doi:10.48550/arxiv.2509.20566

openalex publication_date 2025/09/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this work, we investigate the average information scrambling and nonlocal magic generation properties of random Clifford encoding-decoding circuits perturbed by local noise. We quantify these with the bipartite algebraic out-of-time order correlator (A-OTOC) and average Pauli-entangling power (APEP) respectively. Using recent advances in the representation theory of the Clifford group, we compute both quantities' averages in the limit that the circuits become infinitely large. We observe that both display a ``butterfly effect" whereby noise occurring on finitely many qubits leads to macroscopic information scrambling and nonlocal magic generating power. Finally, we numerically study the relationship between the magic capacity, an operator-level magic monotone, of the noise channel and the APEP of the resulting circuit, which may provide insight for designing efficient nonlocal magic factories.

Citations

• A complete theory of the Clifford commutant
• An Exact Link between Nonlocal Nonstabilizerness and Operator Entanglement
• Quantum Non-Local Nonstabilizerness
• Bridging Entanglement and Magic Resources within Operator Space
• Experimental demonstration of logical magic state distillation
• Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures
• A Butterfly Effect in Encoding-Decoding Quantum Circuits
• Quantum Error Correction of Qudits Beyond Break-even
• Quantum error correction below the surface code threshold
• Magic phase transition and non-local complexity in generalized W State
• Non-trivial Area Operators Require Non-local Magic
• Good Quantum LDPC Codes with Linear Time Decoders
• Quantum Tanner codes
• Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
• Balanced Product Quantum Codes
• Quantum Computing in the NISQ era and beyond
• The Clifford group fails gracefully to be a unitary 4-design
• An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
• The Heisenberg Representation of Quantum Computers
• Fault-tolerant quantum computation by anyons
• Stabilizer Codes and Quantum Error Correction

Cited by

• Noisy Monitored Quantum Circuits

Related

• Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
• Quantum magic dynamics in random circuits
• Spectral Properties Versus Magic Generation in T-doped Random Clifford Circuits
• Magic spreading under unitary Clifford dynamics
• Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States