Related papers: On Minimizing Krylov Complexity Using Higher-Order…
The Krylov subspace methods, being one category of the most important classical numerical methods for linear algebra problems, can be much more powerful when generalised to quantum computing. However, quantum Krylov subspace algorithms are…
We propose and test logarithmic Krylov (logK) complexity, an operator growth measure akin to Krylov complexity defined through a replica approach, as a viable probe of early-time operator scrambling without false positives. In…
We investigate the Krylov complexity of Schr\"odinger field theories, focusing on both bosonic and fermionic systems within the grand canonical ensemble that includes a chemical potential. Krylov complexity measures operator growth in…
In this work, we propose a quantum-mechanically measurable basis for the computation of spread complexity. Current literature focuses on computing different powers of the Hamiltonian to construct a basis for the Krylov state space and the…
Krylov complexity measures the spread of the wavefunction in the Krylov basis, which is constructed using the Hamiltonian and an initial state. We investigate the evolution of the maximally entangled state in the Krylov basis for both…
We investigate the relationship between Krylov complexity and operator quantum speed limits (OQSLs) of the complexity operator and level repulsion in random/integrable matrices and many-body systems. An enhanced level-repulsion corresponds…
We introduce and review a new complexity measure, called `Krylov complexity', which takes its origins in the field of quantum-chaotic dynamics, serving as a canonical measure of operator growth and spreading. Krylov complexity, underpinned…
In closed quantum systems, Krylov complexity admits a geometric description; operator growth is equivalent to Hamiltonian flow in an emergent phase space whose structure is fixed by the Lanczos coefficients. We show that this picture…
The complexity of quantum evolutions can be understood by examining their dispersion in a chosen basis. Recent research has stressed the fact that the Krylov basis is particularly adept at minimizing this dispersion [V. Balasubramanian et…
In quantum many-body systems, time-evolved states typically remain confined to a smaller region of the Hilbert space known as the $\textit{Krylov subspace}$. The time evolution can be mapped onto a one-dimensional problem of a particle…
Krylov complexity is considered to provide a measure of the growth of operators evolving under Hamiltonian dynamics. The main strategy is the analysis of the structure of Krylov subspace $\mathcal{K}_M(\mathcal{H},\eta)$ spanned by the…
A model order reduction algorithm is presented that generates a reduced-order model of the original high-order model, which ensures high-fidelity within the desired time interval. The reduced model satisfies a subset of the first-order…
Building upon recent research in spin systems with non-local interactions, this study investigates operator growth using the Krylov complexity in different non-local versions of the Ising model. We find that the non-locality results in a…
Heisenberg time evolution under a chaotic many-body Hamiltonian $H$ transforms an initially simple operator into an increasingly complex one, as it spreads over Hilbert space. Krylov complexity, or `K-complexity', quantifies this growth…
A standard approach to model reduction of large-scale higher-order linear dynamical systems is to rewrite the system as an equivalent first-order system and then employ Krylov-subspace techniques for model reduction of first-order systems.…
Krylov methods rely on iterated matrix-vector products $A^k u_j$ for an $n\times n$ matrix $A$ and vectors $u_1,\ldots,u_m$. The space spanned by all iterates $A^k u_j$ admits a particular basis -- the \emph{maximal Krylov basis} -- which…
We develop a geometric approach to operator growth and Krylov complexity in many-body quantum systems governed by symmetries. We start by showing a direct link between a unitary evolution with the Liouvillian and the displacement operator…
Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in…
We apply a notion of quantum complexity, called "Krylov complexity", to study the evolution of systems from integrability to chaos. For this purpose we investigate the integrable XXZ spin chain, enriched with an integrability breaking…
The dynamics of quantum systems unfolds within a subspace of the state space or operator space, known as the Krylov space. This review presents the use of Krylov subspace methods to provide an efficient description of quantum evolution and…