Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2411.05766 · Quantum Science and Technology

A nonstabilizerness monotone from stabilizerness asymmetry

Poetri Sonya Tarabunga, Martina Frau, Tobias Haug, Emanuele Tirrito, Lorenzo Piroli

Published Aug 19, 2025• 22 citations
arXivHTMLPDF

Abstract

Abstract We introduce a nonstabilizerness monotone which we name basis-minimized stabilizerness asymmetry (BMSA). It is based on the notion of G-asymmetry, a measure of how much a certain state deviates from being symmetric with respect to a symmetry group G. For pure states, we show that the BMSA is a strong monotone for magic-state resource theory, while it can be extended to mixed states via the convex roof construction. We discuss its relation with other magic monotones, first showing that the BMSA coincides with the recently introduced basis-minimized measurement entropy, thereby establishing the strong monotonicity of the latter. Next, we provide inequalities between the BMSA and other nonstabilizerness measures such as the robustness of magic, stabilizer extent, stabilizer rank, stabilizer fidelity and stabilizer Rényi entropy. We also prove that the stabilizer fidelity, stabilizer Rényi entropy and BMSA with index α ⩾ 2 have the same asymptotic scaling with qubit number. Finally, we present numerical methods to compute the BMSA, highlighting its advantages and drawbacks compared to other nonstabilizerness measures in the context of pure many-body quantum states. We also discuss the importance of additivity and strong monotonicity for measures of nonstabilizerness in many-body physics, motivating the search for additional computable nonstabilizerness monotones.

DOI
10.1088/2058-9565/adfd0d

Related papers

Stabilizer entropies and nonstabilizerness monotones

Tobias Haug, Lorenzo Piroli

We study different aspects of the stabilizer entropies (SEs) and compare them against known nonstabilizerness monotones such as the min-relative entropy and the robustness of magic. First, by means of explicit examples, we show that, for Rényi index 0≤n≤2 , the SEs are not monotones with respect to stabilizer protocols which include computational-basis measurements, not even when restricting to pure states (while the question remains open for n≥2 ). Next, we show that, for any Rényi index, the SEs do not satisfy a strong monotonicity condition with respect to computational-basis measurements. We further study SEs in different classes of many-body states. We compare the SEs with other measures, either proving or providing numerical evidence for inequalities between them.Finally, we discuss exact or efficient tensor-network numerical methods to compute SEs of matrix-product states (MPSs) for large numbers of qubits. In addition to previously developed exact methods to compute the Rényi SEs, we also put forward a scheme based on perfect MPS sampling, allowing us to compute efficiently the von Neumann SE for large bond dimensions.

arXiv:2303.10152•Quantum•Aug 28, 2023•155 citations

Quantifying non-stabilizerness via information scrambling

Arash Ahmadi, Eliška Greplová

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.

arXiv:2204.11236•SciPost Physics•Feb 8, 2024•34 citations

Algorithm for estimating α -stabilizer Rényi entropies via purity

Benjamin Stratton

Nonstabilizerness, or “magic,” is a resource for universal quantum computation in most fault-tolerant architectures; access to states with nonstabilizerness allows for nonclassically simulable quantum computation to be performed. Quantifying this resource for unknown states is therefore essential to assessing their utility in quantum computation. The stabilizer Rényi entropies have emerged as a leading tool for achieving this, having already enabled one efficient algorithm for measuring nonstabilizerness. In addition, the stabilizer Rényi entropies have proven useful in developing connections between nonstabilizerness and other quantum phenomena. In this work, we introduce an alternative algorithm for measuring the stabilizer Rényi entropies of an unknown quantum state. First, we show the existence of a state, produced from the action of a channel on α copies of some state ρ , that encodes the α -stabilizer Rényi entropy of ρ into its purity. We detail several methods of applying this channel, and then, by employing existing purity-measuring algorithms, provide an algorithm for measuring the α -stabilizer Rényi entropies for all integers α > 1 . This algorithm is benchmarked for qubits and the resource requirements compared to other known algorithms. Finally, a nonstabilizerness-entanglement relationship is shown to exist in the algorithm, demonstrating a relationship between the two resources, before an instance of resource hiding is found.

arXiv:2507.02540•Physical Review A•Jan 23, 2026•4 citations

Critical behaviors of non-stabilizerness in quantum spin chains

Poetri Sonya Tarabunga

Non-stabilizerness – commonly known as magic – measures the extent to which a quantum state deviates from stabilizer states and is a fundamental resource for achieving universal quantum computation. In this work, we investigate the behavior of non-stabilizerness around criticality in quantum spin chains. To quantify non-stabilizerness, we employ a monotone called mana, based on the negativity of the discrete Wigner function. This measure captures non-stabilizerness for both pure and mixed states. We introduce Rényi generalizations of mana, which are also measures of non-stabilizerness for pure states, and utilize it to compute mana in large quantum systems. We consider the three-state Potts model and its non-integrable extension and we provide strong evidence that the mutual mana exhibits universal logarithmic scaling with distance in conformal field theory, as is the case for entanglement.

arXiv:2309.00676•Quantum•Jul 17, 2024•67 citations

Mixed-state additivity properties of magic monotones based on quantum relative entropies for single-qubit states and beyond

Roberto Rubboli, Ryuji Takagi, Marco Tomamichel

We prove that the stabilizer fidelity is multiplicative for the tensor product of an arbitrary number of single-qubit states. We also show that the relative entropy of magic becomes additive if all the single-qubit states but one belong to a symmetry axis of the stabilizer octahedron. We extend the latter results to include all the α - z Rényi relative entropy of magic. This allows us to identify a continuous set of magic monotones that are additive for single-qubit states. We also show that all the monotones mentioned above are additive for several standard two and three-qubit states subject to depolarizing noise. Finally, we obtain closed-form expressions for several states and tighter lower bounds for the overhead of probabilistic one-shot magic state distillation.

arXiv:2307.08258•Quantum•Oct 4, 2024•20 citations

Magic without a phase: phase-independent stabilizer Rényi entropy in gluon scattering

Jinwei Chu, Savan Kharel

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\to 2$ scattering, we find that the final-state phase-independent magic is generically larger than the maximum attainable in $2\to 2$ scattering. For $2 \to 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.

hep-thCross-listedarXiv:2607.13134•Jul 16, 2026
Abstract We introduce a nonstabilizerness monotone which we name basis-minimized stabilizerness asymmetry (BMSA). It is based on the notion of G-asymmetry, a measure of how much a certain state deviates from being symmetric with respect to a symmetry group G. For pure states, we show that the BMSA is a strong monotone for magic-state resource theory, while it can be extended to mixed states via the convex roof construction. We discuss its relation with other magic monotones, first showing that the BMSA coincides with the recently introduced basis-minimized measurement entropy, thereby establishing the strong monotonicity of the latter. Next, we provide inequalities between the BMSA and other nonstabilizerness measures such as the robustness of magic, stabilizer extent, stabilizer rank, stabilizer fidelity and stabilizer Rényi entropy. We also prove that the stabilizer fidelity, stabilizer Rényi entropy and BMSA with index α ⩾ 2 have the same asymptotic scaling with qubit number. Finally, we present numerical methods to compute the BMSA, highlighting its advantages and drawbacks compared to other nonstabilizerness measures in the context of pure many-body quantum states. We also discuss the importance of additivity and strong monotonicity for measures of nonstabilizerness in many-body physics, motivating the search for additional computable nonstabilizerness monotones.
We study different aspects of the stabilizer entropies (SEs) and compare them against known nonstabilizerness monotones such as the min-relative entropy and the robustness of magic. First, by means of explicit examples, we show that, for Rényi index 0≤n≤2 , the SEs are not monotones with respect to stabilizer protocols which include computational-basis measurements, not even when restricting to pure states (while the question remains open for n≥2 ). Next, we show that, for any Rényi index, the SEs do not satisfy a strong monotonicity condition with respect to computational-basis measurements. We further study SEs in different classes of many-body states. We compare the SEs with other measures, either proving or providing numerical evidence for inequalities between them.Finally, we discuss exact or efficient tensor-network numerical methods to compute SEs of matrix-product states (MPSs) for large numbers of qubits. In addition to previously developed exact methods to compute the Rényi SEs, we also put forward a scheme based on perfect MPS sampling, allowing us to compute efficiently the von Neumann SE for large bond dimensions.
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.
Nonstabilizerness, or “magic,” is a resource for universal quantum computation in most fault-tolerant architectures; access to states with nonstabilizerness allows for nonclassically simulable quantum computation to be performed. Quantifying this resource for unknown states is therefore essential to assessing their utility in quantum computation. The stabilizer Rényi entropies have emerged as a leading tool for achieving this, having already enabled one efficient algorithm for measuring nonstabilizerness. In addition, the stabilizer Rényi entropies have proven useful in developing connections between nonstabilizerness and other quantum phenomena. In this work, we introduce an alternative algorithm for measuring the stabilizer Rényi entropies of an unknown quantum state. First, we show the existence of a state, produced from the action of a channel on α copies of some state ρ , that encodes the α -stabilizer Rényi entropy of ρ into its purity. We detail several methods of applying this channel, and then, by employing existing purity-measuring algorithms, provide an algorithm for measuring the α -stabilizer Rényi entropies for all integers α > 1 . This algorithm is benchmarked for qubits and the resource requirements compared to other known algorithms. Finally, a nonstabilizerness-entanglement relationship is shown to exist in the algorithm, demonstrating a relationship between the two resources, before an instance of resource hiding is found.
Non-stabilizerness – commonly known as magic – measures the extent to which a quantum state deviates from stabilizer states and is a fundamental resource for achieving universal quantum computation. In this work, we investigate the behavior of non-stabilizerness around criticality in quantum spin chains. To quantify non-stabilizerness, we employ a monotone called mana, based on the negativity of the discrete Wigner function. This measure captures non-stabilizerness for both pure and mixed states. We introduce Rényi generalizations of mana, which are also measures of non-stabilizerness for pure states, and utilize it to compute mana in large quantum systems. We consider the three-state Potts model and its non-integrable extension and we provide strong evidence that the mutual mana exhibits universal logarithmic scaling with distance in conformal field theory, as is the case for entanglement.
We prove that the stabilizer fidelity is multiplicative for the tensor product of an arbitrary number of single-qubit states. We also show that the relative entropy of magic becomes additive if all the single-qubit states but one belong to a symmetry axis of the stabilizer octahedron. We extend the latter results to include all the α - z Rényi relative entropy of magic. This allows us to identify a continuous set of magic monotones that are additive for single-qubit states. We also show that all the monotones mentioned above are additive for several standard two and three-qubit states subject to depolarizing noise. Finally, we obtain closed-form expressions for several states and tighter lower bounds for the overhead of probabilistic one-shot magic state distillation.
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→23\to 23→2 scattering, we find that the final-state phase-independent magic is generically larger than the maximum attainable in 2→22\to 22→2 scattering. For 2→32 \to 32→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.