On Krylov Complexity

• URL: http://arxiv.org/abs/2407.03866v1
• Date: Thu, 4 Jul 2024 11:57:29 GMT
• Title: On Krylov Complexity
• Authors: A. Sánchez-Garrido,
• Abstract summary: This book explores the notion of Krylov complexity as a probe of quantum chaos and as a candidate for holographic complexity. An extensive introduction to the Lanczos algorithm, its properties and associated algebraic structures, as well as technical details related to its practical implementation is given. An exact, analytical, correspondence between the Krylov complexity of the infinite-temperature thermofield double state in the low-energy regime of the double-scaled SYK model and bulk length in the theory of gravity is established.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This Thesis explores the notion of Krylov complexity as a probe of quantum chaos and as a candidate for holographic complexity. The first Part is devoted to presenting the fundamental notions required to conduct research in this area. Namely, an extensive introduction to the Lanczos algorithm, its properties and associated algebraic structures, as well as technical details related to its practical implementation, is given. Subsequently, an overview of the seminal references and the main debates regarding Krylov complexity and its relation to chaos and holography is provided. The text throughout this first Part combines review material with original analyses which either intend to contextualize, compare and criticize results in the literature, or are the fruit of the investigations leading to the publications on which this Thesis is based. These research projects are the subject of the second Part of the manuscript. In them, methods for the efficient implementation of the Lanczos algorithm in finite many-body systems were developed, allowing to compute numerically the Krylov complexity of models like SYK or the XXZ spin chain up to time scales exponentially large in system size. It was observed that the operator Krylov complexity profile in SYK, a paradigmatic low-dimensional chaotic system with a holographic dual, agrees with holographic expectations, while in the case of integrable models like XXZ complexity is affected by a novel localization effect in the so-called Krylov space which hinders its growth. Finally, an exact, analytical, correspondence between the Krylov complexity of the infinite-temperature thermofield double state in the low-energy regime of the double-scaled SYK model and bulk length in the theory of JT gravity is established.

Related papers

• De Sitter holographic complexity from Krylov complexity in DSSYK [0.8202178605741252]
  We use the recent connection between the high energy limit of the double-scaled SYK model and two-dimensional de Sitter solutions of sine dilaton gravity to identify the length of a family of geodesics spanned between future and past infinities with Krylov spread complexity.<n>This constitutes an explicit top-down microscopic realization of holographic complexity in a cosmological spacetime.
  arXiv  Detail & Related papers  (2025-10-15T18:09:50Z)
• Quantum Chaos Diagnostics for Open Quantum Systems from Bi-Lanczos Krylov Dynamics [2.0603431589684518]
  In Hermitian systems, Krylov complexity has emerged as a powerful diagnostic of quantum dynamics.<n>Here, we demonstrate that Krylov complexity, computed via the bi-Lanczos algorithm, effectively identifies chaotic and integrable phases in open quantum systems.
  arXiv  Detail & Related papers  (2025-08-19T15:49:09Z)
• Krylov Complexity [0.0]
  We introduce and review a new complexity measure, called Krylov complexity', which takes its origins in the field of quantum-chaotic dynamics.<n>We give a unified perspective on these topics, emphasizing the robust and most general features of K-complexity.<n>We mention and discuss a number of open problems related to K-complexity, underlining its currently very active status as a field of research.
  arXiv  Detail & Related papers  (2025-07-08T18:00:00Z)
• DuCos: Duality Constrained Depth Super-Resolution via Foundation Model [56.88399488384106]
  We introduce DuCos, a novel depth super-resolution framework grounded in Lagrangian duality theory. DuCos is the first to significantly improve generalization across diverse scenarios with foundation models as prompts.
  arXiv  Detail & Related papers  (2025-03-06T07:36:45Z)
• Krylov spread complexity as holographic complexity beyond JT gravity [0.0]
  One of the important open problems in quantum black hole physics is a dual interpretation of holographic complexity proposals. Our work utilizes the recent connection between double-scaled SYK and sine-dilaton gravity to show that the quantitative relation between Krylov spread complexity and complexity = volume extends to finite temperatures and to full quantum regime on the gravity side at disk level.
  arXiv  Detail & Related papers  (2024-12-23T18:43:35Z)
• 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. We find that Krylov complexity is given by the expectation value of a length operator acting on the Hilbert space of the theory. 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)
• Sparse Mixture-of-Experts for Compositional Generalization: Empirical Evidence and Theoretical Foundations of Optimal Sparsity [89.81738321188391]
  This study investigates the relationship between task complexity and optimal sparsity in SMoE models.<n>We show that the optimal sparsity lies between minimal activation (1-2 experts) and full activation, with the exact number scaling proportionally to task complexity.
  arXiv  Detail & Related papers  (2024-10-17T18:40:48Z)
• 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)
• Spread complexity in saddle-dominated scrambling [0.0]
  We study the spread complexity of the thermofield double state within emphintegrable systems that exhibit saddle-dominated scrambling. Applying the Lanczos algorithm, our numerical investigation reveals that the spread complexity in these systems exhibits features reminiscent of emphchaotic systems.
  arXiv  Detail & Related papers  (2023-12-19T20:41:14Z)
• Krylov Complexity and Dynamical Phase Transition in the quenched LMG model [0.0]
  We explore the Krylov complexity in quantum states following a quench in the Lipkin-Meshkov-Glick model. Our results reveal that the long-term averaged Krylov complexity acts as an order parameter for this model. A matching dynamic behavior is observed in both bases when the initial state possesses a specific symmetry.
  arXiv  Detail & Related papers  (2023-12-08T19:11:55Z)
• On Krylov complexity in open systems: an approach via bi-Lanczos algorithm [0.0]
  We resort to the bi-Lanczos algorithm generating two bi-orthogonal Krylov spaces, which individually generate non-orthogonal subspaces. Unlike the previously studied Arnoldi iteration, this algorithm renders the Lindbladian into a purely tridiagonal form. Our study relies on two specific systems, the dissipative transverse-field Ising model (TFIM) and the dissipative interacting XXZ chain.
  arXiv  Detail & Related papers  (2023-03-07T19:00:18Z)
• Embed to Control Partially Observed Systems: Representation Learning with Provable Sample Efficiency [105.17746223041954]
  Reinforcement learning in partially observed Markov decision processes (POMDPs) faces two challenges. It often takes the full history to predict the future, which induces a sample complexity that scales exponentially with the horizon. We propose a reinforcement learning algorithm named Embed to Control (ETC), which learns the representation at two levels while optimizing the policy.
  arXiv  Detail & Related papers  (2022-05-26T16:34:46Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• 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)
• Holographic tensor network models and quantum error correction: A topical review [78.28647825246472]
  Recent progress in studies of holographic dualities has led to a confluence with concepts and techniques from quantum information theory. A particularly successful approach has involved capturing holographic properties by means of tensor networks.
  arXiv  Detail & Related papers  (2021-02-04T14:09:21Z)
• 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)
• Seismic horizon detection with neural networks [62.997667081978825]
  This paper is an open-sourced research of applying binary segmentation approach to the task of horizon detection on multiple real seismic cubes with a focus on inter-cube generalization of the predictive model. The main contribution of this paper is an open-sourced research of applying binary segmentation approach to the task of horizon detection on multiple real seismic cubes with a focus on inter-cube generalization of the predictive model.
  arXiv  Detail & Related papers  (2020-01-10T11:30:50Z)

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.