One Gate at a Time: Complexity Growth in Random Quantum Circuits

A random unitary quantum circuit is expected to be incompressible for exponentially long times. We show that the constant-error circuit complexity of a random unitary circuit grows almost linearly with time as $Ω(T/\log T)$. The bound holds for all $2\leq T\leq 4^n$ where $n$ is the system size, and involves no other $n$-dependence. This improves previous lower bounds derived from spectral gaps and unitary designs by a factor of $\mathrm{poly}(n)$. Drawing on insights from stochastic calculus, geometric functional analysis, and randomized linear algebra, our approach exploits the circuit's response to variations of individual gates and requires no control over convergence to high-order unitary designs.

Source: arXiv:2609.17457v1 - http://arxiv.org/abs/2609.17457v1 PDF: https://arxiv.org/pdf/2609.17457v1 Original Link: http://arxiv.org/abs/2609.17457v1