Streamlined Krylov construction and classification of ergodic Floquet systems

We generalize the Krylov construction to periodically driven (Floquet) quantum systems using the theory of orthogonal polynomials on the unit circle. Compared to other approaches, our method works faster and maps any quantum dynamics to a one-dimensional tight-binding Krylov chain, which is efficiently simulated on both classical and quantum computers. We also suggest a classification of chaotic and integrable Floquet systems based on the asymptotic behavior of Krylov chain hopping parameters (Verblunsky coefficients). We illustrate this classification with random matrix ensembles, kicked top, and kicked Ising chain.