Linear Growth of Circuit Complexity from Brownian Dynamics
Shao-Kai Jian, Gregory Bentsen, Brian Swingle
TL;DR
The paper demonstrates that Brownian quantum many-body systems—spin and fermionic clusters with time-dependent all-to-all interactions—generate approximate unitary $k$-designs in times that scale linearly with $kN$, by mapping the Frame Potential to an effective statistical-mechanics problem and solving it via path integrals and mean-field Hamiltonians. It provides explicit results for Brownian spin clusters and Brownian SYK fermions, including ground-state degeneracies and spectral gaps that control the approach to Haar randomness, and extends the analysis to time-independent chaotic Hamiltonians perturbed by random noise. The work connects quantum chaos, replica methods, and holographic ideas (via replica wormholes) to a concrete, analytically tractable picture of linear growth of circuit complexity. Overall, it establishes a robust framework showing that simple Brownian dynamics can realize fast, linearly-scaling design generation with clear quantitative bounds, with potential implications for quantum randomness, benchmarking, and holographic complexity.
Abstract
We calculate the frame potential for Brownian clusters of $N$ spins or fermions with time-dependent all-to-all interactions. In both cases the problem can be mapped to an effective statistical mechanics problem which we study using a path integral approach. We argue that the $k$th frame potential comes within $ε$ of the Haar value after a time of order $t \sim k N + k \log k + \log ε^{-1}$. Using a bound on the diamond norm, this implies that such circuits are capable of coming very close to a unitary $k$-design after a time of order $t \sim k N$. We also consider the same question for systems with a time-independent Hamiltonian and argue that a small amount of time-dependent randomness is sufficient to generate a $k$-design in linear time provided the underlying Hamiltonian is quantum chaotic. These models provide explicit examples of linear complexity growth that are also analytically tractable.
