Convergence rates for arbitrary statistical moments of random quantum circuits

Abstract

We consider a class of random quantum circuits where at each step a gate from a universal set is applied to a random pair of qubits, and determine how quickly averages of arbitrary finite-degree polynomials in the matrix elements of the resulting unitary converge to Haar measure averages. This is accomplished by establishing an exact mapping between the superoperator that describes t-order moments on n qubits and a multilevel SU(4^t) Lipkin-Meshkov-Glick Hamiltonian. For arbitrary fixed t, we find that the spectral gap scales as 1/n in the thermodynamic limit. Our results imply that random quantum circuits yield an efficient implementation of ε-approximate unitary t-designs.

4 pages, 1 figure 2nd revised version with supplementary material

References in corpus (9)

• Evenly distributed unitaries: on the structure of unitary designs
• Randomizing quantum states: Constructions and applications
• Superdense coding of quantum states
• Exact convergence times for generation of random bipartite entanglement
• Emergence of typical entanglement in two-party random processes
• Selective and Efficient Quantum Process Tomography
• Optimal two-qubit gate for generation of random bipartite entanglement
• Parameters of Pseudo-Random Quantum Circuits
• Quantum pseudo-randomness from cluster-state quantum computation

Cited by in corpus (68)

• A bound on chaos
• Chaos and complexity by design
• Towards the fast scrambling conjecture
• Local random quantum circuits are approximate polynomial-designs
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Exact dynamics in dual-unitary quantum circuits
• Operator growth in the SYK model
• Onset of Random Matrix Behavior in Scrambling Systems
• Quantum Epidemiology: Operator Growth, Thermal Effects, and SYK
• 64-Qubit Quantum Circuit Simulation
• Complex Networks from Classical to Quantum
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Universal behavior beyond multifractality of wave-functions at measurement--induced phase transitions
• Scrambling in Random Unitary Circuits: Exact Results
• Decoupling with random quantum circuits
• Quantum chaos in the Brownian SYK model with large finite $N$: OTOCs and tripartite information
• Random quantum circuits anti-concentrate in log depth
• A Random Unitary Circuit Model for Black Hole Evaporation
• The complexity of energy eigenstates as a mechanism for equilibration
• Chaos in Classical D0-Brane Mechanics
• Driven quantum dynamics: will it blend?
• Unitary designs from statistical mechanics in random quantum circuits
• Efficient Quantum Pseudorandomness
• Mixing properties of stochastic quantum Hamiltonians
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Scrambling speed of random quantum circuits
• Subsystem dynamics under random Hamiltonian evolution
• Quantum complexity in gravity, quantum field theory, and quantum information science
• Comment on the paper "Random Quantum Circuits are Approximate 2-designs"
• Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
• Fastest local entanglement scrambler, multistage thermalization, and a non-Hermitian phantom
• Isospectral twirling and quantum chaos
• Universally Robust Quantum Control
• Translation symmetry restoration under random unitary dynamics
• Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
• Solvable non-Hermitian skin effect in many-body unitary dynamics
• Ensembles of physical states and random quantum circuits on graphs
• Retrieving information from a black hole using quantum machine learning
• Optimal training of variational quantum algorithms without barren plateaus
• Efficient quantum pseudorandomness with simple graph states
• Short random circuits define good quantum error correcting codes
• Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice
• Stringy effects in scrambling
• Growth of genuine multipartite entanglement in random unitary circuits
• Local random quantum circuits are approximate polynomial-designs - numerical results
• Operator growth in random quantum circuits with symmetry
• Multiphoton Tomography with Linear Optics and Photon Counting
• From observations to complexity of quantum states via unsupervised learning
• Observation of entanglement negativity transition of pseudo-random mixed states
• Unraveling the emergence of quantum state designs in systems with symmetry
• Experimental Implementation of Efficient Quantum Pseudorandomness on a 12-spin System
• Quantum Information Scrambling Through a High-Complexity Operator Mapping
• Unitary k-designs from random number-conserving quantum circuits
• Designs from Local Random Quantum Circuits with SU(d) Symmetry
• Complexity is not Enough for Randomness
• Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras
• Saturation and recurrence of quantum complexity in random local quantum dynamics
• Shell model results for $T=1$ and $T=0$ bands in ${}^{66}$As
• Local random quantum circuits: ensemble CP maps and swap algebras
• Effective field theory of random quantum circuits
• Pseudo-Random Circuits from Clifford Plus T-Gates
• Generic pure quantum states as steady states of quasi-local dissipative dynamics
• Non-Haar random circuits form unitary designs as fast as Haar random circuits
• Exact spectral gaps of random one-dimensional quantum circuits
• Random Circuits in the Black Hole Interior
• Moments of Quantum Channel Ensembles
• Anticoncentration is (almost) all you need
• Response to "Entanglement growth in diffusive systems with large spin"