Grand Canonical vs Canonical Krylov Complexity in Double-Scaled Complex SYK Model

• URL: http://arxiv.org/abs/2512.07715v1
• Date: Mon, 08 Dec 2025 17:05:15 GMT
• Title: Grand Canonical vs Canonical Krylov Complexity in Double-Scaled Complex SYK Model
• Abstract summary: Krylov complexity for the grand canonical ensemble is given by the sum of the complexities in the charge sectors.<n>We compute the Krylov complexity analytically in the limit of early and late time in the charge sector and numerically for both canonical and grand canonical ensemble.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the complex SYK model in the double-scaling limit. We obtain the transfer matrix for the grand canonical ensemble and symmetrize it. In the (n,Q)- basis of chord states, the grand canonical transfer matrix is block diagonal, where each block is the canonical transfer matrix for the respective charge sector. We therefore conclude that the Krylov complexity for the grand canonical ensemble is given by the sum of the complexities in the charge sectors weighted by a probability function that depends on the chemical potential. Finally, we compute the Krylov complexity analytically in the limit of early and late time in the charge sector and numerically for both canonical and grand canonical ensemble.

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)
• Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp [21.37855446714896]
  We revisit the Sinkhorn-Knopp algorithm for the matrix scaling problem.<n>We show that under certain conditions, SK is a convergence-time algorithm for doubly matrix scaling.
  arXiv  Detail & Related papers  (2026-08-12T07:56:08Z)
• Orthogonal Quantum Krylov Diagonalisation [35.18016233072556]
  Existing quantum Krylov approaches rely on non-orthogonal Krylov bases, requiring overlap-matrix regularization.<n>We introduce an Orthogonal Quantum Krylov Diagonalization (OQKD) framework that reformulates the classical Lanczos at the operator level.
  arXiv  Detail & Related papers  (2026-07-10T14:49:53Z)
• q-Askey Deformations of Double-Scaled SYK [0.0]
  We study families of deformations of the double-scaled SYK (DSSYK) model.<n>By increasing one of the deformation parameters, the models eventually exhibit discrete energy levels.<n>We discuss connections between our results and the emergence of baby universes in the bulk.
  arXiv  Detail & Related papers  (2026-05-13T18:00:01Z)
• Typical entanglement in anyon chains: Page curves beyond Lie group symmetries [41.99844472131922]
  We study bipartite entanglement statistics in one-dimensional anyon chains constrained by fusion rules of unitary pre-modular categories.<n>Surprisingly, despite the constrained Hilbert space structure, the large $L$ expansion has no universal $O(sqrtL)$ or $O(1)$ symmetry-type corrections.<n> Numerical simulations of the integrable and quantum-chaotic golden chain Hamiltonian show that chaotic mid-spectrum eigenstates match the Haar-random predictions.
  arXiv  Detail & Related papers  (2026-03-26T18:00:03Z)
• 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)
• Quantum Ising Model on $(2+1)-$Dimensional Anti$-$de Sitter Space using Tensor Networks [37.108493798440655]
  We study the quantum Ising model on (2+1)-dimensional anti-de Sitter space using Matrix Product States (MPS) and Matrix Product Operators (MPOs)<n>Our spatial lattices correspond to regular tessellations of hyperbolic space with coordination number seven.<n>We find the ground state of this model using the Density Matrix Renormalization Group (DMRG) algorithm which allowed us to probe lattices that range in size up to 232 sites.
  arXiv  Detail & Related papers  (2025-12-23T23:29:39Z)
• 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)
• Hierarchical analytical approach to universal spectral correlations in Brownian Quantum Chaos [44.99833362998488]
  We develop an analytical approach to the spectral form factor and out-of-time ordered correlators in zero-dimensional Brownian models of quantum chaos.
  arXiv  Detail & Related papers  (2024-10-21T10:56:49Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Tensor product random matrix theory [39.58317527488534]
  We introduce a real-time field theory approach to the evolution of correlated quantum systems. We describe the full range of such crossover dynamics, from initial product states to a maximum entropy ergodic state.
  arXiv  Detail & Related papers  (2024-04-16T21:40:57Z)
• Complexity and Operator Growth for Quantum Systems in Dynamic Equilibrium [1.1868310494908512]
  Krylov complexity is a measure of operator growth in quantum systems. We show that Krylov complexity can distinguish between the $mathsfPT$-symmetric and $mathsfPT$ symmetry-broken phases. Our results demonstrate the utility of Krylov complexity as a tool to probe the properties and transitions of $mathsfPT$-symmetric systems.
  arXiv  Detail & Related papers  (2023-12-25T18:58:13Z)
• Theory of mobility edge and non-ergodic extended phase in coupled random matrices [18.60614534900842]
  The mobility edge, as a central concept in disordered models for localization-delocalization transitions, has rarely been discussed in the context of random matrix theory. We show that their overlapped spectra and un-overlapped spectra exhibit totally different scaling behaviors, which can be used to construct tunable mobility edges. Our model provides a general framework to realize the mobility edges and non-ergodic phases in a controllable way in RMT.
  arXiv  Detail & Related papers  (2023-11-15T01:43:37Z)
• Krylov Complexity of Fermionic and Bosonic Gaussian States [9.194828630186072]
  This paper focuses on emphKrylov complexity, a specialized form of quantum complexity. It offers an unambiguous and intrinsically meaningful assessment of the spread of a quantum state over all possible bases.
  arXiv  Detail & Related papers  (2023-09-19T07:32:04Z)
• 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)
• Multipartite entanglement of the topologically ordered state in a perturbed toric code [18.589873789289562]
  We demonstrate that multipartite entanglement, witnessed by the quantum Fisher information (QFI), can characterize topological quantum phase transitions in the spin-$frac12$ toric code model. Our results provide insights to topological phases, which are robust against external disturbances, and are candidates for topologically protected quantum computation.
  arXiv  Detail & Related papers  (2021-09-07T20:20:21Z)
• Complete entropic inequalities for quantum Markov chains [17.21921346541951]
  We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional algebra satisfies a modified log-Sobolev inequality. We also establish the first general approximateization property of relative entropy.
  arXiv  Detail & Related papers  (2021-02-08T11:47:37Z)
• 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)
• Solution to the Quantum Symmetric Simple Exclusion Process : the Continuous Case [0.0]
  We present a solution for the invariant probability measure of the one dimensional Q-SSEP in the infinite size limit. We incidentally point out a possible interpretation of the Q-SSEP correlation functions via a surprising conneatorics and the associahedron polytopes.
  arXiv  Detail & Related papers  (2020-06-22T13:20:40Z)

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.