Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2309.10382 · Fortschritte der Physik

Krylov Complexity of Fermionic and Bosonic Gaussian States

Kiran Adhikari, Adwait Rijal, Ashok Kumar Aryal, Mausam Ghimire, Rajeev Singh, Christian Deppe

Published Mar 15, 2024• 14 citations
arXivHTMLPDF

Abstract

Abstract The concept of complexity has become pivotal in multiple disciplines, including quantum information, where it serves as an alternative metric for gauging the chaotic evolution of a quantum state. This paper focuses on Krylov complexity, a specialized form of quantum complexity that offers an unambiguous and intrinsically meaningful assessment of the spread of a quantum state over all possible orthogonal bases. This study is situated in the context of Gaussian quantum states, which are fundamental to both Bosonic and Fermionic systems and can be fully described by a covariance matrix. While the covariance matrix is essential, it is insufficient alone for calculating Krylov complexity due to its lack of relative phase information is shown. The relative covariance matrix can provide an upper bound for Krylov complexity for Gaussian quantum states is suggested. The implications of Krylov complexity for theories proposing complexity as a candidate for holographic duality by computing Krylov complexity for the thermofield double States (TFD) and Dirac field are also explored.

DOI
10.1002/prop.202400014

Related papers

Quantum Chaos and Spread of States in Krylov Subspace: A Topical Review

Hyun-Sik Jeong, Juan F. Pedraza

Krylov state complexity, or spread complexity, has emerged as a sharp and versatile diagnostic of quantum chaos, information spreading, and many-body dynamics. Built from the Lanczos algorithm and grounded in the optimal-basis theorem, Krylov complexity thereby provides a robust spectroscopic window into quantum dynamics. A central theme is the characteristic overshoot observed in chaotic systems: a complexity peak in which chaotic evolution drives the state deeper into the Krylov chain than in integrable systems before relaxing to equilibrium. This behavior, tied to random-matrix universality classes of spectral statistics, is illustrated across a broad range of models, including quantum billiards, quantum spin chains, and variants of the SYK model. We also discuss proposed holographic descriptions of Krylov complexity in Einstein gravity, and conclude by outlining future directions and open problems, including time-dependent systems and quantum-field-theoretic formulations. A Mathematica notebook is provided for numerical exploration of Krylov complexity and spectral statistics across models.

hep-thCross-listedarXiv:2608.26825•Aug 28, 2026•1 citation

On Krylov Complexity

Adrián Sánchez-Garrido

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.

arXiv:2407.03866•Jan 1, 2024•17 citations

Krylov Complexity of Purification

Rathindra Nath Das, Takato Mori

In quantum systems, purification can map mixed states into pure states and a nonunitary evolution into a unitary one by enlarging the Hilbert space. We establish a connection between the complexities of mixed quantum states and their purification, proposing new inequalities among these complexities. By examining single qubits, two-qubit Werner states, eight-dimensional Gaussian random unitary ensembles, and infinite-dimensional systems, we demonstrate how these relationships manifest across a broad class of systems. We find that the spread complexity of purification of a vacuum state evolving into a thermal state equals the average number of Rindler particles. This complexity is also shown to adhere to the Lloyd-like bound, indicating a further relation to the quantum speed limit. Finally, using mutual Krylov complexity, we observe subadditivity of the Krylov complexities, which contrasts with known results from holographic volume complexity. We put forward Krylov mutual complexity as a diagnosis of a potential gravity dual of Krylov complexities.

arXiv:2408.00826•Physical Review Letters•Dec 15, 2025•16 citations

Krylov complexity in mixed phase space

Kyoung-Bum Huh, Hyun-Sik Jeong, Leopoldo A. Pando Zayas +1 more

We investigate the Krylov complexity of thermofield double states in systems with mixed phase space, uncovering a direct correlation with the Brody distribution, which interpolates between Poisson and Wigner statistics. Our analysis spans two-dimensional random matrix models featuring (I) GOE-Poisson and (II) GUE-Poisson transitions and extends to higher-dimensional cases, including a stringy matrix model (GOE-Poisson) and the mass-deformed SYK model (GUE-Poisson). Krylov complexity consistently emerges as a reliable marker of quantum chaos, displaying a characteristic peak in the chaotic regime that gradually diminishes as the Brody parameter approaches zero, signaling a shift toward integrability. These results establish Krylov complexity as a powerful diagnostic of quantum chaos and highlight its interplay with eigenvalue statistics in mixed phase systems.

arXiv:2412.04963•Physical review. D/Physical review. D.•May 21, 2025•31 citations

Krylov spread complexity of quantum walks

Bhilahari Jeevanesan

Given the recent advances in quantum technology, the complexity of quantum states is an important notion. The idea of the Krylov spread complexity has come into focus recently with the goal of capturing this in a quantitative way. The present paper sheds light on the Krylov complexity measure by exploring it in the context of continuous-time quantum walks on graphs. A close relationship between Krylov spread complexity and the concept of limiting distributions for quantum walks is established. Moreover, using a graph optimization algorithm, quantum-walk graphs are constructed that have vertex states with minimal and maximal (long-time average) Krylov $\overline{\mathcal{C}}$ complexity. This reveals an empirical upper bound for the $\overline{\mathcal{C}}$ complexity as a function of Hilbert-space dimension and an exact lower bound.

arXiv:2401.00526•Physical Review A•Sep 6, 2024•4 citations

Quantum computational complexity from quantum information to black holes and back

Shira Chapman, Giuseppe Policastro

Abstract Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely different physical problem – that of information processing inside black holes. Quantum computational complexity was suggested as a new entry in the holographic dictionary, which extends the connection between geometry and information and resolves the puzzle of why black hole interiors keep growing for a very long time. In this pedagogical review, we present the geometric approach to complexity advocated by Nielsen and show how it can be used to define complexity for generic quantum systems; in particular, we focus on Gaussian states in QFT, both pure and mixed, and on certain classes of CFT states. We then present the conjectured relation to gravitational quantities within the holographic correspondence and discuss several examples in which different versions of the conjectures have been tested. We highlight the relation between complexity, chaos and scrambling in chaotic systems. We conclude with a discussion of open problems and future directions. This article was written for the special issue of EPJ-C Frontiers in Holographic Duality.

arXiv:2110.14672•The European Physical Journal C•Feb 1, 2022•150 citations
Abstract The concept of complexity has become pivotal in multiple disciplines, including quantum information, where it serves as an alternative metric for gauging the chaotic evolution of a quantum state. This paper focuses on Krylov complexity, a specialized form of quantum complexity that offers an unambiguous and intrinsically meaningful assessment of the spread of a quantum state over all possible orthogonal bases. This study is situated in the context of Gaussian quantum states, which are fundamental to both Bosonic and Fermionic systems and can be fully described by a covariance matrix. While the covariance matrix is essential, it is insufficient alone for calculating Krylov complexity due to its lack of relative phase information is shown. The relative covariance matrix can provide an upper bound for Krylov complexity for Gaussian quantum states is suggested. The implications of Krylov complexity for theories proposing complexity as a candidate for holographic duality by computing Krylov complexity for the thermofield double States (TFD) and Dirac field are also explored.
Krylov state complexity, or spread complexity, has emerged as a sharp and versatile diagnostic of quantum chaos, information spreading, and many-body dynamics. Built from the Lanczos algorithm and grounded in the optimal-basis theorem, Krylov complexity thereby provides a robust spectroscopic window into quantum dynamics. A central theme is the characteristic overshoot observed in chaotic systems: a complexity peak in which chaotic evolution drives the state deeper into the Krylov chain than in integrable systems before relaxing to equilibrium. This behavior, tied to random-matrix universality classes of spectral statistics, is illustrated across a broad range of models, including quantum billiards, quantum spin chains, and variants of the SYK model. We also discuss proposed holographic descriptions of Krylov complexity in Einstein gravity, and conclude by outlining future directions and open problems, including time-dependent systems and quantum-field-theoretic formulations. A Mathematica notebook is provided for numerical exploration of Krylov complexity and spectral statistics across models.
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.
In quantum systems, purification can map mixed states into pure states and a nonunitary evolution into a unitary one by enlarging the Hilbert space. We establish a connection between the complexities of mixed quantum states and their purification, proposing new inequalities among these complexities. By examining single qubits, two-qubit Werner states, eight-dimensional Gaussian random unitary ensembles, and infinite-dimensional systems, we demonstrate how these relationships manifest across a broad class of systems. We find that the spread complexity of purification of a vacuum state evolving into a thermal state equals the average number of Rindler particles. This complexity is also shown to adhere to the Lloyd-like bound, indicating a further relation to the quantum speed limit. Finally, using mutual Krylov complexity, we observe subadditivity of the Krylov complexities, which contrasts with known results from holographic volume complexity. We put forward Krylov mutual complexity as a diagnosis of a potential gravity dual of Krylov complexities.
We investigate the Krylov complexity of thermofield double states in systems with mixed phase space, uncovering a direct correlation with the Brody distribution, which interpolates between Poisson and Wigner statistics. Our analysis spans two-dimensional random matrix models featuring (I) GOE-Poisson and (II) GUE-Poisson transitions and extends to higher-dimensional cases, including a stringy matrix model (GOE-Poisson) and the mass-deformed SYK model (GUE-Poisson). Krylov complexity consistently emerges as a reliable marker of quantum chaos, displaying a characteristic peak in the chaotic regime that gradually diminishes as the Brody parameter approaches zero, signaling a shift toward integrability. These results establish Krylov complexity as a powerful diagnostic of quantum chaos and highlight its interplay with eigenvalue statistics in mixed phase systems.
Given the recent advances in quantum technology, the complexity of quantum states is an important notion. The idea of the Krylov spread complexity has come into focus recently with the goal of capturing this in a quantitative way. The present paper sheds light on the Krylov complexity measure by exploring it in the context of continuous-time quantum walks on graphs. A close relationship between Krylov spread complexity and the concept of limiting distributions for quantum walks is established. Moreover, using a graph optimization algorithm, quantum-walk graphs are constructed that have vertex states with minimal and maximal (long-time average) Krylov C‾\overline{\mathcal{C}}C complexity. This reveals an empirical upper bound for the C‾\overline{\mathcal{C}}C complexity as a function of Hilbert-space dimension and an exact lower bound.
Abstract Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely different physical problem – that of information processing inside black holes. Quantum computational complexity was suggested as a new entry in the holographic dictionary, which extends the connection between geometry and information and resolves the puzzle of why black hole interiors keep growing for a very long time. In this pedagogical review, we present the geometric approach to complexity advocated by Nielsen and show how it can be used to define complexity for generic quantum systems; in particular, we focus on Gaussian states in QFT, both pure and mixed, and on certain classes of CFT states. We then present the conjectured relation to gravitational quantities within the holographic correspondence and discuss several examples in which different versions of the conjectures have been tested. We highlight the relation between complexity, chaos and scrambling in chaotic systems. We conclude with a discussion of open problems and future directions. This article was written for the special issue of EPJ-C Frontiers in Holographic Duality.