Entanglement, quantum randomness, and complexity beyond scrambling

Abstract

Scrambling is a process by which the state of a quantum system is effectively randomized due to the global entanglement that "hides" initially localized quantum information. Closely related notions include quantum chaos and thermalization. Such phenomena play key roles in the study of quantum gravity, many-body physics, quantum statistical mechanics, quantum information etc. Scrambling can exhibit different complexities depending on the degree of randomness it produces. For example, notice that the complete randomization implies scrambling, but the converse does not hold; in fact, there is a significant complexity gap between them. In this work, we lay the mathematical foundations of studying randomness complexities beyond scrambling by entanglement properties. We do so by analyzing the generalized (in particular Rényi) entanglement entropies of designs, i.e. ensembles of unitary channels or pure states that mimic the uniformly random distribution (given by the Haar measure) up to certain moments. A main collective conclusion is that the Rényi entanglement entropies averaged over designs of the same order are almost maximal. This links the orders of entropy and design, and therefore suggests Rényi entanglement entropies as diagnostics of the randomness complexity of corresponding designs. Such complexities form a hierarchy between information scrambling and Haar randomness. As a strong separation result, we prove the existence of (state) 2-designs such that the Rényi entanglement entropies of higher orders can be bounded away from the maximum. However, we also show that the min entanglement entropy is maximized by designs of order only logarithmic in the dimension of the system. In other words, logarithmic-designs already achieve the complexity of Haar in terms of entanglement, which we also call max-scrambling. This result leads to a generalization of the fast scrambling conjecture, that max-scrambling can be achieved by physical dynamics in time roughly linear in the number of degrees of freedom.

Generalized Entanglement Entropies of Quantum Designs

“…We noticed that similar results have been derived and rederived several times [12,[28][29][30][31]. A simple derivation was presented in [22].…”

“…Similarly, these results do not deviate much for approximate unitary designs (see [22] for detailed error analysis).…”

“…So the near-maximality of the Rényi entanglement entropies of half-half partitions ensures that those of all partitions are almost maximal. See [22] for details of the above arguments.…”

“…First, consider equal partitions d A = d B and the limit of large dimension. Here we introduce the following cycle lemma (proof in [22], cf. [32]): for all σ ∈ S α , ξ(στ ) + ξ(σ) ≤ α + 1.…”

Scrambling via braiding of nonabelions

“…We thank Zi-Wen Liu for pointing out refs. [23,24] to us and helpful discussions. Z.-C. Y. and C. C. are supported by DOE Grant No.…”