arXiv:2609.40032
Pauli instability in arbitrary states: detecting magic in physical correlators
Tanner Jackson, Alexey Milekhin
Abstract
Measures of non-stabilizerness (``magic'') of a quantum evolution quantify how hard it is to simulate on a classical computer. A natural question is how to extract information about magic from physical correlators, for example at finite temperature or in the ground state. In this paper we show how to measure magic using out-of-time-order correlators evaluated in an arbitrary state. For every full-rank state, and in particular for every Gibbs state, the resulting quantity vanishes if and only if the evolution is Clifford. We establish its basic properties, relate it to the stabilizer entropy of the Choi state, and prove that, even with a single fixed probe operator, it gives a lower bound on the number of $T$ gates needed to implement the dynamics in any circuit architecture.
AI Summary
The paper asks whether non-Clifford dynamics can be diagnosed through correlators evaluated in physical states rather than infinite-temperature traces. It extends Pauli instability to $\mathcal I_\alpha(\rho,U)=-\log\mathbb E_{A,B}|\operatorname{Tr}[\rho A(t)BA(t)B]|^\alpha$, averaging over Pauli strings. For every full-rank state, including finite-temperature Gibbs states, this quantity vanishes exactly when $U$ is Clifford. It is nonnegative, additive on product states and evolutions, and Clifford-covariant. Faithfulness follows from the equality condition in state-weighted Cauchy–Schwarz and the separation of Pauli strings by commutation relations. At $\alpha=2$, Pauli-character orthogonality evaluates the $B$ average as a weighted sum of squared state-dependent two-point functions. At infinite temperature, the result equals the stabilizer 2-Rényi entropy of the Choi state. Bounding evolved-Pauli support establishes $\mathcal I_2\le r\log2\le k\log2$ for arbitrary Clifford+$T$ circuits, where $r$ is the binary rank of the $k$ rotation axes. A four-copy projector argument sharpens the infinite-temperature bound to $k\log(4/3)$, attained by parallel $T$ gates. For a single fixed probe, the $k\log2$ bound is tight. Full rank is essential: pure states can hide non-Clifford dynamics completely. The sharper $k\log(4/3)$ bound for arbitrary states remains conjectural. Fixed-probe averaging reduces the nominal correlator count from $16^n$ to $4^n$, still exponential. Examples include exact parallel-$T$ formulas, third-Clifford-hierarchy bounds, Wigner-matrix dynamics with early growth $\mathcal I_2\simeq4t^2$, and six-qubit Heisenberg-chain numerics.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 4+6 pages, 1 figure