Information Scrambling with Conservation Laws
Bibliographic record
Abstract
The delocalization or scrambling of quantum information has emerged as a central ingredient in the understanding of thermalization in isolated quantum many-body systems. Recently, significant progress has been made analytically by modeling non-integrable systems as periodically driven systems, lacking a Hamiltonian picture, while honest Hamiltonian dynamics are frequently limited to small system sizes due to computational constraints. In this paper, we address this by investigating the role of conservation laws (including energy conservation) in the thermalization process from an information-theoretic perspective. For general non-integrable models, we use the equilibrium approximation to show that the maximal amount of information is scrambled (as measured by the tripartite mutual information of the time-evolution operator) at late times even when a system conserves energy. In contrast, we explicate how when a system has additional symmetries that lead to degeneracies in the spectrum, the amount of information scrambled must decrease. This general theory is exemplified in case studies of holographic conformal field theories (CFTs) and the Sachdev-Ye-Kitaev (SYK) model. Due to the large Virasoro symmetry in 1+1D CFTs, we argue that, in a sense, these holographic theories are not maximally chaotic, which is explicitly seen by the non-saturation of the second Rényi tripartite mutual information. The roles of particle-hole and U(1) symmetries in the SYK model are milder due to the degeneracies being only two-fold, which we confirm explicitly at both large- and small-N. We reinterpret the operator entanglement in terms of the growth of local operators, connecting our results with the information scrambling described by out-of-time-ordered correlators, identifying the mechanism for suppressed scrambling from the Heisenberg perspective.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".