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:2603.07183

On Minimizing Krylov Complexity Using Higher-Order Generators

Saud Čindrak, Kathy Lüdge

quant-phSubmitted Mar 7, 2026• Announced Mar 10, 2026• 0 citations
arXivHTMLPDF

Abstract

Krylov complexity provides a powerful framework for characterizing the dynamical evolution of quantum systems through the spreading of states in Krylov space. The motivation for this is rooted in the optimality of the Krylov basis for the analyzed cost function. In this work, we reinterpret the motivation for the Krylov basis from a dynamical perspective and show that it corresponds to a first-order approximation of the time-evolution operator. We extend this framework to higher-order generators and analytically disprove the optimality assumption by showing that an infinite-order generator can be constructed to exhibit smaller spread for arbitrary times. We propose a natural time scale for the construction of these higher-order generators and discuss results for matrices sampled from Gaussian Unitary Ensembles, demonstrating smaller Krylov complexity at all higher orders. These results extend the framework of Krylov complexity beyond the conventional Krylov basis by disproving the widely held assumption of optimality, extending the construction to higher-order generators, and introducing a physically motivated method for their construction. Our findings therefore suggest that previous statements and results concerning Krylov complexity may need to be reconsidered.

Comments
5 pages, 2 figures

Related papers

A phase space approach to the wavefunction spreading and operator growth in the Krylov basis

Kunal Pal, Kuntal Pal, Keun-Young Kim

In the Wigner-Weyl phase space formulation of quantum mechanics, we analyse the problem of the spreading of an initial state or an initial operator under time evolution when described in terms of the Krylov basis. After constructing the phase space functions corresponding to the Krylov basis states generated by a Hamiltonian from a given initial state by using the Weyl transformation, we subsequently use them to cast the Krylov state complexity as an integral over the phase space in terms of the Wigner function of the time-evolved initial state, so that the contribution of the classical Liouville equation and higher-order quantum corrections to the Wigner function time evolution equation towards the Krylov state complexity can be identified. Next, we construct the double phase space functions associated with the Krylov basis for operators by using a suitable generalisation of the Weyl transformation applicable for superoperators, and use them to rewrite the Krylov operator complexity as an integral over the double phase space in terms of a generalisation of the usual Wigner function. These results, in particular, show that the complexity measures based on the expansion of a time-evolved state (or an operator) in the Krylov basis can be thought to belong to a general class of complexity measures constructed from the expansion coefficients of the time-dependent Wigner function in an orthonormal basis in the phase space, and help us to connect these complexity measures with measures of complexity of time evolved state based on harmonic expansion of the time-dependent Wigner function.

quant-pharXiv:2601.13872•Journal of High Energy Physics•Jan 21, 2026•1 citation

Statistics and complexity of wavefunction spreading in quantum dynamical systems

Y. W. Fu, Keun-young Kim A, Kunal Pal +1 more

A bstract We consider the statistics of the results of a measurement of the spreading operator in the Krylov basis generated by the Hamiltonian of a quantum system starting from a specified initial pure state. We first obtain the probability distribution of the results of measurements of this spreading operator at a certain instant of time, and compute the characteristic function of this distribution. We show that the moments of this characteristic function are related to the so-called generalised spread complexities, and obtain expressions for them in several cases when the Hamiltonian is an element of a Lie algebra. Furthermore, by considering a continuum limit of the Krylov basis, we show that the generalised spread complexities of higher orders have a peak in the time evolution for a random matrix Hamiltonian belonging to the Gaussian unitary ensemble. We also obtain an upper bound in the change in generalised spread complexity at an arbitrary time in terms of the operator norm of the Hamiltonian and discuss the significance of these results.

arXiv:2411.09390•Journal of High Energy Physics•Jun 13, 2025•10 citations

Bridging Krylov Complexity and Universal Analog Quantum Simulator

Shuo Zhang, Yuzhi Tong, Pengfei Zhang +1 more

Quantum simulation of complex many-body systems beyond classical computational capabilities provides a promising route toward understanding novel quantum phases and their transitions. In particular, analog quantum simulators with global control fields have attracted considerable attention due to their potential to simulate arbitrary Hamiltonians and perform quantum computing tasks. However, a clear, quantitative measure for the complexity of implementing specific quantum operations in such systems is still lacking. In this Letter, we address this challenge by introducing generalized Krylov complexity, a concept originating from operator growth dynamics, as a direct diagnosis for this synthesis complexity. We construct the block Krylov basis generated by a set of Hamiltonians, which naturally organizes the operator space achievable through the simulator's native interactions and their nested commutators. By analyzing representative systems including Rydberg atom arrays, we demonstrate that the generalized Krylov complexity of a target operation serves as a strong predictor of the minimum time required for its realization. Our results establish Krylov complexity as an intuitive and predictive tool for designing efficient control protocols in analog quantum simulators.

quant-pharXiv:2605.07668•May 11, 2026•0 citations

Properties of Krylov state complexity in qubit dynamics

Siddharth Seetharaman, Chetanya Singh, Rejish Nath

We analyze the properties of Krylov state complexity in qubit dynamics, considering a single qubit and a qubit pair. A geometrical picture of the Krylov complexity is discussed for the single-qubit case, whereas it becomes non-trivial for the two-qubit case. Considering the particular case of interacting Rydberg two-level atoms, we show that the Krylov basis obtained using an effective Hamiltonian minimizes the time-averaged spread complexity compared to that which is obtained from the original Hamiltonian. We further generalize the latter property to an arbitrary Hamiltonian in which the entire Hilbert space comprises of two subspaces provided a weak coupling between them.

arXiv:2407.21776•Physical review. D/Physical review. D.•Apr 16, 2025•5 citations

Krylov complexity has it all

Wolfgang Mück

This paper establishes that Krylov complexity contains the entire information about the dynamics of a quantum operator, extending the list of equivalent quantities that can serve this purpose, such as the Lanczos coefficients, the return amplitude, and the spectral density. To demonstrate this equivalence, an explicit recursive algorithm is constructed to calculate Lanczos coefficients from the Taylor expansion of the Krylov complexity around $t=0$. Furthermore, the paper discusses the distinction between Krylov and spread complexity, clarifying why a similar recursive algorithm cannot exist for the latter without additional dynamical input. These results provide a ``proof of principle'' for using Krylov complexity as a complete characterization of operator evolution in quantum systems.

hep-thCross-listedarXiv:2605.28681•Physical review. D/Physical review. D.•May 28, 2026•0 citations

Krylov complexity in the Schrödinger field theory

Peng-Zhang He, Hai-Qing Zhang

A bstract We investigate the Krylov complexity of Schrödinger field theories, focusing on both bosonic and fermionic systems within the grand canonical ensemble which includes a chemical potential. Krylov complexity measures operator growth in quantum systems by analyzing how operators spread within the Krylov space, a subspace of the Hilbert space spanned by successive applications of the superoperator [ H , ·] on an initial operator. Using the Lanczos algorithm, we construct an orthonormal Krylov basis and derive the Lanczos coefficients, which govern the operator connectivity and thus characterize the complexity. Our study reveals that the Lanczos coefficients { b n } are almost independent of the chemical potential, while { a n } are dependent on the chemical potential. Both { a n } and { b n } show linear relationships with respect to n . For both bosonic and fermionic systems, the Krylov complexities behave similarly over time, especially at late times, due to the analogous profiles of the squared absolute values of their autocorrelation functions | φ 0 ( t )| 2 . The Krylov complexity grows exponentially with time, but its asymptotic scaling factor λ K is significantly smaller than the twice of the slope of the { b n } coefficients, contrasting to the relativistic field theories where the scaling aligns more closely with the twice of the slope of { b n }.

arXiv:2411.16302•Journal of High Energy Physics•Mar 19, 2025•4 citations
Krylov complexity provides a powerful framework for characterizing the dynamical evolution of quantum systems through the spreading of states in Krylov space. The motivation for this is rooted in the optimality of the Krylov basis for the analyzed cost function. In this work, we reinterpret the motivation for the Krylov basis from a dynamical perspective and show that it corresponds to a first-order approximation of the time-evolution operator. We extend this framework to higher-order generators and analytically disprove the optimality assumption by showing that an infinite-order generator can be constructed to exhibit smaller spread for arbitrary times. We propose a natural time scale for the construction of these higher-order generators and discuss results for matrices sampled from Gaussian Unitary Ensembles, demonstrating smaller Krylov complexity at all higher orders. These results extend the framework of Krylov complexity beyond the conventional Krylov basis by disproving the widely held assumption of optimality, extending the construction to higher-order generators, and introducing a physically motivated method for their construction. Our findings therefore suggest that previous statements and results concerning Krylov complexity may need to be reconsidered.
In the Wigner-Weyl phase space formulation of quantum mechanics, we analyse the problem of the spreading of an initial state or an initial operator under time evolution when described in terms of the Krylov basis. After constructing the phase space functions corresponding to the Krylov basis states generated by a Hamiltonian from a given initial state by using the Weyl transformation, we subsequently use them to cast the Krylov state complexity as an integral over the phase space in terms of the Wigner function of the time-evolved initial state, so that the contribution of the classical Liouville equation and higher-order quantum corrections to the Wigner function time evolution equation towards the Krylov state complexity can be identified. Next, we construct the double phase space functions associated with the Krylov basis for operators by using a suitable generalisation of the Weyl transformation applicable for superoperators, and use them to rewrite the Krylov operator complexity as an integral over the double phase space in terms of a generalisation of the usual Wigner function. These results, in particular, show that the complexity measures based on the expansion of a time-evolved state (or an operator) in the Krylov basis can be thought to belong to a general class of complexity measures constructed from the expansion coefficients of the time-dependent Wigner function in an orthonormal basis in the phase space, and help us to connect these complexity measures with measures of complexity of time evolved state based on harmonic expansion of the time-dependent Wigner function.
A bstract We consider the statistics of the results of a measurement of the spreading operator in the Krylov basis generated by the Hamiltonian of a quantum system starting from a specified initial pure state. We first obtain the probability distribution of the results of measurements of this spreading operator at a certain instant of time, and compute the characteristic function of this distribution. We show that the moments of this characteristic function are related to the so-called generalised spread complexities, and obtain expressions for them in several cases when the Hamiltonian is an element of a Lie algebra. Furthermore, by considering a continuum limit of the Krylov basis, we show that the generalised spread complexities of higher orders have a peak in the time evolution for a random matrix Hamiltonian belonging to the Gaussian unitary ensemble. We also obtain an upper bound in the change in generalised spread complexity at an arbitrary time in terms of the operator norm of the Hamiltonian and discuss the significance of these results.
Quantum simulation of complex many-body systems beyond classical computational capabilities provides a promising route toward understanding novel quantum phases and their transitions. In particular, analog quantum simulators with global control fields have attracted considerable attention due to their potential to simulate arbitrary Hamiltonians and perform quantum computing tasks. However, a clear, quantitative measure for the complexity of implementing specific quantum operations in such systems is still lacking. In this Letter, we address this challenge by introducing generalized Krylov complexity, a concept originating from operator growth dynamics, as a direct diagnosis for this synthesis complexity. We construct the block Krylov basis generated by a set of Hamiltonians, which naturally organizes the operator space achievable through the simulator's native interactions and their nested commutators. By analyzing representative systems including Rydberg atom arrays, we demonstrate that the generalized Krylov complexity of a target operation serves as a strong predictor of the minimum time required for its realization. Our results establish Krylov complexity as an intuitive and predictive tool for designing efficient control protocols in analog quantum simulators.
We analyze the properties of Krylov state complexity in qubit dynamics, considering a single qubit and a qubit pair. A geometrical picture of the Krylov complexity is discussed for the single-qubit case, whereas it becomes non-trivial for the two-qubit case. Considering the particular case of interacting Rydberg two-level atoms, we show that the Krylov basis obtained using an effective Hamiltonian minimizes the time-averaged spread complexity compared to that which is obtained from the original Hamiltonian. We further generalize the latter property to an arbitrary Hamiltonian in which the entire Hilbert space comprises of two subspaces provided a weak coupling between them.
This paper establishes that Krylov complexity contains the entire information about the dynamics of a quantum operator, extending the list of equivalent quantities that can serve this purpose, such as the Lanczos coefficients, the return amplitude, and the spectral density. To demonstrate this equivalence, an explicit recursive algorithm is constructed to calculate Lanczos coefficients from the Taylor expansion of the Krylov complexity around t=0t=0t=0. Furthermore, the paper discusses the distinction between Krylov and spread complexity, clarifying why a similar recursive algorithm cannot exist for the latter without additional dynamical input. These results provide a ``proof of principle'' for using Krylov complexity as a complete characterization of operator evolution in quantum systems.
A bstract We investigate the Krylov complexity of Schrödinger field theories, focusing on both bosonic and fermionic systems within the grand canonical ensemble which includes a chemical potential. Krylov complexity measures operator growth in quantum systems by analyzing how operators spread within the Krylov space, a subspace of the Hilbert space spanned by successive applications of the superoperator [ H , ·] on an initial operator. Using the Lanczos algorithm, we construct an orthonormal Krylov basis and derive the Lanczos coefficients, which govern the operator connectivity and thus characterize the complexity. Our study reveals that the Lanczos coefficients { b n } are almost independent of the chemical potential, while { a n } are dependent on the chemical potential. Both { a n } and { b n } show linear relationships with respect to n . For both bosonic and fermionic systems, the Krylov complexities behave similarly over time, especially at late times, due to the analogous profiles of the squared absolute values of their autocorrelation functions | φ 0 ( t )| 2 . The Krylov complexity grows exponentially with time, but its asymptotic scaling factor λ K is significantly smaller than the twice of the slope of the { b n } coefficients, contrasting to the relativistic field theories where the scaling aligns more closely with the twice of the slope of { b n }.