Krylov complexity in large-$q$ and double-scaled SYK model

• URL: http://arxiv.org/abs/2210.02474v4
• Date: Fri, 18 Aug 2023 02:50:46 GMT
• Title: Krylov complexity in large-$q$ and double-scaled SYK model
• Authors: Budhaditya Bhattacharjee, Pratik Nandy, Tanay Pathak
• Abstract summary: We compute Krylov complexity and the higher Krylov cumulants in subleading order, along with the $t/q$ effects. The Krylov complexity naturally describes the "size" of the distribution, while the higher cumulants encode richer information. The growth of Krylov complexity appears to be "hyperfast", which is previously conjectured to be associated with scrambling in de Sitter space.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Considering the large-$q$ expansion of the Sachdev-Ye-Kitaev (SYK) model in the two-stage limit, we compute the Lanczos coefficients, Krylov complexity, and the higher Krylov cumulants in subleading order, along with the $t/q$ effects. The Krylov complexity naturally describes the "size" of the distribution, while the higher cumulants encode richer information. We further consider the double-scaled limit of SYK$_q$ at infinite temperature, where $q \sim \sqrt{N}$. In such a limit, we find that the scrambling time shrinks to zero, and the Lanczos coefficients diverge. The growth of Krylov complexity appears to be "hyperfast", which is previously conjectured to be associated with scrambling in de Sitter space.

Related papers

• Convergence Rate Analysis of LION [54.28350823319057]
  LION converges iterations of $cal(sqrtdK-)$ measured by gradient Karush-Kuhn-T (sqrtdK-)$. We show that LION can achieve lower loss and higher performance compared to standard SGD.
  arXiv  Detail & Related papers  (2024-11-12T11:30:53Z)
• Barriers to Welfare Maximization with No-Regret Learning [68.66209476382213]
  We prove lower bounds for computing a near-optimal $T$-sparse CCE. In particular, we show that the inapproximability of maximum clique precludes attaining any non-trivial sparsity in time.
  arXiv  Detail & Related papers  (2024-11-04T00:34:56Z)
• Krylov complexity of fermion chain in double-scaled SYK and power spectrum perspective [0.0]
  We investigate Krylov complexity of the fermion chain operator which consists of multiple Majorana fermions in the double-scaled SYK (DSSYK) model with finite temperature. Using the fact that Krylov complexity is computable from two-point functions, the analysis is performed in the limit where the two-point function becomes simple. We confirm the exponential growth of Krylov complexity in the very low temperature regime.
  arXiv  Detail & Related papers  (2024-07-18T08:47:05Z)
• 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)
• Dissecting Quantum Many-body Chaos in the Krylov Space [8.51823003676739]
  We introduce the Krylov metric $K_mn$, which probes the size of the Krylov basis. We show that $h=varkappa / 2alpha$ is a ratio between the quantum Lyapunov exponent $varkappa$ and the Krylov exponent $alpha$.
  arXiv  Detail & Related papers  (2024-04-12T02:40:29Z)
• Krylov complexity in the IP matrix model II [0.0]
  We study how the Krylov complexity changes from a zero-temperature oscillation to an infinite-temperature exponential growth. The IP model for any nonzero temperature shows exponential growth for the Krylov complexity even though the Green function decays by a power law in time.
  arXiv  Detail & Related papers  (2023-08-15T04:25:55Z)
• Settling the Sample Complexity of Online Reinforcement Learning [92.02082223856479]
  We show how to achieve minimax-optimal regret without incurring any burn-in cost. We extend our theory to unveil the influences of problem-dependent quantities like the optimal value/cost and certain variances.
  arXiv  Detail & Related papers  (2023-07-25T15:42:11Z)
• Cosmological Krylov Complexity [0.0]
  We study the Krylov complexity ($K$) from the planar/inflationary patch of the de Sitter space using the two mode squeezed state formalism. We show that the Krylov complexity ($K$) for this system is equal to average particle numbers suggesting it's relation to the volume.
  arXiv  Detail & Related papers  (2022-03-27T15:36:58Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• 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)
• Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting [81.70513857417106]
  We design and analyze CascadeBAI, an algorithm for finding the best set of $K$ items. An upper bound on the time complexity of CascadeBAI is derived by overcoming a crucial analytical challenge. We show, through the derivation of a lower bound on the time complexity, that the performance of CascadeBAI is optimal in some practical regimes.
  arXiv  Detail & Related papers  (2020-01-23T16:47:52Z)

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.