SciPost logo

SciPost Submission Page

Growth and collapse of subsystem complexity under random unitary circuits

by Jeongwan Haah, Douglas Stanford

Submission summary

Authors (as registered SciPost users): Jeongwan Haah
Submission information
Preprint Link: https://arxiv.org/abs/2510.18805v2  (pdf)
Date submitted: Dec. 19, 2025, 6:27 p.m.
Submitted by: Jeongwan Haah
Submitted to: SciPost Physics
Ontological classification
Academic field: Physics
Specialties:
  • High-Energy Physics - Theory
  • Quantum Physics
Approach: Theoretical

Abstract

For chaotic quantum dynamics modeled by random unitary circuits, we study the complexity of reduced density matrices of subsystems as a function of evolution time where the initial global state is a product pure state. The state complexity is defined as the minimum number of local quantum channels to generate a given state from a product state to a good approximation. In $1+1$d, we prove that the complexity of subsystems of length $\ell$ smaller than half grows linearly in time $T$ at least up to $T = \ell / 4$ but becomes zero after time $T = \ell /2$ in the limit of a large local dimension, while the complexity of the complementary subsystem of length larger than half grows linearly in time up to exponentially late times. Using holographic correspondence, we give some evidence that the state complexity of the smaller subsystem should actually grow linearly up to time $T = \ell/2$ and then abruptly decay to zero.

Author indications on fulfilling journal expectations

  • Provide a novel and synergetic link between different research areas.
  • Open a new pathway in an existing or a new research direction, with clear potential for multi-pronged follow-up work
  • Detail a groundbreaking theoretical/experimental/computational discovery
  • Present a breakthrough on a previously-identified and long-standing research stumbling block
Current status:
In refereeing

Reports on this Submission

Report #1 by Anonymous (Referee 1) on 2026-1-14 (Invited Report)

Strengths

1-Clearly describes and motivates the questions about the computational complexity of mixed states which are studied in the paper, and describes their physical implications, with potential applications in high energy theory;
2-Clearly states definitions and results for brickwork random circuits, which build upon prior work for pure state and unitary circuit complexity;
3-Describes a few other interesting results and conjectures, e.g. on maximal sets of pairwise distinguishable or nearly orthogonal mixed states and potential broader implications for quantum Shannon theory

Weaknesses

1-Though this might be outside of the scope of this work, the paper doesn't explicitly describe the connection between the brickwork random circuit setting and the "holographic analog", aside from observations about their entanglement features, and it is not clear to what extent the brickwork random circuit accurately models the circuit complexity of CFT Hamiltonian dynamics

Report

The paper studies various questions related to the computational complexity of a fixed subsystem and how it changes under time dynamics, and makes several novel contributions. It extends techniques from the literature in the pure state and unitary circuit setting to study mixed state complexity, opening up the potential for further work.

Recommendation

Publish (meets expectations and criteria for this Journal)

  • validity: high
  • significance: high
  • originality: good
  • clarity: good
  • formatting: good
  • grammar: perfect

Login to report or comment