Non-stabilizerness, alongside entanglement, is a crucial ingredient for fault-tolerant quantum computation and achieving a genuine quantum advantage. Despite recent progress, a complete understanding of the generation and thermalization of non-stabilizerness in circuits that mix Clifford and non-Clifford operations remains elusive. While Clifford operations do not generate non-stabilizerness, their interplay with non-Clifford gates can strongly impact the overall non-stabilizing dynamics of generic quantum circuits. In this work, we establish a direct relationship between the final non-stabilizing power and the individual powers of the non-Clifford gates, in circuits where these gates are interspersed with random Clifford operations. By leveraging this result, we unveil the thermalization of non-stabilizing power to its Haar-averaged value in generic circuits. As a precursor, we analyze two-qubit gates and illustrate this thermalization in analytically tractable systems. Extending this, we explore the operator-space non-stabilizing power and demonstrate its behavior in physical models. Finally, we examine the role of non-stabilizing power in the emergence of quantum chaos in brick-wall quantum circuits. Our work elucidates how non-stabilizing dynamics evolve and thermalize in quantum circuits and thus contributes to a better understanding of quantum computational resources and of their role in quantum chaos.
Non-stabilizerness, alongside entanglement, is a crucial ingredient for fault-tolerant quantum computation and achieving a genuine quantum advantage. Despite recent progress, a complete understanding of the generation and thermalization of non-stabilizerness in circuits that mix Clifford and non-Clifford operations remains elusive. While Clifford operations do not generate non-stabilizerness, their interplay with non-Clifford gates can strongly impact the overall non-stabilizing dynamics of generic quantum circuits. In this work, we establish a direct relationship between the final non-stabilizing power and the individual powers of the non-Clifford gates, in circuits where these gates are interspersed with random Clifford operations. By leveraging this result, we unveil the thermalization of non-stabilizing power to its Haar-averaged value in generic circuits. As a precursor, we analyze two-qubit gates and illustrate this thermalization in analytically tractable systems. Extending this, we explore the operator-space non-stabilizing power and demonstrate its behavior in physical models. Finally, we examine the role of non-stabilizing power in the emergence of quantum chaos in brick-wall quantum circuits. Our work elucidates how non-stabilizing dynamics evolve and thermalize in quantum circuits and thus contributes to a better understanding of quantum computational resources and of their role in quantum chaos.
We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension d . Using doped Clifford Weingarten calculus and a replica tensor network formalism, we derive exact results and perform large-scale simulations in regimes challenging for tensor network and Pauli-based methods. We begin by analyzing generalized stabilizer entropies, computable magic monotones in many-qudit systems, and identify a dynamical phase transition in the doping rate, marking the breakdown of classical simulability and the onset of Haar-random behavior. The critical behavior is governed by the qudit dimension and the magic content of the non-Clifford gate. Using the qudit T -gate as a benchmark, we show that higher-dimensional qudits converge faster to Haar-typical stabilizer entropies. For qutrits ( d = 3 ), analytical predictions match numerics on brickwork circuits, showing that locality plays a limited role in magic spreading. We also examine anticoncentration and entanglement growth, showing that O ( log N ) non-Clifford gates suffice for approximating Haar expectation values to precision ε , and relate antiflatness measures to stabilizer entropies in qutrit systems. Finally, we analyze out-of-time-order correlators and show that a finite density of non-Clifford gates is needed to induce chaos, with a sharp transition fixed by the local dimension, twice that of the magic transition. Altogether, these results establish a unified framework for diagnosing complexity in doped Clifford circuits and deepen our understanding of resource theories in multiqudit systems.
Quantum magic, or non-stabilizerness, is an important quantum resource that characterizes computational power beyond classically simulable Clifford operations and is therefore essential for achieving quantum advantage. While previous studies have explored non-stabilizerness dynamics in random circuits and under time-independent generators, here we extend the study of its universal dynamics to time-dependent driving across quantum phase transitions. In particular, we show that the stabilizer Rényi entropies and the cumulants of the Pauli spectrum exhibit universal power-law scaling with the driving rate in slow processes. Moreover, we show that the logarithmic Pauli spectrum is asymptotically Gaussian, implying a lognormal distribution for the Pauli spectrum values. Our results are explicitly demonstrated by exact results in the transverse-field Ising model and by analytical approximations in long-range Kitaev models.
Floquet quantum circuits are able to realise a wide range of non-equilibrium quantum states, exhibiting quantum chaos, topological order and localisation. In this work, we investigate the stability of operator localisation and emergence of chaos in random Floquet-Clifford circuits subjected to unitary perturbations which drive them away from the Clifford limit. We construct a nearest-neighbour Clifford circuit with a brickwork pattern and study the effect of including disordered non-Clifford gates. The perturbations are uniformly sampled from single-qubit unitaries with probability p on each qubit. We show that the interacting model exhibits strong localisation of operators for 0 ≤ p < 1 that is characterised by the fragmentation of operator space into disjoint sectors due to the appearance of wall configurations. Such walls give rise to emergent local integrals of motion for the circuit that we construct exactly. We analytically establish the stability of localisation against generic perturbations and calculate the average length of operator spreading tunable by p . Although our circuit is not separable across any bi-partition, we further show that the operator localisation leads to an entanglement bottleneck, where initially unentangled states remain weakly entangled across typical fragment boundaries. Finally, we study the spectral form factor (SFF) to characterise the chaotic properties of the operator fragments and spectral fluctuations as a probe of non-ergodicity. In the p = 1 model, the emergence of a fragmentation time scale is found before random matrix theory sets in after which the SFF can be approximated by that of the circular unitary ensemble. Our work provides an explicit description of quantum phases in operator dynamics and circuit ergodicity which can be realised on current NISQ devices.
Stabilizer states constitute an important class of quantum states that can be generated from computational-basis states using Pauli operators and Clifford gates. Although they may exhibit substantial multipartite entanglement, quantum circuits restricted to stabilizer operations can be efficiently simulated classically and therefore cannot, by themselves, provide a quantum computational advantage. Such an advantage requires non-stabilizer resources, commonly referred to as quantum magic. In this paper, we investigate the non-stabilizerness of quantum states arising in a class of spin Hamiltonians by computing their stabilizer Rényi entropies. Using real-space renormalization-group techniques, we obtain a closed-form expression valid in the low-energy, large-distance regime. We analyze how quantum magic evolves under coarse-graining and explore its behavior across different parameter regimes and quantum phases.
The quantum-trajectory description of a noisy quantum circuit is not unique: every Kraus representation of the noise channel defines a different unraveling, i.e., a different ensemble of pure states that averages to the same density matrix. While all unravelings share the same expectation values of observables, they generally differ in the amount of quantum resources carried by the individual trajectories. Here we study non-stabilizerness, or magic, quantified by the stabilizer Rényi entropy, in quantum-trajectory unravelings of Haar-random and T-doped random Clifford brickwork circuits subject to local dephasing noise of strength p. The canonical unraveling in terms of Pauli jumps is Clifford and leaves magic untouched, so that trajectories retain the Haar-random value of non-stabilizerness. Exploring the full two-parameter family of minimal unravelings, we find that the trajectory-averaged magic can be substantially reduced by a state-independent choice of Kraus operators, and that the optimal choice is not in general the projective-measurement unraveling, but a two-outcome generalized measurement in which the Kraus operators correspond to a weak measurement of the noisy qubit. The optimal unraveling reduces the extensive magic density of the trajectories by a p-dependent factor without altering its linear scaling with system size. At the same time, it produces a very broad distribution of magic over trajectories, with a sizable fraction of trajectories retaining Haar-random magic. Since the cost of stabilizer-based classical simulation grows exponentially with the magic of the state, these high-magic trajectories, rather than the average, control the simulation cost. Our results delineate the potential and the limitations of unraveling optimization as a route to the classical simulation of noisy quantum dynamics with stabilizer methods.
Universal features of chaotic quantum dynamics underlie our understanding of thermalization in closed quantum systems and the complexity of quantum computations. Reversible automaton circuits, comprised of classical logic gates, have emerged as a tractable means to study such dynamics. Despite generating no entanglement in the computational basis, these circuits nevertheless capture many features expected from fully quantum evolutions. In this work, we demonstrate that the differences between automaton dynamics and fully quantum dynamics are revealed by the operator entanglement spectrum, much like the entanglement spectrum of a quantum state distinguishes between the dynamics of states under Clifford and Haar random circuits. While the operator entanglement spectrum under random unitary dynamics is governed by the eigenvalue statistics of random Gaussian matrices, we show evidence that under random automaton dynamics it is described by the statistics of Bernoulli random matrices, whose entries are random variables taking values 0 or 1 . We study the crossover between automaton and generic unitary operator dynamics as the automaton circuit is doped with gates that introduce superpositions, namely Hadamard or R x = e − i π 4 X gates. We find that a constant number of superposition-generating gates is sufficient to drive the operator dynamics to the random-circuit universality class, similar to earlier results on Clifford circuits doped with T gates. This establishes the operator entanglement spectrum as a useful tool for probing the chaoticity and universality class of quantum dynamics.