Designs from Local Random Quantum Circuits with SU(d) Symmetry

Abstract

The generation of $k$-designs (pseudorandom distributions that emulate the Haar measure up to $k$ moments) with local quantum circuit ensembles is a problem of fundamental importance in quantum information and physics. Despite the extensive understanding of this problem for ordinary random circuits, the crucial situations where symmetries or conservation laws are in play are known to pose fundamental challenges and remain little understood. We construct, for the first time, explicit local unitary ensembles that can achieve high-order unitary $k$-designs under transversal continuous symmetry, in the particularly important SU$(d)$ case. Specifically, we define the Convolutional Quantum Alternating group (CQA) generated by 4-local SU$(d)$-symmetric Hamiltonians as well as associated 4-local SU$(d)$-symmetric random unitary circuit ensembles, and prove that they form and converge to SU$(d)$-symmetric $k$-designs, respectively, for all $k<n(n-3)/2$ with $n$ being the number of qudits. A key technique that we employ to obtain the results is the Okounkov--Vershik approach to $S_n$ representation theory. To study the convergence time of the CQA ensemble, we develop a numerical method using the Young orthogonal form and $S_n$ branching rule. We provide strong evidence for a subconstant spectral gap and certain convergence time scales of various important circuit architectures, which contrast with the symmetry-free case. We also provide comprehensive explanations of the difficulties and limitations in rigorously analyzing the convergence time using methods that have been effective for cases without symmetries, including Knabe's local gap threshold and Nachtergaele's martingale methods. This suggests that a novel approach is likely necessary for understanding the convergence time of SU$(d)$-symmetric local random circuits.

16+38 pages

References in corpus (60)

• Barren plateaus in quantum neural network training landscapes
• Black holes as mirrors: quantum information in random subsystems
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Fast Scramblers
• Operator Spreading in Random Unitary Circuits
• Chaos in quantum channels
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Quantum Entanglement Growth Under Random Unitary Dynamics
• Operator spreading and the emergence of dissipative hydrodynamics under unitary evolution with conservation laws
• Chaos and complexity by design
• Restrictions on Transversal Encoded Quantum Gate Sets
• Evenly distributed unitaries: on the structure of unitary designs
• Random Quantum Circuits are Approximate 2-designs
• Local random quantum circuits are approximate polynomial-designs
• Diffusive hydrodynamics of out-of-time-ordered correlators with charge conservation
• Chaos, Complexity, and Random Matrices
• Multiqubit Clifford groups are unitary 3-designs
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Efficient Generation of Generic Entanglement
• Models of quantum complexity growth
• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Symmetry restoration and quantum Mpemba effect in symmetric random circuits
• Convergence Conditions for Random Quantum Circuits
• Convergence rates for arbitrary statistical moments of random quantum circuits
• Symmetry Principles in Quantum Systems Theory
• Symmetry-adapted variational quantum eigensolver
• Exact convergence times for generation of random bipartite entanglement
• Emergence of typical entanglement in two-party random processes
• Restrictions on realizable unitary operations imposed by symmetry and locality
• Finite-size scaling of out-of-time-ordered correlators at late times
• Anticoncentration theorems for schemes showing a quantum speedup
• Local gap threshold for frustration-free spin systems
• Entanglement, quantum randomness, and complexity beyond scrambling
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
• Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ansätze
• Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
• Critical phase and spin sharpening in SU(2)-symmetric monitored quantum circuits
• Non-Abelian symmetry can increase entanglement entropy
• Generalized Entanglement Entropies of Quantum Designs
• Clifford algebras and universal sets of quantum gates
• Complete entropic inequalities for quantum Markov chains
• An efficient high dimensional quantum Schur transform
• Error Correction of Quantum Reference Frame Information
• New perspectives on covariant quantum error correction
• Optimal two-qubit gate for generation of random bipartite entanglement
• Model-Independent Learning of Quantum Phases of Matter with Quantum Convolutional Neural Networks
• Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
• Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
• A simple proof of the detectability lemma and spectral gap amplification
• Soft mode and interior operator in Hayden-Preskill thought experiment
• Optimal Universal Quantum Error Correction via Bounded Reference Frames
• Criteria for universality of quantum gates
• Scrambling and decoding the charged quantum information
• Compact Hermitian Young Projection Operators
• Black holes as clouded mirrors: the Hayden-Preskill protocol with symmetry
• Approximate symmetries and quantum error correction
• On squares of representations of compact Lie algebras
• Rotationally-Invariant Circuits: Universality with the exchange interaction and two ancilla qubits
• Clifford Group and Unitary Designs under Symmetry
• Charge transport, information scrambling and quantum operator-coherence in a many-body system with U(1) symmetry

Cited by in corpus (9)

• Deep thermalization under charge-conserving quantum dynamics
• Unitary Designs of Symmetric Local Random Circuits
• Toward Super-polynomial Quantum Speedup of Equivariant Quantum Algorithms with SU($d$) Symmetry
• Covariant Quantum Error-Correcting Codes with Metrological Entanglement Advantage
• Characterization of randomness in quantum circuits of continuous gate sets
• SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning
• Numerical evidence for the non-Abelian eigenstate thermalization hypothesis
• Non-Universality from Conserved Superoperators in Unitary Circuits
• Noisy Monitored Quantum Circuits