Clifford-Dominated Quantum Circuits

• Clifford-dominated circuits are quantum circuits where dominant Clifford operations, such as Hadamard, phase, and CNOT, are augmented by sparse non-Clifford resources to enable efficient classical simulation.
• They utilize the stabilizer formalism for tractable simulation and optimal compilation, making them practical in fault-tolerant settings, variational algorithms, and benchmarking tasks.
• Advanced synthesis methods and complexity analyses reveal that while large Clifford blocks can be simulated classically, residual non-Clifford elements critically determine computational hardness.

Clifford-dominated circuits are quantum circuits in which the dominant computational structure lies in Clifford operations, while non-Clifford resources are absent, sparse, localized, or attached as shallow augmentations. In the standard qubit setting, Clifford circuits are generated by Hadamard $H$, phase $S$, and CNOT, together with Pauli gates, and are characterized by the property that for every Pauli operator $P$, a Clifford unitary $U$ satisfies $UPU^\dagger\in\mathcal P_n$. That normalizer property underlies efficient stabilizer simulation and explains why large fault-tolerant computations are often organized as Clifford+$T$ circuits in which expensive $T$ gates are interleaved with large Clifford blocks (Peham et al., 2023). Across current work, the topic includes pure Clifford blocks optimized exactly, near-Clifford circuits whose complexity is governed by $T$-count or magic-state input, and shallow non-Clifford augmentations of Clifford bulks used for design generation, benchmarking, and hybrid simulation (Bravyi et al., 2016, Zhang et al., 3 Jul 2025, Lima et al., 22 Apr 2025).

1. Algebraic basis and operational scope

The algebraic core of the subject is the stabilizer formalism. Clifford circuits preserve the Pauli group under conjugation, which is exactly why they admit Gottesman–Knill simulation and why their action can be represented compactly by tableaux, affine symplectic maps, graph-state data, or related symbolic objects. In fault-tolerant settings, this structure makes Clifford blocks both practically central and unusually tractable: they dominate execution depth, yet their semantics can often be propagated classically without expanding into exponentially many amplitudes (Peham et al., 2023).

A recurrent misconception is that high entanglement by itself implies classical hardness. Multiple works in this area explicitly separate entanglement from non-stabilizerness. Clifford circuits can generate highly entangled stabilizer states while remaining efficiently simulable; what makes a Clifford-dominated circuit hard is the residual non-Clifford content, often described in terms of magic, $T$-count, or non-Clifford gate layers. In the time-evolution setting, this distinction is operationalized by moving stabilizer-like entanglement into a Clifford frame and leaving the residual non-stabilizer component to a tensor-network ansatz (Qian et al., 2024).

The term also covers circuits that are not purely Clifford but admit a structural split into a Clifford part and a non-Clifford part, such as

$U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$

In that regime, the Clifford section can often be simulated, compiled, or absorbed into observables classically, while the non-Clifford remainder becomes the only genuinely hard component (Lima et al., 22 Apr 2025).

2. Complexity-theoretic position and simulation algorithms

One of the sharpest complexity separations in the literature is the depth-optimal synthesis of Clifford blocks. For an $S$0-qubit Clifford unitary $S$1 and a depth budget $S$2, the decision problem “is it possible to exactly reproduce $S$3 with at most $S$4 Clifford layers?” can be reformulated as SAT with $S$5 variables and $S$6 constant-size clauses. Conceptually, this places Clifford synthesis in $S$7, in contrast to classical logical synthesis, which is reviewed there as $S$8-complete. The reduction proceeds by replacing universal input quantification with a maximally entangled stimulus and then checking stabilizer propagation through a tableau encoding (Peham et al., 2023).

For near-Clifford circuits, the canonical complexity parameter is the number $S$9 of non-Clifford $P$0 gates. Bravyi and Gosset showed that for an $P$1-qubit Clifford+$P$2 circuit with $P$3 total gates, output-probability estimation and approximate sampling can be done in time $P$4 and $P$5, respectively, where $P$6 is the number of measured output qubits. Their implementation simulated a hidden-shift algorithm on $P$7 qubits with a few hundred Clifford gates and nearly $P$8 $P$9-gates, and the paper explicitly positions the method as a verification tool for medium-size computations dominated by Clifford gates (Bravyi et al., 2016).

The same perspective extends to odd-prime qudits. For qudit circuits with $U$0 injected magic states, the approximate stabilizer rank scales as

$U$1

where $U$2 is the approximation parameter and $U$3 is the single-qudit stabilizer–magic overlap. The paper also gives an $U$4 inner-product algorithm for two $U$5-qudit stabilizer states and reports, for example, qutrit weak-simulation scaling $U$6 (Huang et al., 2018).

For pure Clifford simulation, recent work has also isolated global-structure methods beyond tableaux. One approach converts a Clifford circuit into a phased graph state and computes amplitudes by Gaussian elimination on a modified adjacency matrix via an LDL decomposition over $U$7. For a Clifford circuit with $U$8 qubits, $U$9 one- or two-qubit gates, and circuit treewidth $UPU^\dagger\in\mathcal P_n$0, the stated complexity is

$UPU^\dagger\in\mathcal P_n$1

for $UPU^\dagger\in\mathcal P_n$2 amplitudes or samples, with improved asymptotics in strong simulation and in many-query regimes (Pang et al., 8 Nov 2025).

3. Exact synthesis, optimal compilation, and local replacement

Exact compilation of Clifford-dominated circuits has progressed along two complementary lines: exact global synthesis for small blocks and exact local replacement inside larger Clifford-heavy circuits. The SAT-based compiler for depth-optimal Clifford synthesis computes the target stabilizer/destabilizer tableau, fixes a candidate depth $UPU^\dagger\in\mathcal P_n$3, builds a SAT instance for layered Clifford circuits of depth at most $UPU^\dagger\in\mathcal P_n$4, and uses SAT/UNSAT outcomes to recover both a circuit and a certificate of optimality. On random Clifford instances, the exact method scaled only to about $UPU^\dagger\in\mathcal P_n$5 qubits within a $UPU^\dagger\in\mathcal P_n$6-hour timeout, but within that range it exposed large optimality gaps: the compared greedy method exceeded optimum on average by $UPU^\dagger\in\mathcal P_n$7 for $UPU^\dagger\in\mathcal P_n$8, $UPU^\dagger\in\mathcal P_n$9 for $T$0, and $T$1 for $T$2. On Clifford+$T$3 Grover-search circuits, optimizing the Clifford blocks yielded average total-circuit reductions of $T$4, $T$5, and $T$6 for $T$7, $T$8, and $T$9 qubits, respectively (Peham et al., 2023).

An earlier exact-synthesis program computed optimal Clifford circuits for all operations up to four qubits and then used that database as a peephole optimizer for larger stabilizer circuits. In that work, any $T$0-qubit Clifford unitary could be implemented with at most $T$1 gates, and replacing local subcircuits acting on at most $T$2 qubits reduced the gate count of quantum-error-correction encoders by about $T$3 to $T$4, i.e. roughly $T$5, on the reported benchmarks (Kliuchnikov et al., 2013).

The same idea was later pushed to six qubits with minimum-CNOT optimality. For $T$6, the symplectic Clifford group size is

$T$7

yet a reduced database of size $T$8 TB sufficed to implicitly synthesize optimal circuits for all $T$9-qubit Clifford operators. The reported average extraction times were $T$0 seconds on consumer hardware and $T$1 seconds on enterprise hardware, both averaged over $T$2 random $T$3-qubit Clifford elements (Bravyi et al., 2020).

4. Symbolic representations and structural decomposition

A distinct line of work treats Clifford-dominated circuits through symbolic or diagrammatic normal forms. In the ZX-calculus approach formalized in Quantomatic, rewrite rules derived from stabilizer-complete ZX equations provably reduce all $T$4- and $T$5-qubit Clifford circuits to minimal form, and on wider random Clifford circuits of depth $T$6 the reported average size reduction was roughly $T$7 to $T$8, depending on width (Fagan et al., 2019).

Path sums provide a more algebraic symbolic language. For Clifford structure, the relevant subclass is the family of Clifford path sums

$T$9

with linear $T$0, pure quadratic $T$1, and affine $T$2. In this restricted class, the unitarity problem is in $T$3, unlike the general path-sum unitarity problem, which is shown to be co-NP-hard. The extraction algorithm produces a Clifford circuit in the structured form

$T$4

where $T$5 and $T$6 are Hadamard-free Clifford circuits and $T$7 is a Hadamard layer (Amy et al., 2022).

Structural decomposition can also be stated directly at the circuit level. A ZX-calculus detection procedure identifies a “Clifford border” by converting non-Clifford spiders—defined there as spiders with phase not an integer multiple of $T$8—and pushing them as far right as possible. The result is a decomposition

$T$9

which then supports several hybrid uses: tableau simulation of the Clifford prefix followed by statevector evolution of the non-Clifford suffix, stabilizer-state initialization for variational algorithms, or classical observable conjugation when the Clifford block is a suffix. The split is exact for the rewritten representation but explicitly depends on the chosen ZX rewriting and circuit shape (Lima et al., 22 Apr 2025).

5. Variational, many-body, and quantum-chemistry uses

In quantum chemistry, Clifford-dominated circuits appear as virtual post-processing layers rather than as the main ansatz. A partitioned VQE scheme enforces a product over subsystems and then reintroduces inter-subsystem correlation by a full-system circuit $U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$0 that is folded into the Hamiltonian,

$U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$1

The design principle is to choose $U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$2 from purely Clifford or near-Clifford circuits so that Pauli-term cardinality does not blow up under conjugation. The reported numerical result is a reduction of the qubit count of up to a $U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$3 at a similar accuracy as compared to the separable-pair ansatz (Schleich et al., 2023).

For real-time many-body simulation, Clifford structure can be used as a dynamically updated frame. Clifford Circuits Augmented TDVP applies local two-qubit Clifford gates after each TDVP step, choosing among all $U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$4 two-qubit Clifford gates the one that minimizes local entanglement entropy in the MPS. The Hamiltonian is updated by

$U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$5

and because Clifford conjugation maps Pauli strings to Pauli strings, the number of Hamiltonian terms is unchanged. On the $U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$6D XXZ chain, the method required about half, or even one-third, of the bond dimension used by standard TDVP for comparable accuracy; on the $U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$7 Heisenberg benchmark, CA-TDVP with $U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$8 was reported as comparable to TDVP with $U=U_CU_{NC}\qquad\text{or}\qquad U=U_{NC}U_C.$9 (Qian et al., 2024).

Adaptive variational compilation provides a third use case. Clifford Accelerated Adaptive QAOA restricts variational angles to “Clifford Points” $S$00 for preoptimization, and uses Clifford-point approximations to evaluate ADAPT operator-selection scores classically. The paper states that this allows a fully parallel and fully classical method for selecting the ADAPT pool operator, bringing QPU calls for that selection step to zero. It also reports that applying $S$01 to $S$02 error approximation on $S$03-gates using low-rank stabilizer decomposition can provide significative improvements in convergence quality for MaxCut and TFIM, which the authors interpret as a hint of significant $S$04-gate over-representation in ansatz design (Lisart-Liebermann et al., 22 Aug 2025).

6. Benchmarking, pseudorandomness, and chaos

Clifford-dominated circuits have become important not only for computation but also for characterization of hardware. Clifford XEB replaces the hard-to-simulate random circuits of standard linear XEB by Clifford ensembles, preserving the same experimental workflow while making the classical postprocessing polynomial-time. The paper reports noisy simulations on $S$05, $S$06, and $S$07 qubits and then on a $S$08 grid, i.e. $S$09 qubits. For the $S$10-qubit experiment, all noisy runs took approximately $S$11 hours and estimating the noiseless mixing rate took about $S$12 days. The associated theory proves exponential-decay behavior under sufficiently low errors for approximate-twirl Clifford ensembles (Chen et al., 2022).

A more rigorous route from Clifford-dominated circuits to pseudorandomness is provided by magic-augmented Clifford circuits. There, a shallow random Clifford circuit is preceded and/or followed by constant-depth non-Clifford layers. For relative-error state and unitary $S$13-designs, the paper proves depth

$S$14

in $S$15D and

$S$16

in all-to-all architectures with ancillas. For additive-error state $S$17-designs, the paper shows that shallow Clifford circuits followed by $S$18 single-qubit magic gates, independent of system size, can generate an additive-error state $S$19-design (Zhang et al., 3 Jul 2025).

Empirical work on chaos diagnostics reaches a complementary conclusion. Deterministic Clifford+$S$20 constructions with causal-cover Clifford backbones and sparse $S$21-resources can exhibit OTOC decay and Wigner–Dyson entanglement-spectrum statistics. The circuits studied are explicitly Clifford-dominated: the bulk consists of $S$22, $S$23, CNOT, and routing structures, while the non-Clifford content is an initial layer of $S$24 $S$25-states and a second layer of $S$26 $S$27-gates. The paper argues that purely Clifford circuits, although they can spread Pauli operators and generate entanglement, do not yield the Wigner–Dyson statistics associated with stronger chaoticity, and it emphasizes that causal connectivity rather than randomness or sheer depth is the decisive architectural feature (Sharma et al., 2 Dec 2025).

7. Generalizations, restricted families, and limits

The notion of a Clifford-dominated circuit is not confined to qubits or cyclic qudits. A generalized Clifford group exists over any finite abelian group $S$28, with computational space $S$29, shift operators $S$30, phase operators $S$31, and a Clifford group defined as the normalizer of the corresponding Pauli group. Every Clifford gate over such a $S$32 can be generated by automorphism gates $S$33, quadratic phase gates $S$34, and Fourier transforms $S$35, and every circuit consisting only of these generalized Clifford gates can be efficiently simulated classically. A key non-cyclic phenomenon is that one-register Cliffords plus the standard controlled-addition gate are not always sufficient; more general two-register automorphism gates are required (Moses et al., 2024).

The boundary between Clifford-dominated and fully general Clifford+$S$36 computation can also be expressed number-theoretically. Several restricted universal families are characterized by subrings of $S$37: for example,

$S$38

$S$39

and

$S$40

These correspondences show that “mostly Clifford” structure can be formalized as exact representability over restricted coefficient rings rather than only by gate counts or heuristics (Amy et al., 2019).

The literature is equally explicit about limits. Pure Clifford circuits are non-universal and, in several application domains, insufficiently expressive on their own. Exact SAT-based synthesis has polynomial-size encodings but not polynomial-time solving, and in the reported setup its exact random-circuit optimization effectively tops out at around $S$41 qubits (Peham et al., 2023). In chemistry, purely Clifford virtual circuits preserve Hamiltonian cardinality but cannot in general recover all missing correlation (Schleich et al., 2023). In many-body dynamics, the main long-time growth is reported to come from non-stabilizerness rather than stabilizer-like entanglement (Qian et al., 2024). In design generation, the resource gap between additive-error and relative-error notions is substantial, and the same paper proves no-go theorems for various architectures to generate designs with bounded relative error (Zhang et al., 3 Jul 2025). Empirical chaos studies likewise emphasize that pure Clifford dynamics remains in the stabilizer regime even when entanglement grows rapidly (Sharma et al., 2 Dec 2025).

These results suggest a consistent encyclopedic picture. Clifford-dominated circuits are not defined by a single gate count threshold, but by a structural asymmetry: a large Clifford backbone captures most of the circuit’s transport, entangling, or compiling behavior, while a smaller non-Clifford sector determines universality, hardness, or the final gap to Haar-like randomness. The modern literature treats that asymmetry as both a resource and a limitation.