Efficient mutual magic and magic capacity with matrix product states
Poetri Sonya Tarabunga, Tobias Haug
TL;DR
This work develops scalable measures of nonstabilizerness (magic) in quantum many-body systems by introducing mutual von-Neumann SREs and magic capacity, both computable efficiently for matrix-product states and via Pauli sampling for statevectors. It defines mixed-state SREs through two Pauli-string distributions, establishes a framework for mutual magic that connects quantum and classical information through Pauli sampling, and ties magic capacity to the anti-flatness of the Pauli spectrum. The authors introduce two Metropolis-Hastings Monte-Carlo schemes and a Pauli-based statevector algorithm to compute mutual 2-SRE and M1/C_M up to sizable system sizes, and validate these tools on Clifford+T circuits and ground-state transitions in TFIM and Heisenberg models. The results show mutual SREs robustly detect criticality independent of local basis and reveal distinct scaling regimes for magic capacity across phase transitions, offering practical means to study the complexity of quantum many-body dynamics and circuits.
Abstract
Stabilizer Rényi entropies (SREs) probe the non-stabilizerness (or magic) of many-body systems and quantum computers. Here, we introduce the mutual von-Neumann SRE and magic capacity, which can be efficiently computed in time $O(Nχ^3)$ for matrix product states (MPSs) of bond dimension $χ$. We find that mutual SRE characterizes the critical point of ground states of the transverse-field Ising model, independently of the chosen local basis. Then, we relate the magic capacity to the anti-flatness of the Pauli spectrum, which quantifies the complexity of computing SREs. The magic capacity characterizes transitions in the ground state of the Heisenberg and Ising model, randomness of Clifford+T circuits, and distinguishes typical and atypical states. Finally, we make progress on numerical techniques: we design two improved Monte-Carlo algorithms to compute the mutual $2$-SRE, overcoming limitations of previous approaches based on local update. We also give improved statevector simulation methods for Bell sampling and SREs with $O(8^{N/2})$ time and $O(2^N)$ memory, which we demonstrate for $24$ qubits. Our work uncovers improved approaches to study the complexity of quantum many-body systems.
