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:2311.04093 · Physical review. D/Physical review. D.

Krylov complexity is not a measure of distance between states or operators

Sergio E. Aguilar-Gutierrez, Andrew Rolph

Published Apr 22, 2024• 46 citations
arXivHTMLPDF

Abstract

We ask whether Krylov complexity is mutually compatible with the circuit and Nielsen definitions of complexity. We show that the Krylov complexities between three states fail to satisfy the triangle inequality and so cannot be a measure of distance: there is no possible metric for which Krylov complexity is the length of the shortest path to the target state or operator. We show this explicitly in the simplest example, a single qubit, and in general. Published by the American Physical Society 2024

DOI
10.1103/physrevd.109.l081701

Related papers

Building Krylov complexity from circuit complexity

Chenwei Lv, Ren Zhang, Qi Zhou

Krylov complexity has emerged as a probe of operator growth in a wide range of nonequilibrium quantum dynamics. However, a fundamental issue remains in such studies: the definition of the distance between basis states in Krylov space is ambiguous. Here we show that Krylov complexity can be rigorously established from circuit complexity when dynamical symmetries exist. Whereas circuit complexity characterizes the geodesic distance in a multidimensional operator space, Krylov complexity measures the height of the final operator in a particular direction. The geometric representation of circuit complexity thus unambiguously designates the distance between basis states in Krylov space. This geometric approach also applies to time-dependent Liouvillian superoperators, where a single Krylov complexity is no longer sufficient. Multiple Krylov complexity may be exploited jointly to fully describe operator dynamics. Published by the American Physical Society 2024

arXiv:2303.07343•Physical Review Research•Oct 1, 2024•35 citations

Explicit Connections Between Krylov and Nielsen Complexity

Ben Craps, Gabriele Pascuzzi, Juan F. Pedraza +2 more

We establish a direct correspondence between Krylov and Nielsen complexity by choosing the Krylov basis to be part of the elementary gate set of Nielsen geometry and selecting a Nielsen complexity metric compatible with the Krylov metric. Up to normalization, the Krylov complexity of a Hermitian operator then equals the length squared of a straight-line trajectory on the manifold of unitaries that connects the identity operator with a precursor operator. The corresponding length provides an upper bound on Nielsen complexity that saturates whenever the straight line is a minimal geodesic. While for general systems we can only establish saturation in the limit of small precursors, we provide evidence that in broad classes of models and for suitable initial operators there is a precise correspondence between Krylov complexity and (the square of) Nielsen complexity for a finite range of precursors.

hep-thCross-listedarXiv:2511.15799•Physical review. D/Physical review. D.•Nov 21, 2025•8 citations

A universal approach to Krylov state and operator complexities

Mohsen Alishahiha, Souvik Banerjee

We present a general framework in which both Krylov state and operator complexities can be put on the same footing. In our formalism, the Krylov complexity is defined in terms of the density matrix of the associated state which, for the operator complexity, lives on a doubled Hilbert space obtained through the channel-state map. This unified definition of complexity in terms of the density matrices enables us to extend the notion of Krylov complexity, to subregion or mixed state complexities and also naturally to the Krylov mutual complexity. We show that this framework also encompasses nicely the holographic notions of complexity.

arXiv:2212.10583•SciPost Physics•Sep 6, 2023•68 citations

Generalized Krylov complexity

Amin Faraji Astaneh, Niloofar Vardian

We extend the concept of Krylov complexity to encompass general unitary evolutions involving multiple generators. This generalization enables us to formulate a framework for generalized Krylov complexity, which serves as a measure of the complexity of states associated with continuous symmetries within a model. Furthermore, we investigate scenarios in which different directions of transformation lead to varying degrees of complexity, in close analogy with geometric approaches to complexity, such as Nielsen’s framework. In this context, we introduce a generalized orthogonalization algorithm and delineate its computational structure, which is organized as a network of orthogonal blocks rather than a simple linear chain. Finally, we present explicit evaluations of several illustrative examples to demonstrate the practical application of this framework.

arXiv:2507.23739•Physical review. D/Physical review. D.•Dec 22, 2025•6 citations

A Relation between Krylov and Nielsen Complexity

Ben Craps, Oleg Evnin, Gabriele Pascuzzi

Krylov complexity and Nielsen complexity are successful approaches to quantifying quantum evolution complexity that have been actively pursued without much contact between the two lines of research. The two quantities are motivated by quantum chaos and quantum computation, respectively, while the relevant mathematics is as different as matrix diagonalization algorithms and geodesic flows on curved manifolds. We demonstrate that, despite these differences, there is a relation between the two quantities. Namely, the time average of Krylov complexity of state evolution can be expressed as a trace of a certain matrix, which also controls an upper bound on Nielsen complexity with a specific custom-tailored penalty schedule adapted to the Krylov basis.

arXiv:2311.18401•Physical Review Letters•Apr 18, 2024•46 citations

Quantum-to-classical correspondence in Krylov complexity

Gastón F. Scialchi, Augusto J. Roncaglia, Diego A. Wisniacki

We study quantum-to-classical correspondence of the Krylov space for evolutions driven by unitary maps with a classical limit. This entails a proper definition of corresponding quantum and classical operators, inner products and initial states. We prove that with these definitions the purely classical Krylov space is indeed obtained as the asymptotic $\hbar\to 0$ expansion of the quantum Krylov space, and provide several examples of such correspondence. We use these examples to analyze some general aspects about the evolution of the Krylov complexity as they relate to the phase-space representation for the Krylov states. Additionally, we discuss alternative definitions to obtain the correspondence and why they fail. This paper constitutes a first step in understanding complexity and ergodicity of unitary evolution through the Krylov perspective as they relate to classical dynamical notions.

quant-pharXiv:2603.11034•Mar 12, 2026
We ask whether Krylov complexity is mutually compatible with the circuit and Nielsen definitions of complexity. We show that the Krylov complexities between three states fail to satisfy the triangle inequality and so cannot be a measure of distance: there is no possible metric for which Krylov complexity is the length of the shortest path to the target state or operator. We show this explicitly in the simplest example, a single qubit, and in general. Published by the American Physical Society 2024
Krylov complexity has emerged as a probe of operator growth in a wide range of nonequilibrium quantum dynamics. However, a fundamental issue remains in such studies: the definition of the distance between basis states in Krylov space is ambiguous. Here we show that Krylov complexity can be rigorously established from circuit complexity when dynamical symmetries exist. Whereas circuit complexity characterizes the geodesic distance in a multidimensional operator space, Krylov complexity measures the height of the final operator in a particular direction. The geometric representation of circuit complexity thus unambiguously designates the distance between basis states in Krylov space. This geometric approach also applies to time-dependent Liouvillian superoperators, where a single Krylov complexity is no longer sufficient. Multiple Krylov complexity may be exploited jointly to fully describe operator dynamics. Published by the American Physical Society 2024
We establish a direct correspondence between Krylov and Nielsen complexity by choosing the Krylov basis to be part of the elementary gate set of Nielsen geometry and selecting a Nielsen complexity metric compatible with the Krylov metric. Up to normalization, the Krylov complexity of a Hermitian operator then equals the length squared of a straight-line trajectory on the manifold of unitaries that connects the identity operator with a precursor operator. The corresponding length provides an upper bound on Nielsen complexity that saturates whenever the straight line is a minimal geodesic. While for general systems we can only establish saturation in the limit of small precursors, we provide evidence that in broad classes of models and for suitable initial operators there is a precise correspondence between Krylov complexity and (the square of) Nielsen complexity for a finite range of precursors.
We present a general framework in which both Krylov state and operator complexities can be put on the same footing. In our formalism, the Krylov complexity is defined in terms of the density matrix of the associated state which, for the operator complexity, lives on a doubled Hilbert space obtained through the channel-state map. This unified definition of complexity in terms of the density matrices enables us to extend the notion of Krylov complexity, to subregion or mixed state complexities and also naturally to the Krylov mutual complexity. We show that this framework also encompasses nicely the holographic notions of complexity.
We extend the concept of Krylov complexity to encompass general unitary evolutions involving multiple generators. This generalization enables us to formulate a framework for generalized Krylov complexity, which serves as a measure of the complexity of states associated with continuous symmetries within a model. Furthermore, we investigate scenarios in which different directions of transformation lead to varying degrees of complexity, in close analogy with geometric approaches to complexity, such as Nielsen’s framework. In this context, we introduce a generalized orthogonalization algorithm and delineate its computational structure, which is organized as a network of orthogonal blocks rather than a simple linear chain. Finally, we present explicit evaluations of several illustrative examples to demonstrate the practical application of this framework.
Krylov complexity and Nielsen complexity are successful approaches to quantifying quantum evolution complexity that have been actively pursued without much contact between the two lines of research. The two quantities are motivated by quantum chaos and quantum computation, respectively, while the relevant mathematics is as different as matrix diagonalization algorithms and geodesic flows on curved manifolds. We demonstrate that, despite these differences, there is a relation between the two quantities. Namely, the time average of Krylov complexity of state evolution can be expressed as a trace of a certain matrix, which also controls an upper bound on Nielsen complexity with a specific custom-tailored penalty schedule adapted to the Krylov basis.
We study quantum-to-classical correspondence of the Krylov space for evolutions driven by unitary maps with a classical limit. This entails a proper definition of corresponding quantum and classical operators, inner products and initial states. We prove that with these definitions the purely classical Krylov space is indeed obtained as the asymptotic ℏ→0\hbar\to 0ℏ→0 expansion of the quantum Krylov space, and provide several examples of such correspondence. We use these examples to analyze some general aspects about the evolution of the Krylov complexity as they relate to the phase-space representation for the Krylov states. Additionally, we discuss alternative definitions to obtain the correspondence and why they fail. This paper constitutes a first step in understanding complexity and ergodicity of unitary evolution through the Krylov perspective as they relate to classical dynamical notions.