Operator K-complexity in DSSYK: Krylov complexity equals bulk length

• URL: http://arxiv.org/abs/2412.15318v2
• Date: Fri, 07 Mar 2025 14:38:58 GMT
• Title: Operator K-complexity in DSSYK: Krylov complexity equals bulk length
• Authors: Marco Ambrosini, Eliezer Rabinovici, Adrián Sánchez-Garrido, Ruth Shir, Julian Sonner,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper we study the notion of complexity under time evolution in chaotic quantum systems with holographic duals. Continuing on from our previous work, we turn our attention to the issue of Krylov complexity upon the insertion of a class of single-particle operators in the double-scaled SYK model. Such an operator is described by a matter-chord insertion, which splits the theory into left/right sectors, allowing us, via chord-diagram technology, to compute two different notions of complexity associated to the operator insertion: first a Krylov operator complexity, and second the Krylov complexity of a state obtained by an operator acting on the thermofield double state. We will provide both an analytic proof and detailed numerical evidence, that both Krylov complexities arise from a recursively defined basis of states characterized by a constant total chord number. As a consequence, in all cases we are able to establish that Krylov complexity is given by the expectation value of a length operator acting on the Hilbert space of the theory, expressed in terms of basis states, organized by left and right chord number. We find analytic expressions for the semiclassical limit of K-complexity, and study how the size of the operator encodes the scrambling dynamics upon the matter insertion in Krylov language. We furthermore determine the effective Hamiltonian governing the evolution of K-complexity, showing that evolution on the Krylov chain can equivalently be understood as a particle moving in a Morse potential. A particular type of triple scaling limit allows to access the gravitational sector of the theory, in which the geometrical nature of K-complexity is assured by virtue of being a total chord length, in an analogous fashion to what was found in [1] for the K-complexity of the thermofield double state.

Related papers

• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• 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)
• 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)
• 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)
• 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)
• A universal approach to Krylov State and Operator complexities [0.0]
  In our formalism, the Krylov complexity is defined in terms of the density matrix of the associated state. This unified definition of complexity enables us to extend the notion of Krylov complexity to subregion or mixed state complexities.
  arXiv  Detail & Related papers  (2022-12-20T19:00:12Z)
• Out-of-time-order correlations and the fine structure of eigenstate thermalisation [58.720142291102135]
  Out-of-time-orderors (OTOCs) have become established as a tool to characterise quantum information dynamics and thermalisation. We show explicitly that the OTOC is indeed a precise tool to explore the fine details of the Eigenstate Thermalisation Hypothesis (ETH) We provide an estimation of the finite-size scaling of $omega_textrmGOE$ for the general class of observables composed of sums of local operators in the infinite-temperature regime.
  arXiv  Detail & Related papers  (2021-03-01T17:51:46Z)
• 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)
• Complexity growth of operators in the SYK model and in JT gravity [0.0]
  We study partially entangled thermal states in the Sachdev-Ye-Kitaev (SYK) model and their dual description in terms of operators inserted in the interior of a black hole in Jackiw-Teitelboim gravity. We compare a microscopic definition of complexity in the SYK model known as K-complexity to calculations using CV duality in JT gravity and find that both quantities show an exponential-to-linear growth behavior.
  arXiv  Detail & Related papers  (2020-08-27T17:23:06Z)
• 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.