arXiv:2609.39458
Optimal Scaling of Unitary Design Formation in $U(1)$-Symmetric Random Circuits: A Bottleneck Slower than Charge Transport
Toshihiro Yada
Abstract
Understanding randomness formation under conservation laws is important both for characterizing chaotic phenomena in isolated quantum systems and for symmetry-constrained quantum information processing. $U(1)$-symmetric random circuits on an $N$-qubit system provide a minimal tractable setting for this problem, in which the formation rate of unitary designs was conjectured to be governed by charge transport in the underlying circuit geometry. However, whether charge transport indeed sets the slowest relaxation mode has remained an open problem, due to the difficulty in deriving a tight lower bound on the symmetric design formation rate. In this work, we resolve this problem by determining the optimal scaling of the unitary $k$-design formation rate for $k\leq O(\sqrt{\log N})$ across a wide range of circuit geometries, including lattices, expander graphs, and all-to-all interactions. In particular, for $k\geq 2$, we find that the formation rate is governed by a two-particle encounter rate---the rate at which two random walkers encounter each other in a given circuit geometry. This encounter rate is parametrically smaller than the single-particle transport rate in many geometries, thereby disproving the previous conjecture. We further establish that this encounter mechanism indeed sets the design formation rate by deriving its matching lower bound with a novel proof technique based on an auxiliary subgroup ensemble. Although this encounter mode imposes a robust bottleneck on design formation in $U(1)$-symmetric random circuits, we also show that this bottleneck can be circumvented by using symmetry-breaking local gates and provide an explicit protocol that achieves faster design formation. These results establish a new picture of randomness formation under conservation laws and provide guiding principles for characterizing and efficiently generating symmetry-constrained randomness.
AI Summary
The paper asks whether charge transport determines how quickly local $U(1)$-symmetric random circuits approach the moments of global $U(1)$-symmetric Haar randomness. It instead identifies a two-particle encounter bottleneck and proves matching spectral-gap bounds for $2\leq k\leq O(\sqrt{\log N})$. For single-edge circuits, the gap is $\Delta^{(k)}=\Theta(\lambda^{\rm enc})$, where $\lambda^{\rm enc}$ is the decay rate of two random walkers killed when their connecting edge is selected. Parallel and constant-depth fixed architectures have gaps $\Theta(N\lambda^{\rm enc})$ under the stated graph assumptions. Thus parallel-layer gaps scale as $\Theta(N^{-2})$ in 1D, $\Theta((N\log N)^{-1})$ in 2D, and $\Theta(N^{-1})$ in higher-dimensional lattices, expanders, and all-to-all circuits. Unlike the first moment, higher moments can therefore relax parametrically more slowly than charge transport. The upper bound embeds this encounter process exactly into a second-moment charge sector. The lower bound compares local circuits with an auxiliary ensemble generated by site permutations and two-qubit diagonal phases, supplemented by symmetric Haar gates; this avoids conventional finite-size bootstrap arguments. Allowing symmetry-breaking intermediate gates while keeping every final unitary symmetric gives constant-gap units of depth $O(N^{1/\alpha}k^3(\log k)^6)$ on $\alpha$-dimensional lattices and polylogarithmic depth in $N$ for fixed $k$ with all-to-all connectivity. These constructions cover $k\leq O(\log N/\log\log N)$. The optimality concerns spectral gaps/operator-norm convergence, not matching additive- or relative-error design depths. Higher moments remain unresolved; the encounter bottleneck is established in dilute/dense sectors, not bulk-charge sectors, and implications for generic Hamiltonian dynamics remain speculative.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 93 pages, 4 figures