On Minimizing Krylov Complexity Using Higher-Order Generators

TL;DR

This paper challenges the assumption that Krylov basis is optimal for quantum system complexity, proposing higher-order generators that can reduce complexity spread, with implications for understanding quantum dynamics.

Contribution

It introduces higher-order generators for Krylov complexity, disproves the optimality of the Krylov basis, and provides a framework for constructing more efficient generators.

Findings

Higher-order generators exhibit smaller Krylov complexity.

Infinite-order generators outperform first-order in complexity reduction.

Results from Gaussian Unitary Ensembles support the theoretical claims.

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.