Litcius/Paper detail

Quantum Complexity and Chaos in Many-Qudit Doped Clifford Circuits

Beatrice Magni, Xhek Turkeshi

2025Quantum8 citationsDOIOpen Access PDF

Abstract

We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>d</mml:mi> </mml:math> . 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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>T</mml:mi> </mml:math> -gate as a benchmark, we show that higher-dimensional qudits converge faster to Haar-typical stabilizer entropies. For qutrits ( <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>d</mml:mi> <mml:mo>=</mml:mo> <mml:mn>3</mml:mn> </mml:math> ), 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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>O</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>log</mml:mi> <mml:mo>&amp;#x2061;</mml:mo> <mml:mi>N</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:math> non-Clifford gates suffice for approximating Haar expectation values to precision <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>&amp;#x03B5;</mml:mi> </mml:math> , 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.

Topics & Concepts

Quantum entanglementQubitMAGIC (telescope)MathematicsReplicaQuantumClifford algebraEntropy (arrow of time)Dimension (graph theory)Statistical physicsTensor (intrinsic definition)Quantum computerLocalityDiscrete mathematicsComputer scienceTheoretical physicsPhysicsPure mathematicsCurse of dimensionalityElectronic circuitQuantum mechanicsChaoticDirac (video compression format)TetrahedronTopology (electrical circuits)Quantum Computing Algorithms and ArchitectureQuantum-Dot Cellular AutomataQuantum and electron transport phenomena
Quantum Complexity and Chaos in Many-Qudit Doped Clifford Circuits | Litcius