Related papers: Towards verifications of Krylov complexity
We establish a direct correspondence between the Lanczos approach and the orthogonal polynomials approach in random matrix theory. In the large-$N$ and continuum limits, the average Lanczos coefficients and the recursion coefficients become…
We develop K$\omega$, an open-source linear algebra library for the shifted Krylov subspace methods. The methods solve a set of shifted linear equations $(z_k I-H)x^{(k)}=b\, (k=0,1,2,...)$ for a given matrix $H$ and a vector $b$,…
We consider a family of $2 \times 2$ operator matrices ${\mathcal A}_\mu(k),$ $k \in {\Bbb T}^3:=(-\pi, \pi]^3,$ $\mu>0$, acting in the direct sum of zero- and one-particle subspaces of a Fock space. It is associated with the Hamiltonian of…
We study operator complexity on various time scales with emphasis on those much larger than the scrambling period. We use, for systems with a large but finite number of degrees of freedom, the notion of K-complexity employed in…
We study upper bounds on the growth of operator entropy $S_K$ in operator growth. Using uncertainty relation, we first prove a dispersion bound on the growth rate $|\partial_t S_K|\leq 2b_1 \Delta S_K$, where $b_1$ is the first Lanczos…
Bilevel optimization, with broad applications in machine learning, has an intricate hierarchical structure. Gradient-based methods have emerged as a common approach to large-scale bilevel problems. However, the computation of the…
The first step in the counting operator analysis of the spectrum of any model Hamiltonian H is the choice of a Hermitean operator M in such a way that the third commutator with H is proportional to the first commutator. Next one calculates…
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…
The Krylov subspace method is a standard approach to approximate quantum evolution, allowing to treat systems with large Hilbert spaces. Although its application is general, and suitable for many-body systems, estimation of the committed…
The question of thermalization in quantum many-body systems has long been studied through the properties of matrix elements of operators corresponding to local observables. More recently, the focus has shifted to the dynamics of operators,…
We point out an interesting connection between the mathematical framework of the Krylov basis, which is used to quantify quantum complexity, and the entanglement entropy in high-energy QCD. In particular, we observe that the cascade…
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.…
We show that the characteristic function of the probability distribution associated with the change of an observable in a two-point measurement protocol with a perturbation can be written as an auto-correlation function between an initial…
Operator spreading under stroboscopic time evolution due to a unitary is studied. An operator Krylov space is constructed and related to orthogonal polynomials on a unit circle (OPUC), as well as to the Krylov space of the edge operator of…
Contractive selfadjoint extensions of a Hermitian contraction $B$ in a Hilbert space ${\mathfrak H}$ with an exit in some larger Hilbert space ${\mathfrak H}\oplus{\mathcal H}$ are investigated. This leads to a new geometric approach for…
We relate the probability distribution of the work done on a statistical system under a sudden quench to the Lanczos coefficients corresponding to evolution under the post-quench Hamiltonian. Using the general relation between the moments…
Understanding the complexity of quantum many-body systems has been attracting much attention recently for its fundamental importance in characterizing complex quantum phases beyond the scope of quantum entanglement. Here, we investigate…
Krylov subspace methods are among the most extensively studied early fault-tolerant quantum algorithms for estimating ground-state energies of quantum systems. However, the rapid onset of ill-conditioning might make accurate energies…
We develop an algorithm for computing the solution of a large system of linear ordinary differential equations (ODEs) with polynomial inhomogeneity. This is equivalent to computing the action of a certain matrix function on the vector…
This paper is devoted to the construction of a hyperkaehler structure on the complexification of any Hermitian-symmetric affine coadjoint orbit O of a semi-simple L*-group of compact type, which is compatible with the complex symplectic…