Approximate 𝑡-Designs in Generic Circuit Architectures

• DOI: 10.48550/arxiv.2310.19783
• Publication Date: 2024-12-17
• Authors: Daniel Belkin; James Allen; Soumik Ghosh; Christopher Kang; Sophia Lin; James Sud; Frederic T. Chong; Bill Fefferman; Bryan K. Clark
• Keywords: Quantum Physics; Statistical Mechanics (cond-mat.stat-mech); Physics; QC1-999; FOS: Physical sciences; 01 natural sciences; 004; 510; QA76.75-76.765; 0103 physical sciences; Computer software; Quantum Physics (quant-ph); Condensed Matter - Statistical Mechanics

Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate t-designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates. This is accomplished by relating the spectral gaps of such architectures to those of one-dimensional brickwork architectures. Our bound depends on the details of the architecture only via the typical number of layers needed for a block of the circuit to form a connected graph over the sites. When this quantity is bounded, the circuit forms an approximate t-design in at most linear depth. We give numerical evidence for a stronger bound that depends only on the number of connected blocks into which the architecture can be divided. We also give an implicit bound for nondeterministic architectures in terms of properties of the corresponding distribution over fixed architectures. Published by the American Physical Society 2024