Non-stabilizerness (colloquially "magic") characterizes genuinely quantum (beyond-Clifford) operations necessary for preparation of quantum states, and can be measured by stabilizer Rényi entropy (SRE). For permutationally symmetric states, we show that the SRE depends, for sufficiently large systems, only on a constant number of expectation values of collective spin operators. This compact description is leveraged for analysis of spin-squeezing protocols, which inherently generate non-stabilizerness. Under one-axis twisting (OAT), the generation of optimal squeezing is accompanied by a logarithmic divergence of SRE with system system size. Continued time evolution under OAT produces metrologically useful "kitten" states-superpositions of rotated GHZ states-that feature many-body Bell correlations but exhibit a smaller, system-size-independent SRE that decreases with increasing Bell-correlation strength. Our results reveal connections between non-stabilizerness, multipartite correlations, and quantum metrology, and provide a practical route to quantify non-stabilizerness in experiments for precision sensing.
Non-stabilizerness (colloquially "magic") characterizes genuinely quantum (beyond-Clifford) operations necessary for preparation of quantum states, and can be measured by stabilizer Rényi entropy (SRE). For permutationally symmetric states, we show that the SRE depends, for sufficiently large systems, only on a constant number of expectation values of collective spin operators. This compact description is leveraged for analysis of spin-squeezing protocols, which inherently generate non-stabilizerness. Under one-axis twisting (OAT), the generation of optimal squeezing is accompanied by a logarithmic divergence of SRE with system system size. Continued time evolution under OAT produces metrologically useful "kitten" states-superpositions of rotated GHZ states-that feature many-body Bell correlations but exhibit a smaller, system-size-independent SRE that decreases with increasing Bell-correlation strength. Our results reveal connections between non-stabilizerness, multipartite correlations, and quantum metrology, and provide a practical route to quantify non-stabilizerness in experiments for precision sensing.
Nonstabilizerness or `magic' is a key resource for quantum computing and a necessary condition for quantum advantage. Non-Clifford operations turn stabilizer states into resourceful states, where the amount of nonstabilizerness is quantified by resource measures such as stabilizer Rényi entropies (SREs). Here, we show that SREs saturate their maximum value at a critical number of non-Clifford operations. Close to the critical point SREs show universal behavior. Remarkably, the derivative of the SRE crosses at the same point independent of the number of qubits and can be rescaled onto a single curve. We find that the critical point depends non-trivially on Rényi index α . For random Clifford circuits doped with T-gates, the critical T-gate density scales independently of α . In contrast, for random Hamiltonian evolution, the critical time scales linearly with qubit number for α > 1 , while it is a constant for α < 1 . This highlights that α -SREs reveal fundamentally different aspects of nonstabilizerness depending on α : α -SREs with α < 1 relate to Clifford simulation complexity, while α > 1 probe the distance to the closest stabilizer state and approximate state certification cost via Pauli measurements. As technical contributions, we observe that the Pauli spectrum of random evolution can be approximated by two highly concentrated peaks which allows us to compute its SRE. Further, we introduce a class of random evolution that can be expressed as random Clifford circuits and rotations, where we provide its exact SRE. Our results opens up new approaches to characterize the complexity of quantum systems.
Nonstabilizerness, also known as magic, quantifies the number of non-Clifford operations needed to prepare a quantum state. As typical measures either involve minimization procedures or a computational cost exponential in the number of qubits N, it is notoriously hard to characterize for many-body states. In this paper, we show that nonstabilizerness, as quantified by the recently introduced stabilizer R\'enyi entropies (SREs), can be computed efficiently for matrix product states (MPSs). Specifically, given an MPS of bond dimension $\ensuremath{\chi}$ and integer R\'enyi index n>1, we show that the SRE can be expressed in terms of the norm of an MPS with bond dimension ${\ensuremath{\chi}}^{2n}$. For translation-invariant states, this allows us to extract it from a single tensor, the transfer matrix, while for generic MPSs this construction yields a computational cost linear in N and polynomial in $\ensuremath{\chi}$. We exploit this observation to revisit the study of ground-state nonstabilizerness in the quantum Ising chain, providing accurate numerical results up to large system sizes. We analyze the SRE near criticality and investigate its dependence on the local computational basis, showing that it is, in general, not maximal at the critical point.
The advent of quantum technologies brought forward much attention to the theoretical characterization of the computational resources they provide. A method to quantify quantum resources is to use a class of functions called magic monotones and stabilizer entropies, which are, however, notoriously hard and impractical to evaluate for large system sizes. In recent studies, a fundamental connection between information scrambling, the magic monotone mana and 2-Renyi stabilizer entropy was established. This connection simplified magic monotone calculation, but this class of methods still suffers from exponential scaling with respect to the number of qubits. In this work, we establish a way to sample an out-of-time-order correlator that approximates magic monotones and 2-Renyi stabilizer entropy. We numerically show the relation of these sampled correlators to different non-stabilizerness measures for both qubit and qutrit systems and provide an analytical relation to 2-Renyi stabilizer entropy. Furthermore, we put forward and simulate a protocol to measure the monotonic behaviour of magic for the time evolution of local Hamiltonians.
We study a nonstabilizerness resource theory for operators, which is dual to that describing states. We identify that the stabilizer Rényi entropy analog in operator space is a good magic monotone satisfying the usual conditions while inheriting efficient computability properties and providing a tight lower bound to the minimum number of non-Clifford gates in a circuit. Operationally, this measure quantifies how well an operator can be approximated by one with only a few Pauli strings-analogous to how entanglement entropy relates to tensor-network truncation. A notable advantage of operator stabilizer entropies is their inherent locality, as captured by a Lieb-Robinson bound. This feature makes them particularly suited for studying local dynamical magic resource generation in many-body systems. We compute this quantity analytically in two distinct regimes. First, we show that under random evolution, operator magic typically reaches near-maximal value for all Rényi indices, and we evaluate the Page correction. Second, harnessing both dual unitarity and ZX graphical calculus, we solve the operator stabilizer entropy for interacting integrable XXZ circuit, finding that it quickly saturates to a constant value. Overall, this measure sheds light on the structural properties of many-body nonstabilizerness generation and can inspire Clifford-assisted tensor network methods.
The non-stabilizerness, or "magic", of a quantum state is a common metric for the hardness of simulation on a classical computer, and is often quantified by the stabilizer Rényi entropy (SRE). We show how random superpositions of classically simulable states saturate the SRE to the symmetry-restricted Haar-random maximum. For any large-N random pure-state ensemble satisfying the conditions of Schur's lemma, the average SRE of the m-component superposition ⟨M2(m)⟩=N−log2[⟨W(m)⟩] is governed by an average witness ⟨W(m)⟩ that universally decomposes into a Haar floor and an ensemble-specific excess. As the number of components m increases, the excess is suppressed, resulting in a logarithmic scaling of the SRE before plateauing at the Haar-valued maximum. We derive a general closed form for ⟨W(m)⟩ in the thermodynamic limit, and numerically verify our result for random stabilizer states and random Gaussian states.
Stabilizer entropies (SEs) are measures of nonstabilizerness or "magic" that quantify the degree to which a state is described by stabilizers. SEs are especially interesting due to their connections to scrambling, localization and property testing. However, applications have been limited so far as previously known measurement protocols for SEs scale exponentially with the number of qubits. Here, we efficiently measure SEs for integer Rényi index n>1 via Bell measurements. The SE of N-qubit quantum states can be measured with O(n) copies and O(nN) classical computational time, where for even n we additionally require the complex conjugate of the state. We provide efficient bounds of various nonstabilizerness monotones that are intractable to compute beyond a few qubits. Using the IonQ quantum computer, we measure SEs of random Clifford circuits doped with non-Clifford gates and give bounds for the stabilizer fidelity, stabilizer extent, and robustness of magic. We provide efficient algorithms to measure Clifford-averaged 4n-point out-of-time-order correlators and multifractal flatness. With these measures we study the scrambling time of doped Clifford circuits and random Hamiltonian evolution depending on nonstabilizerness. Counterintuitively, random Hamiltonian evolution becomes less scrambled at long times, which we reveal with the multifractal flatness. Our results open up the exploration of nonstabilizerness with quantum computers.