Quantum Complexity and Chaos in Many-Qudit Doped Clifford Circuits
- URL: http://arxiv.org/abs/2506.02127v3
- Date: Sat, 12 Jul 2025 10:33:33 GMT
- Title: Quantum Complexity and Chaos in Many-Qudit Doped Clifford Circuits
- Authors: Beatrice Magni, Xhek Turkeshi,
- Abstract summary: We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension $d$.<n>Using doped Clifford Weingarten calculus and a replica tensor network formalism, we derive exact results and perform large-scale simulations.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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 $\varepsilon$, 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.
Related papers
- Unlocking early fault-tolerant quantum computing with mitigated magic dilution [47.23243191431113]
We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<n>We employ quantum error mitigation techniques to sample logical circuits given noisy encoded magic states.<n>This work paves the way for early fault-tolerant demonstrations on devices supporting millions of quantum operations.
arXiv Detail & Related papers (2025-05-15T17:19:19Z) - Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary.<n>We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
arXiv Detail & Related papers (2025-04-22T16:10:34Z) - Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States [0.0]
Anticoncentration describes how an ensemble of quantum states spreads over the allowed Hilbert space.<n>We investigate the anticoncentration of random Clifford circuits toward the overlap distribution of random stabilizer states.<n>We show that inserting a polylogarithmic in qudit number of $T$-states is sufficient to drive the overlap distribution toward the Porter-Thomas statistics.
arXiv Detail & Related papers (2025-02-27T19:00:29Z) - Clifford-Dressed Variational Principles for Precise Loschmidt Echoes [44.99833362998488]
We extend the recently introduced Clifford dressed Time-Dependent Variational Principle (TDVP) to efficiently compute many-body wavefunction amplitudes in the computational basis.<n>By incorporating Clifford disentangling gates during TDVP evolution, our method effectively controls entanglement growth while keeping the computation of these amplitudes accessible.
arXiv Detail & Related papers (2025-02-03T22:43:32Z) - Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states [0.552480439325792]
We investigate the classical simulatability of $N$-qubit Clifford circuits doped with $t$ number of $T$-gates.<n>We use a simple disentangling algorithm to reduce the entanglement of the MPS component in CAMPS using control-Pauli gates.<n>This work establishes a versatile framework based on CAMPS for understanding classical simulatability of $t$-doped circuits.
arXiv Detail & Related papers (2024-12-23T01:26:40Z) - Spectral Properties Versus Magic Generation in $T$-doped Random Clifford Circuits [1.1517315048749441]
We study the emergence of complexity in deep random $N$--qubit $T$gate doped Clifford circuits.<n>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.
arXiv Detail & Related papers (2024-12-20T14:04:51Z) - Disentangling critical quantum spin chains with Clifford circuits [39.58317527488534]
We explore the power of the CAMPS method in critical spin chains described by conformal field theories (CFTs) in the scaling limit.<n>We find that the optimized disentanglers correspond to it duality transformations, which significantly reduce the entanglement entropy in the ground state.<n>Our results highlight the potential of the framework as a versatile tool for uncovering hidden dualities and simplifying the entanglement structure of critical quantum systems.
arXiv Detail & Related papers (2024-11-19T17:39:54Z) - Magic spreading in random quantum circuits [0.0]
We show how rapidly do generic many-body dynamics generate magic resources under the constraints of locality and unitarity.<n>We demonstrate that magic resources equilibrate on timescales logarithmic in the system size, akin to anti-concentration and Hilbert space delocalization phenomena.<n>As random circuits are minimal models for chaotic dynamics, we conjecture that our findings describe the phenomenology of magic resources growth in a broad class of chaotic many-body systems.
arXiv Detail & Related papers (2024-07-04T13:43:46Z) - KPZ scaling from the Krylov space [83.88591755871734]
Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported.
Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
arXiv Detail & Related papers (2024-06-04T20:57:59Z) - Simulation of IBM's kicked Ising experiment with Projected Entangled
Pair Operator [71.10376783074766]
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation.
Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture.
We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
arXiv Detail & Related papers (2023-08-06T10:24:23Z) - Efficient quantum algorithms for stabilizer entropies [0.0]
We efficiently measure stabilizer entropies (SEs) for integer R'enyi index $n>1$ via Bell measurements.
We provide efficient bounds of various nonstabilizerness monotones which are intractable to compute beyond a few qubits.
Our results open up the exploration of nonstabilizerness with quantum computers.
arXiv Detail & Related papers (2023-05-30T15:55:04Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.