Krylov complexity of density matrix operators

Quantifying complexity in quantum systems has witnessed a surge of interest in recent years, with Krylov-based measures such as Krylov complexity (CK) and Spread complexity (CS) gaining prominence. In this study, we investigate their interplay by considering the complexity of states represented by density matrix operators. After setting up the problem, we analyze a handful of analytical and numerical examples spanning generic two-dimensional Hilbert spaces, qubit states, quantum harmonic oscillators, and random matrix theories, uncovering insightful relationships. For generic pure states, our analysis reveals two key findings: (I) a correspondence between moment-generating functions (of Lanczos coefficients) and survival amplitudes, and (II) an early-time equivalence between CK and 2CS. Furthermore, for maximally entangled pure states, we find that the moment-generating function of CK becomes the Spectral Form Factor and, at late-times, CK is simply related to NCS for N2 within the N-dimensional Hilbert space. Notably, we confirm that CK = 2CS holds across all times when N=2. Through the lens of random matrix theories, we also discuss deviations between complexities at intermediate times and highlight subtleties in the averaging approach at the level of the survival amplitude.