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\chi^3) O ( N χ 3 ) for matrix product states (MPSs) of bond dimension \chi χ . 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 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}) O ( 8 N / 2 ) time and O(2^N) O ( 2 N ) memory, which we demonstrate for 24 24 qubits. Our work uncovers improved approaches to study the complexity of quantum many-body systems.
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\chi^3) O ( N χ 3 ) for matrix product states (MPSs) of bond dimension \chi χ . 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 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}) O ( 8 N / 2 ) time and O(2^N) O ( 2 N ) memory, which we demonstrate for 24 24 qubits. Our work uncovers improved approaches to study the complexity of quantum many-body 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.
Magic, capturing the deviation of a quantum state from the stabilizer formalism, is a key resource underpinning the quantum advantage. The recently introduced stabilizer Rényi entropy (SRE) offers a tractable measure of magic, avoiding the complexity of conventional methods. We study SRE in translation-invariant matrix product states (MPS), deriving exact expressions for representative states and introducing a numerically stable algorithm, named bond-DMRG, to compute the SRE density in infinite systems. Applying this method, we obtain high-precision SRE densities for the ground state of the one-dimensional Ising model. We also analyze non-local SRE density, showing it is bounded by a universal function of entanglement entropy, and further prove that two-site mutual SRE vanishes asymptotically in injective MPS. Our work not only introduces a powerful method for extracting the SRE density in quantum many-body systems, but also numerically reveals a fundamental connection between magic and entanglement, thereby paving the way for deeper theoretical investigations into their interplay.
Non-stabilizerness, also known as ``magic,'' quantifies how far a quantum state departs from the stabilizer set. It is a central resource behind quantum advantage and a useful probe of the complexity of quantum many-body states. Yet standard magic quantifiers, such as the stabilizer Rényi entropy (SRE) for qubits and the mana for qutrits, are costly to evaluate numerically, with the computational complexity growing rapidly with the number N of qudits. Here we introduce efficient, numerically exact algorithms that exploit the fast Hadamard transform to compute the SRE for qubits (d=2) and the mana for qutrits (d=3) for pure states given as state vectors. Our methods compute SRE and mana at cost O(Nd2N), providing an exponential improvement over the naive O(d3N) scaling, with substantial parallelism and straightforward GPU acceleration. We further show how to combine the fast Hadamard transform with Monte Carlo sampling to estimate the SRE of state vectors, and we extend the approach to compute the mana of mixed states. All algorithms are implemented in the open-source Julia package HadaMAG ( https://github.com/bsc-quantic/HadaMAG.jl/ ), which provides a high-performance toolbox for computing SRE and mana with built-in support for multithreading, MPI-based distributed parallelism, and GPU acceleration. The package, together with the methods developed in this work, offers a practical route to large-scale numerical studies of magic in quantum many-body systems.
We present a novel quantum Monte Carlo method for evaluating the α -stabilizer Rényi entropy (SRE) for any integer α ≥ 2 . By interpreting the α -SRE as partition-function ratios, we eliminate the sign problem in the imaginary-time path integral by sampling within a , which enables efficient classical computations of the α -SRE and its derivatives to explore magic in previously inaccessible two- or higher-dimensional systems. We first isolate the free-energy part in 2 -SRE, which is a trivial term. Notably, at quantum critical points in one-dimensional or two-dimensional transverse-field Ising (TFI) models, we reveal nontrivial singularities associated with the contribution, directly tied to magic. Their interplay leads to complicated behaviors of 2 -SRE, avoiding extrema at critical points generally. In contrast, analyzing the volume-law correction to SRE reveals a discontinuity tied to criticalities, suggesting that it is more informative than the full-state magic. For conformal critical points, we claim that it could reflect nonlocal magic residing in correlations. Finally, we verify that 2 -SRE fails to characterize magic in mixed states (e.g., Gibbs states), yielding nonphysical results. This work provides a powerful tool for exploring the roles of magic in large-scale many-body systems and reveals the intrinsic relation between magic and many-body physics.
We introduce a novel approach to evaluate the nonstabilizerness of an N-qubits matrix product state (MPS) with bond dimension χ. In particular, we consider the recently introduced stabilizer Rényi entropies (SREs). We show that the exponentially hard evaluation of the SREs can be achieved by means of a simple perfect sampling of the many-body wave function over the Pauli string configurations. The sampling is achieved with a novel MPS technique, which enables us to compute each sample in an efficient way with a computational cost O(Nχ^{3}). We benchmark our method over randomly generated magic states, as well as in the ground-state of the quantum Ising chain. Exploiting the extremely favorable scaling, we easily have access to the nonequilibrium dynamics of the SREs after a quantum quench.
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.