Krylov complexity for Jacobi coherent states

A bstract We develop computational tools necessary to extend the application of Krylov complexity beyond the simple Hamiltonian systems considered thus far in the literature. As a first step toward this broader goal, we show how the Lanczos algorithm that iteratively generates the Krylov basis can be augmented to treat coherent states associated with the Jacobi group, the semi-direct product of the 3-dimensional real Heisenberg-Weyl group H 1 , and the symplectic group, Sp(2, ℝ ) ≃ SU(1, 1). Such coherent states are physically realized as squeezed states in, for example, quantum optics 1. With the Krylov basis for both the SU(1, 1) and Heisenberg-Weyl groups being well understood, their semi-direct product is also partially analytically tractable. We exploit this to benchmark a scheme to numerically compute the Lanczos coefficients which, in principle, generalizes to the more general Jacobi group H n ⋊ Sp(2 n , ℝ ).