Symmetry-resolved Krylov Complexity and the Uncoloured Tensor Model

• URL: http://arxiv.org/abs/2604.05630v1
• Date: Tue, 07 Apr 2026 09:35:02 GMT
• Title: Symmetry-resolved Krylov Complexity and the Uncoloured Tensor Model
• Abstract summary: We investigate the symmetry-resolved Krylov complexity in a charge subspace identical to the Krylov complexity of the full operator.<n>We find that within the computational limits, the Krylov complexity averaged over the symmetry subspace is bounded above by that of the operator in the full space.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The symmetry-resolved Krylov complexity is a useful tool in studying chaotic properties of systems that are endowed with symmetries. We investigate the conditions under which an invariant operator would have the symmetry-resolved Krylov complexity in a charge subspace identical to the Krylov complexity of the full operator. Further, we study the Krylov complexity of the Uncoloured Tensor Model, a disorder-free kin of the SYK Model which has a plethora of symmetries. We find charge subspaces of the same operator in which the equipartition holds as well as where it doesn't. We also find that within the computational limits, the Krylov complexity averaged over the symmetry subspace is bounded above by that of the operator in the full space.

Related papers

• Quantum chaos and late-time equipartition of symmetry-resolved Krylov complexity [1.3707825707652799]
  We study symmetry-resolved Krylov complexity in finite-dimensional chaotic quantum many-body systems.<n>We show that, after saturation, the unresolved Krylov complexity is additive over symmetry sectors.
  arXiv  Detail & Related papers  (2026-08-19T18:07:17Z)
• Flow Matching on Symmetric Spaces [29.28717229244793]
  We reformulate flow matching on symmetric spaces as flow matching on a subspace of the Lie algebra of their isometry group.<n>As an application, we showcase our framework on the real Grassmannians.
  arXiv  Detail & Related papers  (2026-05-05T10:03:12Z)
• Towards a Refinement of Krylov Complexity: Scrambling, Classical Operator Growth and Replicas [3.3587645077393655]
  logarithmic Krylov (logK) complexity is a probe of early-time operator scrambling without false positives.<n>We show that logK-complexity discriminates between genuine and saddle-dominated scrambling at early times.<n>We extend the Krylov formalism in classical dynamical systems to define classical versions of these operator growth measures.
  arXiv  Detail & Related papers  (2026-03-19T18:00:07Z)
• Modulated symmetries from generalized Lieb-Schultz-Mattis anomalies [23.77391435886253]
  We show that spatially modulated symmetries emerge from gauging ordinary symmetries in the presence of generalized LSM type anomalies.<n>Our results provide a unified, nonperturbative framework that ties together LSM constraints and spatially modulated symmetries across dimensions.
  arXiv  Detail & Related papers  (2025-10-21T14:49:19Z)
• On Krylov Complexity as a Probe of the Quantum Mpemba Effect [0.0]
  We investigate Krylov state complexity as a probe of the quantum Mpemba effect in quantum spin chains.<n>For models without global $U(1)$ symmetry, Krylov complexity exhibits clear Mpemba-like crossings.<n>In $U(1)$-symmetric systems, we confirm that the recently proposed symmetric component of Krylov complexity serves as a robust and reliable indicator of the QME.
  arXiv  Detail & Related papers  (2025-10-16T14:41:53Z)
• Growth of block diagonal operators and symmetry-resolved Krylov complexity [0.0]
  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.
  arXiv  Detail & Related papers  (2025-07-02T18:00:00Z)
• Predicting symmetries of quantum dynamics with optimal samples [41.42817348756889]
  Identifying symmetries in quantum dynamics is a crucial challenge with profound implications for quantum technologies.<n>We introduce a unified framework combining group representation theory and subgroup hypothesis testing to predict these symmetries with optimal efficiency.<n>We prove that parallel strategies achieve the same performance as adaptive or indefinite-causal-order protocols.
  arXiv  Detail & Related papers  (2025-02-03T15:57:50Z)
• 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)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)

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.