Non-Haar random circuits form unitary designs as fast as Haar random circuits
arXiv:2504.07390 · doi:10.1103/q172-8cmt
Abstract
The unitary design formation in random circuits has attracted considerable attention due to its wide range of practical applications and relevance to fundamental physics. While the formation rates in Haar random circuits have been extensively studied in previous works, it remains an open question how these rates are affected by the choice of local randomizers. In this work, we prove that the circuit depths required for general non-Haar random circuits to form unitary designs are upper bounded by those for the corresponding Haar random circuits, up to a constant factor independent of the system size. This result is derived in a broad range of circuit structures, including one- and higher-dimensional lattices, geometrically non-local configurations, and even extremely shallow circuits with patchwork architectures. We provide specific applications of these results in randomized benchmarking and random circuit sampling, and also discuss their implications for quantum many-body physics. Our work lays the foundation for flexible and robust randomness generation in real-world experiments, and offers new insights into chaotic dynamics in complex quantum systems.
30 pages, 4 figures
References in corpus (33)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Characterizing Quantum Supremacy in Near-Term Devices
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Operator Spreading in Random Unitary Circuits
- Quantum Entanglement Growth Under Random Unitary Dynamics
- Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws
- Random Quantum Circuits
- Chaos and complexity by design
- The randomized measurement toolbox
- Random Quantum Circuits are Approximate 2-designs
- Local random quantum circuits are approximate polynomial-designs
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Multiqubit Clifford groups are unitary 3-designs
- Preparing random states and benchmarking with many-body quantum chaos
- Linear growth of quantum circuit complexity
- Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
- A general framework for randomized benchmarking
- Approximate unitary -designs by short random quantum circuits using nearest-neighbor and long-range gates
- Models of quantum complexity growth
- Exact emergent quantum state designs from quantum chaotic dynamics
- Phase transition in Random Circuit Sampling
- Convergence rates for arbitrary statistical moments of random quantum circuits
- Random quantum circuits are approximate unitary -designs in depth
- Matchgate Shadows for Fermionic Quantum Simulation
- Decoupling with unitary approximate two-designs
- Anticoncentration theorems for schemes showing a quantum speedup
- Characterizing complexity of many-body quantum dynamics by higher-order eigenstate thermalization
- 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
- Entanglement measures of bipartite quantum gates and their thermalization under arbitrary interaction strength
- Unitary Designs of Symmetric Local Random Circuits
- Characterization of randomness in quantum circuits of continuous gate sets
- Saturation and recurrence of quantum complexity in random local quantum dynamics