Search

We study the dynamical generation of randomness in Brownian systems as a function of the degree of locality of the Hamiltonian. We first express the trace distance to a unitary design for these systems in terms of an effective equilibrium thermal partition function, and provide a set of conditions that guarantee a linear time to design. We relate the trace distance to design to spectral properties of the time-evolution operator. We apply these considerations to the Brownian $p$-SYK model as a function of the degree of locality $p$. We show that the time to design is linear, with a slope proportional to $1/p$. We corroborate that when $p$ is of order the system size this reproduces the behavior of a completely non-local Brownian model of random matrices. For the random matrix model, we reinterpret these results from the point of view of classical Brownian motion in the unitary manifold. Therefore, we find that the generation of randomness typically persists for exponentially long times in the system size, even for systems governed by highly non-local time-dependent Hamiltonians. We conjecture this to be a general property: there is no efficient way to generate approximate Haar random unitaries dynamically, unless a large degree of fine-tuning is present in the ensemble of time-dependent Hamiltonians. We contrast the slow generation of randomness to the growth of quantum complexity of the time-evolution operator. Using known bounds on circuit complexity for unitary designs, we obtain a lower bound determining that complexity grows at least linearly in time for Brownian systems. We argue that these bounds on circuit complexity are far from tight and that complexity grows at a much faster rate, at least for non-local systems., Comment: 40 pages + appendices

Krylov complexity is a novel observable for detecting quantum chaos, and an indicator of a possible gravity dual. In this paper, we compute the Krylov complexity and the associated Lanczos coefficients in the SU(2) Yang-Mills theory, which can be reduced to a nonlinearly coupled harmonic oscillators (CHO) model. We show that there exists a chaotic transition in the growth of Krylov complexity. The Krylov complexity shows a quadratic growth in the early time stage and then grows linearly. The corresponding Lanczos coefficient satisfies the universal operator growth hypothesis, i.e., grows linearly first and then enters the saturation plateau. By the linear growth of Lanczos coefficients, we obtain an upper bound of the quantum Lyapunov exponent. Finally, we investigate the effect of different energy sectors on the K-complexity and Lanczos coefficients., Comment: 23 pages, 17 figures