Chaos and complexity by design
Daniel A. Roberts, Beni Yoshida
TL;DR
This paper builds a rigorous link between quantum chaos and pseudorandomness by showing that higher-point OTO correlators probe unitary $k$-designs through the frame potential. It proves a precise correspondence between averaged $2k$-point OTOs and the $k$-fold channel, and derives a frame-potential-based bound connecting chaoticity to circuit complexity. The authors compute Haar averages for multi-point correlators to characterize when ensembles mimic Haar randomness and discuss time-averaged dynamics versus true randomness. They also extend these ideas to continuous and thermal ensembles, outlining implications for holography and complexity growth in chaotic systems. Overall, the work provides a quantitative framework linking chaos, randomness, and computational complexity in quantum dynamics.
Abstract
We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the "frame potential," which is minimized by unitary $k$-designs and measures the $2$-norm distance between the Haar random unitary ensemble and another ensemble. A natural probe of quantum chaos is out-of-time-order (OTO) four-point correlation functions. We show that the norm squared of a generalization of out-of-time-order $2k$-point correlators is proportional to the $k$th frame potential, providing a quantitative connection between chaos and pseudorandomness. Additionally, we prove that these $2k$-point correlators for Pauli operators completely determine the $k$-fold channel of an ensemble of unitary operators. Finally, we use a counting argument to obtain a lower bound on the quantum circuit complexity in terms of the frame potential. This provides a direct link between chaos, complexity, and randomness.
