
TL;DR
This thesis investigates Krylov complexity as a measure of quantum chaos and holographic complexity, developing efficient computational methods, analyzing models like SYK and XXZ, and establishing a link with JT gravity.
Contribution
It introduces new numerical methods for computing Krylov complexity in many-body systems and establishes a novel analytical correspondence with holographic bulk length.
Findings
Krylov complexity in SYK matches holographic predictions.
Integrable models show localization effects hindering complexity growth.
Analytical link between Krylov complexity and bulk length in JT gravity.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Graph theory and applications
