Magic, or nonstabilizerness, is the quantum resource behind universal quantum computation. Its applications in high-energy and nuclear physics rely almost exclusively on the stabilizer Rényi entropy (SRE), although magic has no unique measure. For two qubits, we compare the SRE with three measures defined through optimizations over stabilizer states: the min- and max-relative entropies of magic and the logarithmic free robustness. We determine the maximal-magic states of all four measures, with exact proofs, and find that they depend on the measure. In the determination of the weak mixing angle from minimal magic in Møller scattering, the min-relative entropy gives an energy-dependent value that differs from that of the SRE, whereas the max-relative entropy and the logarithmic free robustness give $\sin^2θ_W=1/4$ at all energies. We trace this difference to the non-analytic structure of the optimization-based measures. Physical conclusions drawn from extremizing magic can thus depend on the measure.
Magic, or nonstabilizerness, is the quantum resource behind universal quantum computation. Its applications in high-energy and nuclear physics rely almost exclusively on the stabilizer Rényi entropy (SRE), although magic has no unique measure. For two qubits, we compare the SRE with three measures defined through optimizations over stabilizer states: the min- and max-relative entropies of magic and the logarithmic free robustness. We determine the maximal-magic states of all four measures, with exact proofs, and find that they depend on the measure. In the determination of the weak mixing angle from minimal magic in Møller scattering, the min-relative entropy gives an energy-dependent value that differs from that of the SRE, whereas the max-relative entropy and the logarithmic free robustness give sin2θW=1/4 at all energies. We trace this difference to the non-analytic structure of the optimization-based measures. Physical conclusions drawn from extremizing magic can thus depend on the measure.
Magic, also known as non-stabilizerness, measures the usefulness of a quantum state for quantum computation. While magic is defined relative to a choice of computational basis, in some physical settings the available data determine this basis only up to local phase conventions. In this paper, we generalize the notion of magic and formulate it in a phase-independent manner, and hence define a generalized stabilizer Rényi entropy. As a case study, we consider higher-multiplicity tree-level gluon scattering, interpreting the outgoing helicities as qubits. In this setting, the helicity data naturally determine a local basis for each qubit but leave a phase ambiguity. For 3→2 scattering, we find that the final-state phase-independent magic is generically larger than the maximum attainable in 2→2 scattering. For 2→3 scattering, we find a nonzero minimal value approached in the soft limit. Moreover, when the three outgoing momenta become symmetric, the magic approaches a local minimum only a few percent above the soft-limit value. In all cases considered, the color dependence cancels from the phase-independent stabilizer Rényi entropy.
Magic, or nonstabilizerness, is the resource that promotes stabilizer operations to universal quantum computation. For bipartite pure states, its component intrinsic to the correlations between the subsystems, the nonlocal magic, is obtained by minimizing a magic measure over local unitaries. For the stabilizer Rényi entropy (SRE), the minimum is conjectured to be attained by the computational-basis (CB) representative, the state obtained by assigning the Schmidt coefficients in decreasing order to matching computational-basis labels. We prove this conjecture for two families of states at every system size and bipartition: states with dyadic-staircase Schmidt spectra and states of Schmidt rank at most six. For arbitrary bipartite pure states, we show that the CB value exceeds the nonlocal SRE by at most 4, fixing the leading term of any divergent scaling of nonlocal SRE. We further show that the nonlocal SRE grows at most logarithmically with the entanglement entropy. Consequently, one-dimensional area-law states have bounded nonlocal SRE, while critical states with logarithmic entanglement entropy permit at most doubly logarithmic growth with system size. We apply these results to the transverse-field Ising chain, where we tightly bound the nonlocal SRE in the gapped phases and identify its double-logarithmic growth at criticality.
Magic is a property of a quantum state that characterizes its deviation from a stabilizer state, serving as a useful resource for achieving universal quantum computation e.g., within schemes that use Clifford operations. In this work, we study magic, as quantified by the stabilizer Renyi entropy, in a class of models known as generalized Rokhsar-Kivelson systems, i.e., Hamiltonians that allow a stochastic matrix form (SMF) decomposition. The ground state wavefunctions of these systems can be written explicitly throughout their phase diagram, and their properties can be related to associated classical statistical mechanics problems, thereby allowing powerful analytical and numerical approaches that are not usually available in conventional quantum many body settings. As a result, we are able to express the SRE in terms of wave function coefficients that can be understood as a free energy difference of related classical problems. We apply this insight to a range of quantum many body SMF Hamiltonians, which affords us to study numerically the SRE of large high-dimensional systems, and in some cases to obtain analytical results. We observe that the behaviour of the SRE is relatively featureless across quantum phase transitions in these systems, although it is indeed singular (in its first or higher order derivative, depending on the nature of the transition). On the contrary, we find that the maximum of the SRE generically occurs at a cusp away from the quantum critical point, where the derivative suddenly changes sign. Furthermore, we compare the SRE and the logarithm of overlaps with specific stabilizer states, asymptotically realised in the ground state phase diagrams of these systems. We find that they display strikingly similar behaviors, which in turn establish rigorous bounds on the min-relative entropy of magic.
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.
Magic states are essential resources for fault-tolerant quantum computation. We introduce the amortized stabilizer Rényi entropy (SRE), which quantifies the largest SRE increase generated by a unitary, including arbitrary pure inputs and reference systems. Initial nonstabilizerness can enhance this increase, whereas analogous amortized logarithmic robustness and extent collapse to stabilizer-input optimizations. We establish structural properties and exact amortized 2-SRE values for the T and CCZ gates. We then derive explicit lower bounds on approximate T-state cost, with diamond-distance error, allowing stabilizer ancillary states, Pauli measurements, and classical feedforward. A Choi-state witness gives computable bounds for quantum Fourier transforms, controlled rotations, fractional controlled-SWAP gates, and finite Heisenberg-chain evolutions. We distinguish the unrestricted optimization from its Choi witness and specify the access and precision requirements for estimating Pauli moments. An odd-moment variant yields a confidence-qualified cost witness from ordinary copies.
Abstract Magic is a quantum resource essential for universal quantum computation and represents the deviation of quantum states from those that can be simulated efficiently using classical algorithms. Using the stabilizer Rényi entropy (SRE), we investigate two-qubit states with maximal magic, which are most distinct from classical simulability, and provide strong numerical evidence that the maximal second order SRE is ln ( 16 / 7 ) ≈ 0.827 , establishing a tighter bound than the prior ln ( 5 / 2 ) ≈ 0.916 . We identify 480 states saturating the new bound, which turn out to be the fiducial states for the mutually unbiased bases (MUBs) generated by the orbits of the Weyl–Heisenberg (WH) group, and conjecture that WH-MUBs are the maximal magic states for n -qubit, when n ≠ 1 and 3. We also reveal a striking interplay between magic and entanglement: the entanglement of maximal magic states is restricted to two possible values, 1 / 2 and 1 / 2 , as quantified by the concurrence; none is maximally entangled.