Clifford Entropy in Quantum Resource Theory

• Clifford entropy is a measure that defines the non-Cliffordness of a unitary by quantifying deviations from ideal Clifford operations, with applications in quantum error correction and classical simulation.
• It establishes a direct mapping to stabilizer entropy for Choi states, thereby quantifying the cost of magic and guiding resource assessments in quantum circuit design.
• Analytical bounds, subadditivity, and concentration effects of Clifford entropy offer key insights into circuit complexity and efficient simulation strategies in quantum architectures.

Clifford entropy is a resource-theoretic measure introduced to quantify how far an arbitrary unitary operator is from being a Clifford unitary, generalizing the stabilizer entropy for quantum states. The Clifford group plays a foundational role in quantum information as the normalizer of the Weyl–Heisenberg (Pauli) group, with Clifford operations and states integral to classical simulation, quantum error correction, and benchmarking quantum resources beyond stabilizer circuits. Clifford entropy provides a systematic framework for comparing gate sets, quantifying the resource cost of nonstabilizerness (commonly called “magic”), and bounding circuit complexity in architectures augmented with non-Clifford elements (Cuffaro et al., 28 Dec 2025).

1. Formal Definition and Basic Properties

The α-Clifford entropy $S_C^{(\alpha)}(U)$ is defined for any unitary $U\in U(d)$, with $d=2^n$ for $n$ qubits. Let $\{D_a\}_{a\in \mathbb Z_d^2}$ be a fixed Weyl–Heisenberg frame on the Hilbert space $\mathcal H_d$. The characteristic matrix,

$$C_{ab}(U) = \frac{1}{d} \mathrm{Tr}[D_a^\dagger U D_b U^\dagger],$$

is used to construct the bistochastic matrix $\mathfrak D_{ab}(U) = |C_{ab}(U)|^2$. Any order-$\alpha$ Tsallis entropy can then be evaluated on rows and columns of $\mathfrak D(U)$. The symmetric choice,

$U\in U(d)$0

specializes for $U\in U(d)$1 to the computationally useful quadratic form,

$U\in U(d)$2

The Clifford entropy satisfies several fundamental properties:

• Faithfulness: $U\in U(d)$3 if and only if $U\in U(d)$4 is Clifford. For Clifford unitaries, $U\in U(d)$5 is monomial (up to phase) and thus $U\in U(d)$6 is a permutation matrix.
• Clifford-invariance: $U\in U(d)$7 for any Clifford $U\in U(d)$8.
• Subadditivity: $U\in U(d)$9, with precise correction terms expressed for general $d=2^n$0 (Cuffaro et al., 28 Dec 2025).

2. Relation to Stabilizer Entropy and Choi States

Clifford entropy for a unitary $d=2^n$1 admits an exact correspondence with the order-$d=2^n$2 stabilizer entropy $d=2^n$3 of its channel Choi state $d=2^n$4 associated to conjugation $d=2^n$5: $d=2^n$6 The stabilizer entropy is

$d=2^n$7

and the relationship

$d=2^n$8

demonstrates the direct mapping to the state-based resource theory of magic. For quantum channels and CPTP maps, extending this correspondence constitutes an active research direction (Cuffaro et al., 28 Dec 2025).

3. Analytical Bounds, Statistical Behavior, and Non-tightness

Upper bounds on Clifford entropy are inherited from known extremal bounds on stabilizer entropy for pure states. For $d=2^n$9,

$n$0

However, this bound is not tight: achieving it would require a Choi fiducial that is both a symmetric informationally complete (SIC) state and maximally entangled, which is forbidden by the structure of bipartite Weyl–Heisenberg-covariant SICs (Cuffaro et al., 28 Dec 2025).

For small dimensions ($n$1), direct numerical optimization yields: $n$2 The Haar average over unitaries, obtained via Weingarten calculus, approaches unity as $n$3: $n$4 with exact formulas given for general $n$5 (Cuffaro et al., 28 Dec 2025). Empirically, this average rapidly tracks the maximum as dimension increases, indicating the concentration of Clifford entropy for typical (Haar-random) unitaries near the universal bound.

4. Subadditivity, Concentration, and Circuit Complexity Bounds

Subadditivity of Clifford entropy under composition,

$n$6

is a high-probability event for Haar-random unitaries: $n$7 decays exponentially in $n$8. The function $n$9 is Lipschitz with constant $\{D_a\}_{a\in \mathbb Z_d^2}$0.

Operationally, for circuits generated by Clifford and a fixed magic gate $\{D_a\}_{a\in \mathbb Z_d^2}$1, the minimal $\{D_a\}_{a\in \mathbb Z_d^2}$2-count required to realize $\{D_a\}_{a\in \mathbb Z_d^2}$3 is bounded by

$\{D_a\}_{a\in \mathbb Z_d^2}$4

except with exponentially small failure probability. For Haar-random $\{D_a\}_{a\in \mathbb Z_d^2}$5, $\{D_a\}_{a\in \mathbb Z_d^2}$6 yields $\{D_a\}_{a\in \mathbb Z_d^2}$7, quantifying the circuit depth cost in terms of Clifford entropy. Numerical experiments confirm vanishing rate ($\{D_a\}_{a\in \mathbb Z_d^2}$8) of subadditivity violation even at modest $\{D_a\}_{a\in \mathbb Z_d^2}$9 (Cuffaro et al., 28 Dec 2025).

5. Clifford Entropy Polytopes, Entanglement Quantization, and Cones

In the context of state-based entanglement, the stabilizer (Clifford) entropy cone $\mathcal H_d$0 captures the set of entropy vectors $\mathcal H_d$1 realizable by stabilizer (Clifford) states. For $\mathcal H_d$2-qubit states, all membership constraints in $\mathcal H_d$3 include subadditivity, strong subadditivity, and the Ingleton/related Kinser inequalities, but not e.g., monogamy of mutual information (MMI), which can be violated by Clifford states (Schnitzer, 2020).

In SU(N)$\mathcal H_d$4 Chern–Simons theory with $\mathcal H_d$5 odd prime, it is established that $\mathcal H_d$6; the set of topologically constructible entropies coincides precisely with the Clifford entropy cone. For SU(N)$\mathcal H_d$7 with $\mathcal H_d$8, the topological cone is strictly contained in $\mathcal H_d$9, as not all generalized Pauli (and thus Clifford) operations are synthesizable (Schnitzer, 2020).

For concrete qubit counts, the set of entanglement values is highly discrete within the Clifford group. For four-qubit Clifford orbits, bipartite von Neumann entropies take only the values $$C_{ab}(U) = \frac{1}{d} \mathrm{Tr}[D_a^\dagger U D_b U^\dagger],$$0, reflecting the coarse-grained complexity and efficient simulatability of Clifford circuits (Latour et al., 2020).

6. Graph-Theoretic Structure and Entropic Diversity in Clifford Circuits

Contracted graphs formalize the action of Clifford circuits on entropy vectors. Each vertex corresponds to an equivalence class of quantum states sharing the same entropy pattern, defined by double cosets of the Clifford group modulo the stabilizer subgroup and the entropy-preserving subgroup of local Cliffords. The number of vertices in the contracted graph provides an upper bound on the entropic diversity accessible from a given initial state using Clifford circuits.

Explicitly, for $$C_{ab}(U) = \frac{1}{d} \mathrm{Tr}[D_a^\dagger U D_b U^\dagger],$$1-qubit Clifford circuits, the number of reachable entropy vectors cannot exceed

$$C_{ab}(U) = \frac{1}{d} \mathrm{Tr}[D_a^\dagger U D_b U^\dagger],$$2

where $$C_{ab}(U) = \frac{1}{d} \mathrm{Tr}[D_a^\dagger U D_b U^\dagger],$$3 is the order of the Clifford group (Keeler et al., 2023). For small $$C_{ab}(U) = \frac{1}{d} \mathrm{Tr}[D_a^\dagger U D_b U^\dagger],$$4, these counts match explicit contraction enumerations. The diameter of the contracted graph gives a measure of circuit depth needed to traverse entropic patterns, with implications for quantum error correction, state synthesis, and connections to holographic duality constraints (Keeler et al., 2023).

7. Spreading and Transport of Magic and Clifford Entropy

Stabilizer Rényi entropy (SRE), effectively the Clifford entropy for states, quantifies the degree of nonstabilizerness ("magic"). In brickwork random Clifford circuits, SRE for single-qubit reduced density matrices, after initializing with local magic, exhibits emergent transport phenomena: profiles broaden diffusively within a strictly causal (ballistic) light cone. When restricting to certain Clifford-only architectures (e.g., CNOT plus local H, S), superdiffusive broadening is observed. Global SRE is preserved under Clifford evolution, but its local redistribution is governed by hydrodynamic-like equations without actual conservation laws (Maity et al., 11 Nov 2025).

These results establish that Clifford entropy and its associated measures are essential in capturing the operational magic/complexity in Clifford+T circuits, circuit synthesis, entanglement dynamics, and topological quantum computing. The resource-theoretic and geometric perspectives provided by Clifford entropy unify several contemporary threads in quantum information science, from classical simulability to bounds on magic state injection and connections to topological field theory.

Key research directions include generalizations to arbitrary CPTP channels, monotonicity properties under stabilizer superchannels, statistical properties in generic circuits, and deeper connections to phase-space scrambling and out-of-time-order correlator (OTOC) diagnostics (Cuffaro et al., 28 Dec 2025).