Growth and collapse of subsystem complexity under random unitary circuits

• URL: http://arxiv.org/abs/2510.18805v1
• Date: Tue, 21 Oct 2025 16:59:34 GMT
• Title: Growth and collapse of subsystem complexity under random unitary circuits
• Authors: Jeongwan Haah, Douglas Stanford,
• Abstract summary: We study the complexity of reduced density matrices of subsystems as a function of evolution time.<n>The state complexity is defined as the minimum number of local quantum channels to generate a given state.<n>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.
• Score: 0.34376560669160394
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 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.

Related papers

• Sharp Transitions for Subsystem Complexity [0.0]
  We study the circuit complexity of time-evolved subsystems of pure quantum states.<n>We find that for greater-than-half subsystem sizes, the complexity grows linearly in time for an exponentially long time.<n>For less-than-half subsystem sizes, the complexity rises and then falls, returning to low complexity as the subsystem equilibrates.
  arXiv  Detail & Related papers  (2025-10-21T17:28:00Z)
• Out-of-equilibrium dynamics across the first-order quantum transitions of one-dimensional quantum Ising models [0.0]
  We study the out-of-equilibrium dynamics of one-dimensional quantum Ising models in a transverse field $g$.<n>We consider nearest-neighbor Ising chains of size $L$ with periodic boundary conditions.
  arXiv  Detail & Related papers  (2025-04-14T20:00:27Z)
• Measuring quantum relative entropy with finite-size effect [53.64687146666141]
  We study the estimation of relative entropy $D(rho|sigma)$ when $sigma$ is known.<n>Our estimator attains the Cram'er-Rao type bound when the dimension $d$ is fixed.
  arXiv  Detail & Related papers  (2024-06-25T06:07:20Z)
• Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs [56.237917407785545]
  We consider the problem of learning an $varepsilon$-optimal policy in a general class of continuous-space Markov decision processes (MDPs) having smooth Bellman operators. Key to our solution is a novel projection technique based on ideas from harmonic analysis. Our result bridges the gap between two popular but conflicting perspectives on continuous-space MDPs.
  arXiv  Detail & Related papers  (2024-05-10T09:58:47Z)
• Constructions of $k$-uniform states in heterogeneous systems [65.63939256159891]
  We present two general methods to construct $k$-uniform states in the heterogeneous systems for general $k$. We can produce many new $k$-uniform states such that the local dimension of each subsystem can be a prime power.
  arXiv  Detail & Related papers  (2023-05-22T06:58:16Z)
• Detection-Recovery Gap for Planted Dense Cycles [72.4451045270967]
  We consider a model where a dense cycle with expected bandwidth $n tau$ and edge density $p$ is planted in an ErdHos-R'enyi graph $G(n,q)$. We characterize the computational thresholds for the associated detection and recovery problems for the class of low-degree algorithms.
  arXiv  Detail & Related papers  (2023-02-13T22:51:07Z)
• Sharp complexity phase transitions generated by entanglement [0.0]
  We quantitatively connect the entanglement present in certain quantum systems to the computational complexity of simulating those systems. Specifically, we consider the task of simulating single-qubit measurements of $k$--regular graph states on $n$ qubits.
  arXiv  Detail & Related papers  (2022-12-20T19:00:08Z)
• Complexity Growth in Integrable and Chaotic Models [0.0]
  We use the SYK family of models with $N$ Majorana fermions to study the complexity of time evolution. We study how this linear growth is eventually truncated by the appearance and accumulation of conjugate points.
  arXiv  Detail & Related papers  (2021-01-06T19:00:00Z)
• Scattering data and bound states of a squeezed double-layer structure [77.34726150561087]
  A structure composed of two parallel homogeneous layers is studied in the limit as their widths $l_j$ and $l_j$, and the distance between them $r$ shrinks to zero simultaneously. The existence of non-trivial bound states is proven in the squeezing limit, including the particular example of the squeezed potential in the form of the derivative of Dirac's delta function. The scenario how a single bound state survives in the squeezed system from a finite number of bound states in the finite system is described in detail.
  arXiv  Detail & Related papers  (2020-11-23T14:40:27Z)
• The Rise of Cosmological Complexity: Saturation of Growth and Chaos [0.0]
  We find a bound on the growth of complexity for both expanding and contracting backgrounds. For expanding backgrounds that preserve the null energy condition, de Sitter space has the largest rate of growth of complexity.
  arXiv  Detail & Related papers  (2020-05-21T18:37:28Z)
• Anisotropy-mediated reentrant localization [62.997667081978825]
  We consider a 2d dipolar system, $d=2$, with the generalized dipole-dipole interaction $sim r-a$, and the power $a$ controlled experimentally in trapped-ion or Rydberg-atom systems. We show that the spatially homogeneous tilt $beta$ of the dipoles giving rise to the anisotropic dipole exchange leads to the non-trivial reentrant localization beyond the locator expansion.
  arXiv  Detail & Related papers  (2020-01-31T19:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.