Growth of block diagonal operators and symmetry-resolved Krylov complexity

• URL: http://arxiv.org/abs/2507.02033v1
• Date: Wed, 02 Jul 2025 18:00:00 GMT
• Title: Growth of block diagonal operators and symmetry-resolved Krylov complexity
• Authors: Pawel Caputa, Giuseppe Di Giulio, Tran Quang Loc,
• Abstract summary: This work addresses how the growth of invariant operators is influenced by their underlying symmetry structure.<n>We introduce the symmetry-resolved Krylov complexity, which captures the time evolution of each block into which an operator, invariant under a given symmetry, can be decomposed.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work addresses how the growth of invariant operators is influenced by their underlying symmetry structure. For this purpose, we introduce the symmetry-resolved Krylov complexity, which captures the time evolution of each block into which an operator, invariant under a given symmetry, can be decomposed. We find that, at early times, the complexity of the full operator is equal to the average of the symmetry-resolved contributions. At later times, however, the interplay among different charge sectors becomes more intricate. In general, the symmetry-resolved Krylov complexity depends on the charge sector, although in some cases this dependence disappears, leading to a form of Krylov complexity equipartition. Our analysis lays the groundwork for a broader application of symmetry structures in the study of Krylov space complexities with implications for thermalization and universality in many-body quantum systems.

Related papers

• Generalized Krylov Complexity [0.0]
  We extend the concept of Krylov complexity to include general unitary evolutions involving multiple generators.<n>This generalization serves as a measure of the complexity of states associated with continuous symmetries within a model.
  arXiv  Detail & Related papers  (2025-07-31T17:23:03Z)
• Quantum complexity phase transition in fermionic quantum circuits [14.723621424225973]
  We develop a general scaling theory for Krylov complexity phase transitions on quantum percolation models.<n>For non-interacting systems across diverse lattices, our scaling theory reveals that the KCPT coincides with the classical percolation transition.<n>For interacting systems, we find the KCPT develops a generic separation from the percolation transition due to the highly complex quantum many-body effects.
  arXiv  Detail & Related papers  (2025-07-29T18:00:25Z)
• Exactly solvable models for universal operator growth [15.236546465767026]
  We show that Quantum observables of generic many-body systems exhibit a universal pattern of growth in the Krylov space of operators.<n>We introduce and explore broad families of Lanczos coefficients that are consistent with the universal operator growth.<n>For one of the families, the Krylov complexity is computed exactly.
  arXiv  Detail & Related papers  (2025-04-04T13:27:56Z)
• Operator K-complexity in DSSYK: Krylov complexity equals bulk length [0.0]
  We study the notion of complexity under time evolution in chaotic quantum systems with holographic duals.<n>We find that Krylov complexity is given by the expectation value of a length operator acting on the Hilbert space of the theory.<n>We conclude that evolution on the Krylov chain can equivalently be understood as a particle moving in a Morse potential.
  arXiv  Detail & Related papers  (2024-12-19T18:54:30Z)
• Krylov complexity for 1-matrix quantum mechanics [0.0]
  This paper investigates the notion of Krylov complexity, a measure of operator growth, within the framework of 1-matrix quantum mechanics (1-MQM) We analyze the Lanczos coefficients derived from the correlation function, revealing their linear growth even in this integrable system. Our findings in both ground and thermal states of 1-MQM provide new insights into the nature of complexity in quantum mechanical models.
  arXiv  Detail & Related papers  (2024-06-28T18:00:03Z)
• Symmetry-restricted quantum circuits are still well-behaved [45.89137831674385]
  We show that quantum circuits restricted by a symmetry inherit the properties of the whole special unitary group $SU(2n)$. It extends prior work on symmetric states to the operators and shows that the operator space follows the same structure as the state space.
  arXiv  Detail & Related papers  (2024-02-26T06:23:39Z)
• Spectral Convergence of Complexon Shift Operators [38.89310649097387]
  We study the transferability of Topological Signal Processing via a generalized higher-order version of graphon, known as complexon. Inspired by the graphon shift operator and message-passing neural network, we construct a marginal complexon and complexon shift operator. We prove that when a simplicial complex signal sequence converges to a complexon signal, the eigenvalues, eigenspaces, and Fourier transform of the corresponding CSOs converge to that of the limit complexon signal.
  arXiv  Detail & Related papers  (2023-09-12T08:40:20Z)
• Building Krylov complexity from circuit complexity [4.060731229044571]
  We show that Krylov complexity can be rigorously established from circuit complexity when dynamical symmetries exist. Multiple Krylov complexity may be exploited jointly to fully describe operator dynamics.
  arXiv  Detail & Related papers  (2023-03-13T17:59:43Z)
• Krylov complexity in quantum field theory, and beyond [44.99833362998488]
  We study Krylov complexity in various models of quantum field theory. We find that the exponential growth of Krylov complexity satisfies the conjectural inequality, which generalizes the Maldacena-Shenker-Stanford bound on chaos.
  arXiv  Detail & Related papers  (2022-12-29T19:00:00Z)
• Operator Complexity for Quantum Scalar Fields and Cosmological Perturbations [0.0]
  We study the complexity of the unitary evolution of quantum cosmological perturbations in de Sitter space. The complexity of cosmological perturbations scales as the square root of the (exponentially) growing volume of de Sitter space.
  arXiv  Detail & Related papers  (2021-10-15T20:37:36Z)
• Operator complexity: a journey to the edge of Krylov space [0.0]
  Krylov complexity, or K-complexity', quantifies this growth with respect to a special basis. We study the evolution of K-complexity in finite-entropy systems for time scales greater than the scrambling time.
  arXiv  Detail & Related papers  (2020-09-03T18:10:20Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)

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.