Chaos and complexity by design
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 7 Pith papers
-
Smooth horizons from topology change in canonical quantum gravity
Topology change in canonical JT gravity resolves the firewall paradox by making the connected two-interior branch dominate after Page time, with gravitational constraints annihilating the firewall branch and identifyi...
-
Unitary Designs from Two Chaotic Hamiltonians and a Random Pauli Operation
Unitary designs emerge from the temporal ensemble of two chaotic Hamiltonian evolutions separated by a random Pauli operation, based on the universal Pauli spectrum.
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
Post-Selection Probability and Fidelity of Bidirectional Teleportation
Post-selection probability and fidelity of bidirectional teleportation are expressed via the Loschmidt echo, revealing initial-state dependence of fidelity and stability of probability in integrable models.
-
Rethinking quantum information in gravity and fields
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
-
Krylov Complexity
Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.
-
Quantum analogues of exponential sensitivity: from Loschmidt echo to Krylov complexity
This review surveys the Loschmidt echo, OTOCs, and Krylov complexity as quantum proxies for classical Lyapunov exponents in chaotic systems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.