Superadditivity of Krylov Complexity for Tensor Products
Jeff Murugan, Hendrik J. R. van Zyl
TL;DR
Addresses how Krylov (spread) complexity behaves when two quantum systems are combined via a tensor product. Uses an analytic proof based on a positive semidefinite excess operator $\hat{\Delta}_C$ and a Krylov-graph/diffusion framework that maps operator growth onto a two-dimensional lattice with diagonal shells and binomial weights. Finds a general superadditivity, $C_{12} \ge C_1 + C_2$, with equality only for synchronous evolution, and characterizes the excess by the diagonal/off-diagonal structure of $\hat{\Delta}_C$, illustrated explicitly in $su(2)$ examples. In the continuum limit, Krylov dynamics reduces to a two-dimensional diffusion with drift, and the excess is tied to the curvature of the Krylov geometry, explaining why tensor-product systems can exhibit enhanced but non-chaotic growth.
Abstract
We study Krylov complexity for quantum systems whose Hamiltonians factorise as tensor products. We prove that complexity is superadditive under tensor products, $C_{12}\ge C_1+C_2$, and identify a positive operator that quantifies the resulting excess complexity. The underlying mechanism is made transparent by introducing a Krylov graph representation in which tensor products generate a higher-dimensional lattice whose diagonal shells encode operator growth and binomial path multiplicities. In the continuum limit, Krylov dynamics reduces to diffusion on this graph, with superadditivity arising from geometric broadening across shells. Explicit examples illustrate how deviations from synchronous evolution generate bounded, oscillatory excess complexity.
