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

The Arithmetic of Magic

Richard Goodman

Published Jul 12, 2026• 0 citations
Publisher

Abstract

A single boundary separates the quantum states a laptop can track from those it cannot, and that boundary recurs---wearing different costumes---across quantum simulation, resource theory, and the foundations of computation. In quantum computing its name is magic, or non-stabilizerness: the resource a circuit must spend to escape efficient classical simulation. We give magic an exact, decidable, machine-checked account. We work with the characteristic distribution of a state---the probability law its Pauli expectations induce---and a rational functional on it, the stabilizer 2-purity , whose value is exactly 1 precisely at the boundary. Our central result is a kernel-checked purity bound with a genuine biconditional at its core: on the physical domain (a fingerprint with total mass 1 and each weight 1/2^n) the stabilizer 2-purity satisfies 0< 1, and =1 if and only if the fingerprint is uniform on a 2^n-element support. A stabilizer fingerprint is this equality case plus the extra subgroup-support witness (identity and Pauli multiplication closure); the formalization proves that stabilizer states supply this witness and that saturated non-subgroup supports do not. Around the stabilizer fingerprint the magic-zero carrier carries five faces---stabilizer state, symplectic subgroup, fixed point of the stabilizer closure nucleus, vanishing imaginary coherence of its canonical two-level carrier, and (via the Clifford circuit that prepares it) Gottesman--Knill simulable. We then give

DOI
10.5281/zenodo.21315542

Related papers

The Arithmetic of Magic

Richard Goodman, Richard Goodman

A single boundary separates the quantum states a laptop can track from those it cannot, and that boundary recurs---wearing different costumes---across quantum simulation, resource theory, and the foundations of computation. In quantum computing its name is magic, or non-stabilizerness: the resource a circuit must spend to escape efficient classical simulation. We give magic an exact, decidable, machine-checked account. We work with the characteristic distribution of a state---the probability law its Pauli expectations induce---and a rational functional on it, the stabilizer 2-purity , whose value is exactly 1 precisely at the boundary. Our central result is a kernel-checked purity bound with a genuine biconditional at its core: on the physical domain (a fingerprint with total mass 1 and each weight 1/2^n) the stabilizer 2-purity satisfies 0< 1, and =1 if and only if the fingerprint is uniform on a 2^n-element support. A stabilizer fingerprint is this equality case plus the extra subgroup-support witness (identity and Pauli multiplication closure); the formalization proves that stabilizer states supply this witness and that saturated non-subgroup supports do not. Around the stabilizer fingerprint the magic-zero carrier carries five faces---stabilizer state, symplectic subgroup, fixed point of the stabilizer closure nucleus, vanishing imaginary coherence of its canonical two-level carrier, and (via the Clifford circuit that prepares it) Gottesman--Knill simulable. We then give

•Jul 11, 2026•0 citations

Pauli instability in arbitrary states: detecting magic in physical correlators

Tanner Jackson, Alexey Milekhin

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.

quant-pharXiv:2609.40032•Oct 1, 2026•1 citation

The Arithmetic of Magic

Richard Goodman

A single boundary separates the quantum states a laptop can track from those it cannot, and that boundary recurs---wearing different costumes---across quantum simulation, resource theory, and the foundations of computation. In quantum computing its name is magic, or non-stabilizerness: the resource a circuit must spend to escape efficient classical simulation. We give magic an exact, decidable, machine-checked account. We work with the characteristic distribution of a state---the probability law its Pauli expectations induce---and a rational functional on it, the stabilizer 2-purity , whose value is exactly 1 precisely at the boundary. Our central result is a kernel-checked purity bound with a genuine biconditional at its core: on the physical domain (a fingerprint with total mass 1 and each weight 1/2^n) the stabilizer 2-purity satisfies 0< 1, and =1 if and only if the fingerprint is uniform on a 2^n-element support. A stabilizer fingerprint is this equality case plus the extra subgroup-support witness (identity and Pauli multiplication closure); the formalization proves that stabilizer states supply this witness and that saturated non-subgroup supports do not. Around the stabilizer fingerprint the magic-zero carrier carries five faces---stabilizer state, symplectic subgroup, fixed point of the stabilizer closure nucleus, vanishing imaginary coherence of its canonical two-level carrier, and (via the Clifford circuit that prepares it) Gottesman--Knill simulable. We then give

•Jul 11, 2026•0 citations

Extremizing Measures of Magic on Pure States by Clifford-stabilizer States

Muhammad Erew, Moshe Goldstein

Magic states enable universal, fault-tolerant quantum computation within the stabilizer framework. Their non-stabilizerness supplies the resource needed to bypass the Eastin-Knill theorem while allowing fault-tolerant distillation. Although many measures of magic exist, not every nonzero-magic state is known to be distillable, and many of currently known distillable states are special cases of Clifford-stabilizer states, defined as pure states uniquely stabilized by finite Clifford subgroups. We develop a general framework for group-covariant functionals on Hermitian operators, introducing the notions of $G$-stabilizer spaces, states, and codes for arbitrary finite subgroups $G \subset \mathrm{U}(\mathcal{H})$. We define analytic families of $G$-covariant functionals and prove that any $G$-invariant pure state is extremal for a broad class of derived functionals, including symmetric, max-type, and Rényi-type functionals, whenever the underlying family is $G$-covariant. This extremality holds for purity-preserving variations orthogonal to the stabilized subspace. Specializing to the Pauli and Clifford groups, we recover the extremality structure of canonical magic measures such as mana, stabilizer Rényi entropies, generalized Rényi entropies, and stabilizer fidelity, and show that Clifford-stabilizer states extremize them. We classify such states for qubits, qutrits, ququints, and two-qubit systems, identifying new candidates for magic distillation. We further propose an inefficient distillation protocol for a two-qubit magic state with stabilizer fidelity exceeding standard benchmarks, and conjecture that SIC-POVM fiducial states are Clifford-stabilizer states.

quant-pharXiv:2512.19657•Dec 23, 2025•3 citations

On stabiliser techniques and their application to simulation and certification of quantum devices

Markus Heinrich

The stabiliser formalism is a widely used and successful subtheory of quantum mechanics consisting of stabiliser states, Clifford unitaries and Pauli measurements. The power of the formalism comes from the description of its elements via simple group theory. Although the origins of the formalism lie in quantum error correction and fault-tolerant quantum computing, the utility of the formalism goes beyond that. The Gottesman-Knill theorem states that the dynamics of stabiliser states under Clifford unitaries and Pauli measurements can be efficiently simulated on a classical computer. This algorithm can be extended to arbitrary states and unitaries in multiple ways at the cost of an increased runtime. This runtime can be seen as a quantification of the non-stabiliser resources needed to implement a quantum circuit. Moreover, as non-stabiliser elements are necessary for universal quantum computing, the runtime provides a way to measure the “non-classicality” of a computation. This is particularly pronounced in the magic state model of quantum computing where the only non-stabiliser elements are given by magic states. Hence, in the resource theory of magic, resources are measured through magic monotones which are operationally linked to runtimes of classical simulation algorithms. In this thesis, I discuss different aspects of the resource theory of magic. The mentioned classical simulation algorithms require the computation of magic monotones which is in general a computationally intractable problem. However, I show that the computational complexity can be exponentially reduced for certain classes of symmetric states, such as copies of magic states. To this end, the symmetries of the convex hull of stabiliser states are characterised and linked to their properties as so-called designs. In addition, I study the recently introduced class of completely stabiliser-preserving channels (CSP), which is the class of quantum channels unable to generate magic resources. It is shown that this class is strictly larger than the class of stabiliser operations, composed of Clifford unitaries and Pauli measurements. This finding could have several interesting consequences. First, it implies that there is a class of efficiently simulable quantum channels beyond the Gottesman-Knill theorem. Second, it is possible that optimal magic state distillation rates cannot be achieved via stabiliser operations and this gap is in fact significant. Further applications of the stabiliser formalism come through design theory. A unitary t-design is an ensemble of unitaries which reproduce the first t moments of the Haar measure on the unitary group. Randomness in the form of Haar-random unitaries is an essential building block in many quantum information protocols. Implementing such Haar-random unitaries is however often impractical. Here, designs can exhibit considerably lower resource requirements while still being random enough for most applications. Some of the most prominent examples of such protocols concern the certification and characterisation of quantum systems, such as randomised benchmarking. Interestingly, the group of Clifford unitaries forms a unitary 3-design and is often the prime choice thanks to efficient group operations. In this thesis, I summarise my recent results obtained with collaborators in constructing approximate unitary t-designs from the Clifford group supplemented by only few non-Clifford gates. Intriguingly, this construction uses only O(t^4) single qubit non-Clifford gates and is independent of the number of qubits n. Overall, this yields a gate count which is a significant improvement over for the Brandao-Harrow- Horodecki construction based on local random circuits. To provide context for this result, I review the representation theory of the Clifford group and define the Clifford semigroup. In an attempt to generalise approximations results for the unitary group to the Clifford group, the Clifford semigroup is investigated for suitable approximations of the Clifford twirl.

•Jan 1, 2021•4 citations

Quantifying Nonstabilizerness of Quantum Codes by Removing the Inert Background

Yuan Liu, Ke-Mi Xu

Nonstabilizerness (magic) is the quantum resource that, together with stabilizer operations, makes universal quantum computation possible. However, quantifying nonstabilizerness is difficult. The standard measure sums over exponentially many Pauli operators, and for quantum codes no quantitative theory has been available. A structural observation removes this obstacle: the Clifford sector carries no magic and can be removed by a Clifford transformation, leaving an order-three object whose magic is an exactly evaluable fourth moment. Removing this inert background yields closed forms for several code families: a formula for all Dicke states, reducing a 100-qubit case from $4^{100}$ terms to a short binomial sum; a bound for cubic-phase codes (twisted quantum doubles and non-Abelian topological order), saturated only by the $D_4$ code; and a cyclic/zero criterion for group multiplication states. For codeword-stabilized (CWS) codes, the companion paper \cite{Liu26arXiv} carries this reduction to its conclusion: the most magical codes are exactly the Sidon sets, and the nonstabilizerness bounds the code's transversal non-Clifford power. Together these results reduce the computation of nonstabilizerness for a broad class of codes to finite classical counting problems, and identify the maximally magical codes among them.

quant-pharXiv:2609.06177•Sep 8, 2026•0 citations
A single boundary separates the quantum states a laptop can track from those it cannot, and that boundary recurs---wearing different costumes---across quantum simulation, resource theory, and the foundations of computation. In quantum computing its name is magic, or non-stabilizerness: the resource a circuit must spend to escape efficient classical simulation. We give magic an exact, decidable, machine-checked account. We work with the characteristic distribution of a state---the probability law its Pauli expectations induce---and a rational functional on it, the stabilizer 2-purity , whose value is exactly 1 precisely at the boundary. Our central result is a kernel-checked purity bound with a genuine biconditional at its core: on the physical domain (a fingerprint with total mass 1 and each weight 1/2^n) the stabilizer 2-purity satisfies 0< 1, and =1 if and only if the fingerprint is uniform on a 2^n-element support. A stabilizer fingerprint is this equality case plus the extra subgroup-support witness (identity and Pauli multiplication closure); the formalization proves that stabilizer states supply this witness and that saturated non-subgroup supports do not. Around the stabilizer fingerprint the magic-zero carrier carries five faces---stabilizer state, symplectic subgroup, fixed point of the stabilizer closure nucleus, vanishing imaginary coherence of its canonical two-level carrier, and (via the Clifford circuit that prepares it) Gottesman--Knill simulable. We then give
A single boundary separates the quantum states a laptop can track from those it cannot, and that boundary recurs---wearing different costumes---across quantum simulation, resource theory, and the foundations of computation. In quantum computing its name is magic, or non-stabilizerness: the resource a circuit must spend to escape efficient classical simulation. We give magic an exact, decidable, machine-checked account. We work with the characteristic distribution of a state---the probability law its Pauli expectations induce---and a rational functional on it, the stabilizer 2-purity , whose value is exactly 1 precisely at the boundary. Our central result is a kernel-checked purity bound with a genuine biconditional at its core: on the physical domain (a fingerprint with total mass 1 and each weight 1/2^n) the stabilizer 2-purity satisfies 0< 1, and =1 if and only if the fingerprint is uniform on a 2^n-element support. A stabilizer fingerprint is this equality case plus the extra subgroup-support witness (identity and Pauli multiplication closure); the formalization proves that stabilizer states supply this witness and that saturated non-subgroup supports do not. Around the stabilizer fingerprint the magic-zero carrier carries five faces---stabilizer state, symplectic subgroup, fixed point of the stabilizer closure nucleus, vanishing imaginary coherence of its canonical two-level carrier, and (via the Clifford circuit that prepares it) Gottesman--Knill simulable. We then give
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 TTT gates needed to implement the dynamics in any circuit architecture.
A single boundary separates the quantum states a laptop can track from those it cannot, and that boundary recurs---wearing different costumes---across quantum simulation, resource theory, and the foundations of computation. In quantum computing its name is magic, or non-stabilizerness: the resource a circuit must spend to escape efficient classical simulation. We give magic an exact, decidable, machine-checked account. We work with the characteristic distribution of a state---the probability law its Pauli expectations induce---and a rational functional on it, the stabilizer 2-purity , whose value is exactly 1 precisely at the boundary. Our central result is a kernel-checked purity bound with a genuine biconditional at its core: on the physical domain (a fingerprint with total mass 1 and each weight 1/2^n) the stabilizer 2-purity satisfies 0< 1, and =1 if and only if the fingerprint is uniform on a 2^n-element support. A stabilizer fingerprint is this equality case plus the extra subgroup-support witness (identity and Pauli multiplication closure); the formalization proves that stabilizer states supply this witness and that saturated non-subgroup supports do not. Around the stabilizer fingerprint the magic-zero carrier carries five faces---stabilizer state, symplectic subgroup, fixed point of the stabilizer closure nucleus, vanishing imaginary coherence of its canonical two-level carrier, and (via the Clifford circuit that prepares it) Gottesman--Knill simulable. We then give
Magic states enable universal, fault-tolerant quantum computation within the stabilizer framework. Their non-stabilizerness supplies the resource needed to bypass the Eastin-Knill theorem while allowing fault-tolerant distillation. Although many measures of magic exist, not every nonzero-magic state is known to be distillable, and many of currently known distillable states are special cases of Clifford-stabilizer states, defined as pure states uniquely stabilized by finite Clifford subgroups. We develop a general framework for group-covariant functionals on Hermitian operators, introducing the notions of GGG-stabilizer spaces, states, and codes for arbitrary finite subgroups G⊂U(H)G \subset \mathrm{U}(\mathcal{H})G⊂U(H). We define analytic families of GGG-covariant functionals and prove that any GGG-invariant pure state is extremal for a broad class of derived functionals, including symmetric, max-type, and Rényi-type functionals, whenever the underlying family is GGG-covariant. This extremality holds for purity-preserving variations orthogonal to the stabilized subspace. Specializing to the Pauli and Clifford groups, we recover the extremality structure of canonical magic measures such as mana, stabilizer Rényi entropies, generalized Rényi entropies, and stabilizer fidelity, and show that Clifford-stabilizer states extremize them. We classify such states for qubits, qutrits, ququints, and two-qubit systems, identifying new candidates for magic distillation. We further propose an inefficient distillation protocol for a two-qubit magic state with stabilizer fidelity exceeding standard benchmarks, and conjecture that SIC-POVM fiducial states are Clifford-stabilizer states.
The stabiliser formalism is a widely used and successful subtheory of quantum mechanics consisting of stabiliser states, Clifford unitaries and Pauli measurements. The power of the formalism comes from the description of its elements via simple group theory. Although the origins of the formalism lie in quantum error correction and fault-tolerant quantum computing, the utility of the formalism goes beyond that. The Gottesman-Knill theorem states that the dynamics of stabiliser states under Clifford unitaries and Pauli measurements can be efficiently simulated on a classical computer. This algorithm can be extended to arbitrary states and unitaries in multiple ways at the cost of an increased runtime. This runtime can be seen as a quantification of the non-stabiliser resources needed to implement a quantum circuit. Moreover, as non-stabiliser elements are necessary for universal quantum computing, the runtime provides a way to measure the “non-classicality” of a computation. This is particularly pronounced in the magic state model of quantum computing where the only non-stabiliser elements are given by magic states. Hence, in the resource theory of magic, resources are measured through magic monotones which are operationally linked to runtimes of classical simulation algorithms. In this thesis, I discuss different aspects of the resource theory of magic. The mentioned classical simulation algorithms require the computation of magic monotones which is in general a computationally intractable problem. However, I show that the computational complexity can be exponentially reduced for certain classes of symmetric states, such as copies of magic states. To this end, the symmetries of the convex hull of stabiliser states are characterised and linked to their properties as so-called designs. In addition, I study the recently introduced class of completely stabiliser-preserving channels (CSP), which is the class of quantum channels unable to generate magic resources. It is shown that this class is strictly larger than the class of stabiliser operations, composed of Clifford unitaries and Pauli measurements. This finding could have several interesting consequences. First, it implies that there is a class of efficiently simulable quantum channels beyond the Gottesman-Knill theorem. Second, it is possible that optimal magic state distillation rates cannot be achieved via stabiliser operations and this gap is in fact significant. Further applications of the stabiliser formalism come through design theory. A unitary t-design is an ensemble of unitaries which reproduce the first t moments of the Haar measure on the unitary group. Randomness in the form of Haar-random unitaries is an essential building block in many quantum information protocols. Implementing such Haar-random unitaries is however often impractical. Here, designs can exhibit considerably lower resource requirements while still being random enough for most applications. Some of the most prominent examples of such protocols concern the certification and characterisation of quantum systems, such as randomised benchmarking. Interestingly, the group of Clifford unitaries forms a unitary 3-design and is often the prime choice thanks to efficient group operations. In this thesis, I summarise my recent results obtained with collaborators in constructing approximate unitary t-designs from the Clifford group supplemented by only few non-Clifford gates. Intriguingly, this construction uses only O(t^4) single qubit non-Clifford gates and is independent of the number of qubits n. Overall, this yields a gate count which is a significant improvement over for the Brandao-Harrow- Horodecki construction based on local random circuits. To provide context for this result, I review the representation theory of the Clifford group and define the Clifford semigroup. In an attempt to generalise approximations results for the unitary group to the Clifford group, the Clifford semigroup is investigated for suitable approximations of the Clifford twirl.
Nonstabilizerness (magic) is the quantum resource that, together with stabilizer operations, makes universal quantum computation possible. However, quantifying nonstabilizerness is difficult. The standard measure sums over exponentially many Pauli operators, and for quantum codes no quantitative theory has been available. A structural observation removes this obstacle: the Clifford sector carries no magic and can be removed by a Clifford transformation, leaving an order-three object whose magic is an exactly evaluable fourth moment. Removing this inert background yields closed forms for several code families: a formula for all Dicke states, reducing a 100-qubit case from 41004^{100}4100 terms to a short binomial sum; a bound for cubic-phase codes (twisted quantum doubles and non-Abelian topological order), saturated only by the D4D_4D4​ code; and a cyclic/zero criterion for group multiplication states. For codeword-stabilized (CWS) codes, the companion paper \cite{Liu26arXiv} carries this reduction to its conclusion: the most magical codes are exactly the Sidon sets, and the nonstabilizerness bounds the code's transversal non-Clifford power. Together these results reduce the computation of nonstabilizerness for a broad class of codes to finite classical counting problems, and identify the maximally magical codes among them.