Abstract We study Krylov complexity of a one-dimensional Bosonic system, the celebrated Bose-Hubbard Model. The Bose-Hubbard Hamiltonian consists of interacting bosons on a lattice, describing ultra-cold atoms. Apart from showing superfluid-Mott insulator phase transition, the model also exhibits both chaotic and integrable (mixed) dynamics depending on the value of the interaction parameter. We focus on the three-site Bose Hubbard Model (with different particle numbers), which is known to be highly mixed. We use the Lanczos algorithm to find the Lanczos coefficients and the Krylov basis. The orthonormal Krylov basis captures the operator growth for a system with a given Hamiltonian. However, the Lanczos algorithm needs to be modified for our case due to the instabilities instilled by the piling up of computational errors. Next, we compute the Krylov complexity and its early and late-time behaviour. Our results capture the chaotic and integrable nature of the system. Our paper takes the first step to use the Lanczos algorithm non-perturbatively for a discrete quartic bosonic Hamiltonian without depending on the auto-correlation method.
Abstract We study Krylov complexity of a one-dimensional Bosonic system, the celebrated Bose-Hubbard Model. The Bose-Hubbard Hamiltonian consists of interacting bosons on a lattice, describing ultra-cold atoms. Apart from showing superfluid-Mott insulator phase transition, the model also exhibits both chaotic and integrable (mixed) dynamics depending on the value of the interaction parameter. We focus on the three-site Bose Hubbard Model (with different particle numbers), which is known to be highly mixed. We use the Lanczos algorithm to find the Lanczos coefficients and the Krylov basis. The orthonormal Krylov basis captures the operator growth for a system with a given Hamiltonian. However, the Lanczos algorithm needs to be modified for our case due to the instabilities instilled by the piling up of computational errors. Next, we compute the Krylov complexity and its early and late-time behaviour. Our results capture the chaotic and integrable nature of the system. Our paper takes the first step to use the Lanczos algorithm non-perturbatively for a discrete quartic bosonic Hamiltonian without depending on the auto-correlation method.
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 }.
A bstract Continuing the previous initiatives [1, 2], we pursue the exploration of operator growth and Krylov complexity in dissipative open quantum systems. In this paper, we resort to the bi-Lanczos algorithm generating two bi-orthogonal Krylov spaces, which individually generate non-orthogonal subspaces. Unlike the previously studied Arnoldi iteration, this algorithm renders the Lindbladian into a purely tridiagonal form, thus opening up a possibility to study a wide class of dissipative integrable and non-integrable systems by computing Krylov complexity at late times. Our study relies on two specific systems, the dissipative transverse-field Ising model (TFIM) and the dissipative interacting XXZ chain. We find that, for the weak coupling, initial Lanczos coefficients can efficiently distinguish integrable and chaotic evolution before the dissipative effect sets in, which results in more fluctuations in higher Lanczos coefficients. This results in the equal saturation of late-time complexity for both integrable and chaotic cases, making the notion of late-time chaos dubious.
We study the operator growth problem and its complexity in the many-body localization (MBL) system from the Lanczos algorithm perspective. Using the Krylov basis, the operator growth problem can be viewed as a single-particle hopping problem on a semi-infinite chain with the hopping amplitudes given by the Lanczos coefficients. We find that, in the MBL systems, the Lanczos coefficients scale as ∼ n/ ln(n) asymptotically, same as in the ergodic systems, but with an additional even-odd alteration and an effective randomness. We use a simple linear extrapolation scheme as an attempt to extrapolate the Lanczos coefficients to the thermodynamic limit. With the original and extrapolated Lanczos coefficients, we study the properties of the emergent single-particle hopping problem via its spectral function, integrals of motion, Krylov complexity, wavefunction profile and return probability. Our numerical results of the above quantities suggest that the emergent single-particle hopping problem in the MBL system is localized when initialized on the first site. We also study the operator growth in the MBL phenomenological model, whose Lanczos coefficients also have an even-odd alteration, but approach constants asymptotically. The Krylov complexity grows linearly in time in this case.
We study the operator growth problem and its complexity in the many-body localization (MBL) system from the Lanczos algorithm perspective. Using the Krylov basis, the operator growth problem can be viewed as a single-particle hopping problem on a semi-infinite chain with the hopping amplitudes given by the Lanczos coefficients. We find that, in the MBL systems, the Lanczos coefficients scale as \sim n/\ln(n) ∼ n / ln ( n ) asymptotically, same as in the ergodic systems, but with an additional even-odd alteration and an effective randomness. We use a simple linear extrapolation scheme as an attempt to extrapolate the Lanczos coefficients to the thermodynamic limit. With the original and extrapolated Lanczos coefficients, we study the properties of the emergent single-particle hopping problem via its spectral function, integrals of motion, Krylov complexity, wavefunction profile and return probability. Our numerical results of the above quantities suggest that the emergent single-particle hopping problem in the MBL system is localized when initialized on the first site. We also study the operator growth in the MBL phenomenological model, whose Lanczos coefficients also have an even-odd alteration, but approach constants asymptotically. The Krylov complexity grows linearly in time in this case.
We investigate Krylov state complexity in a tilted extended Bose-Hubbard chain in which both the on-site interaction U and nearest-neighbor interaction V are present. The tilted extended Bose-Hubbard model can be realized with Rydberg-dressed interactions in optical lattices. Using exact diagonalization and Lanczos recursion from three physically motivated Fock states, we compute the time-dependent complexity, its long-time saturation value, and the fluctuations of the Lanczos coefficients for an open chain at unit filling. Crucially, we identify a pronounced quasi-chaotic diagonal regime near U≃V in which the Krylov complexity saturation exhibits a sharp ridge while the spectral level-spacing statistics remain partially chaotic. This dissociation arises from the competition between the on-site and nearest-neighbor interaction, which generates a dense manifold of near-resonant many-body configurations that is efficiently coupled by the state-dependent dynamics but retains residual spectral structure. Our results show that Krylov state complexity provides complementary, state-sensitive information about many-body chaos that is not captured by the spectral diagnostics alone, establishing Krylov complexity as a useful diagnostic for studying thermalization and information scrambling in experimentally accessible quantum simulators.
Recently, a novel measure for the complexity of operator growth is proposed based on Lanczos algorithm and Krylov recursion method. We study this Krylov complexity in quantum mechanical systems derived from some well-known local toric Calabi–Yau geometries, as well as some nonrelativistic models. We find that for the Calabi–Yau models, the Lanczos coefficients grow slower than linearly for small [Formula: see text]’s, consistent with the behavior of integrable models. On the other hand, for the nonrelativistic models, the Lanczos coefficients initially grow linearly for small [Formula: see text]’s, then reach a plateau. Although this looks like the behavior of a chaotic system, it is mostly likely due to saddle-dominated scrambling effects instead, as argued in the literature. In our cases, the slopes of linearly growing Lanczos coefficients almost saturate a bound by the temperature. During our study, we also provide an alternative general derivation of the bound for the slope.