Quantum magic dynamics in random circuits
read the original abstract
Magic refers to the degree of "quantumness" in a system that cannot be fully described by stabilizer states and Clifford operations alone. In quantum computing, stabilizer states and Clifford operations can be efficiently simulated on a classical computer, even though they may appear complicated from the perspective of entanglement. In this sense, magic is a crucial resource for unlocking the unique computational power of quantum computers to address problems that are classically intractable. Magic can be quantified by measures such as Wigner negativity and mana that satisfy fundamental properties such as monotonicity under Clifford operations. In this paper, we generalize the statistical mechanical mapping methods of random circuits to the calculation of Renyi Wigner negativity and mana. Based on this, we find: (1) a precise formula describing the competition between magic and entanglement in many-body states prepared under Haar random circuits; (2) a formula describing the the spreading and scrambling of magic in states evolved under random Clifford circuits; (3) a quantitative description of magic "squeezing" and "teleportation" under measurements. Finally, we comment on the relation between coherent information and magic.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Nonstabilizerness Mpemba Effects
In U(1)-symmetric random circuits, initial states with lower stabilizer Rényi entropy generate nonstabilizerness faster than those with higher entropy, with the effect also depending on spatial charge structure and ex...
-
Computing quantum magic of state vectors
Efficient algorithms compute stabilizer Rényi entropy and mana for quantum states from vectors at O(N d^{2N}) cost using fast Hadamard transform, with open-source implementation.
-
Exponentially Accelerated Sampling of Pauli Strings for Nonstabilizerness
A sampling method combining fast Walsh-Hadamard transform and Clifford-preconditioned Monte Carlo reduces Pauli-string sampling cost from O(2^N) to O(N) with sample count independent of N for stabilizer Rényi entropie...
-
Certifying localizable quantum properties with constant sample complexity
A new framework certifies global quantum properties including multipartite entanglement, circuit complexity, and quantum magic on small subsystems with constant sample complexity via local Pauli measurements.
-
Universal Non-stabilizerness Dynamics Across Quantum Phase Transitions
Stabilizer Rényi entropies and Pauli spectrum cumulants show universal power-law scaling with driving rate in slow processes across quantum phase transitions, with the logarithmic Pauli spectrum asymptotically Gaussia...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.