Clifford circuits are insufficient for universal quantum computation or creating t t -designs with t\ge 4 t ≥ 4 . While the entanglement entropy is not a telltale of this insufficiency, the entanglement spectrum of a time evolved random product state is: the entanglement levels are Poisson-distributed for circuits restricted to the Clifford gate-set, while the levels follow Wigner-Dyson statistics when universal gates are used. In this paper we show, using finite-size scaling analysis of different measures of level spacing statistics, that in the thermodynamic limit, inserting a single T (\pi/8) ( π / 8 ) gate in the middle of a random Clifford circuit is sufficient to alter the entanglement spectrum from a Poisson to a Wigner-Dyson distribution.
Clifford circuits are insufficient for universal quantum computation or creating t t -designs with t\ge 4 t ≥ 4 . While the entanglement entropy is not a telltale of this insufficiency, the entanglement spectrum of a time evolved random product state is: the entanglement levels are Poisson-distributed for circuits restricted to the Clifford gate-set, while the levels follow Wigner-Dyson statistics when universal gates are used. In this paper we show, using finite-size scaling analysis of different measures of level spacing statistics, that in the thermodynamic limit, inserting a single T (\pi/8) ( π / 8 ) gate in the middle of a random Clifford circuit is sufficient to alter the entanglement spectrum from a Poisson to a Wigner-Dyson distribution.
The entanglement level statistics of a quantum state have recently been proposed to be a signature of universality in the underlying quantum circuit. This is a consequence of level repulsion in the entanglement spectra being tied to the integrability of entanglement generated. However, such studies of the level-spacing statistics in the entanglement spectrum have thus far been limited to the output states of Clifford and Haar random circuits on product state inputs. In this work, we provide the first example of a circuit which is composed of a simulable gate set, yet has a Wigner-Dyson distributed entanglement level spectrum without any perturbing universal element. We first show that, for matchgate circuits acting on random product states, Wigner-Dyson statistics emerge by virtue of a single SWAP gate, in direct analog to previous studies on Clifford circuits. We then examine the entanglement spectrum of matchgate circuits with varied input states, and find a sharp jump in the complexity of entanglement as we go from two- to three-qubit entangled inputs. Studying Clifford and matchgate hybrid circuits, we find examples of classically simulable circuits whose output states exhibit Wigner-Dyson entanglement level statistics in the absence of universal quantum gate elements. Our study thus provides strong evidence that entanglement spectrum is not strongly connected to notions of simulability in any given quantum circuit.
We show that in a quantum system evolving unitarily under a stochastic quantum circuit the notions of irreversibility, universality of computation, and entanglement are closely related. As the state evolves from an initial product state, it gets asymptotically maximally entangled. We define irreversibility as the failure of searching for a disentangling circuit using a Metropolis-like algorithm. We show that irreversibility corresponds to Wigner–Dyson statistics in the level spacing of the entanglement eigenvalues, and that this is obtained from a quantum circuit made from a set of universal gates for quantum computation. If, on the other hand, the system is evolved with a non-universal set of gates, the statistics of the entanglement level spacing deviates from Wigner–Dyson and the disentangling algorithm succeeds. These results open a new way to characterize irreversibility in quantum systems.
We investigate the emergence of quantum chaos and unitary T-design behavior in derandomized Clifford+T circuits using causal cover architectures. Motivated by the need for deterministic constructions that can exhibit chaotic behavior across diverse quantum hardware platforms, we explore deterministic Clifford circuit architectures (random Clifford circuits with causal cover, bitonic sorting networks, and permutation-based routing circuits) to drive quantum circuits toward Wigner-Dyson (WD) entanglement spectrum statistics and OTOC decay.Our experiments demonstrate that causal connectivity, not circuit depth or randomness, is a critical feature that drives circuits to chaos. We show that initializing with n T-states and adding a second T-layer after a causally covered Clifford evolution yields consistent OTOC decay and WD statistics. This also enables deeper understanding of the circuit structures that generate complex entanglement behavior. Notably, our work suggests polylogarithmic-depth deterministic circuits suffice to approximate chaotic behavior, highlighting that causal connectivity is sufficient for operator spreading to induce Wigner-Dyson entanglement statistics and OTOC decay.
We study the emergence of complexity in deep random N -qubit T -gate-doped Clifford circuits, as reflected in their spectral properties and in magic generation, characterized by the stabilizer Rényi entropy distribution and the nonstabilizing power of the circuit. For pure (undoped) Clifford circuits, a unique periodic orbit structure in the space of Pauli strings implies peculiar spectral correlations and level statistics with large degeneracies. T -gate doping induces an exponentially fast transition to chaotic behavior, described by random matrix theory. We compare these complexity indicators with magic generation properties of the Clifford + T ensemble, and determine the distribution of magic, as well as the average nonstabilizing power of the quantum circuit ensemble. In the dilute limit, N T ≪ N , magic generation is governed by single-qubit behavior. Magic is generated in approximate quanta, increases approximately linearly with the number of T gates, N T , and displays a discrete distribution for small N T . At N T ≈ N , the distribution becomes quasicontinuous, and for N T ≫ N , it converges to that of Haar-random unitaries, and averages to a finite magic density, m 2 , lim N → ∞ 〈 m 2 〉 Haar = 1 . This is in contrast to the spectral transition, where O ( 1 ) T gates suffice to remove spectral degeneracies and to induce a transition to chaotic behavior in the thermodynamic limit. Magic is therefore a more sensitive indicator of complexity.
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.
Measurement-only circuits provide a minimal setting in which repeated local projections can either generate or suppress many-body entanglement, giving rise to measurement-induced phase transitions and dynamical regimes, that might have no unitary counterpart. Here we investigate entanglement and information transitions in one-dimensional measurement-only Clifford circuits with long-range two-qubit parity checks. By tuning both the measurement range and density per layer, we uncover a broad set of phases whose classification requires probes beyond entanglement entropy, such as mutual information, tripartite mutual information, purification from an ancilla, and Bell-cluster statistics. We map phase diagrams using large-scale Clifford simulations for two protocols: a random-basis design in which each measurement is randomly chosen from {XX,YY,ZZ}, and a single-basis design in which the basis is fixed within each layer but varies between layers, hence introducing more structure to the circuit.
We map the trajectory-averaged entanglement entropy to a two-dimensional statistical mechanics model by extending a replica-based method to random-basis measurement-only circuits, and show that a continuous-time limit yields an effective long-range XX hamiltonian in the steady state. This connection links the observed volume-law to sub-volume-law entanglement transition to the boundary between a continuous symmetry broken phase and a critical XY phase. Strikingly, in structured (single-basis) circuits we find a phase in which volume-law and long-range entanglement coexists with rapid, size-independent purification of an ancilla qubit, and the absence of scrambling, highlighting measurement-only circuits as a promising route to efficiently preparing highly entangled and technologically useful quantum states.