Speaker
Jaco van Zyl
(University of Cape Town, South Africa)
Description
Spread complexity can be solved for analytically in the case of simple Hamiltonians (i.e. Hamiltonians that are elements of some rank 1 algebra). For general Hamiltonians the Lanczos algorithm provides an algorithmic way to compute the Krylov basis and thus the spread complexity. A natural question to ask is what happens when one considers a Hamiltonian that is formed from a direct sum of subsystems for which the Krylov bases are known. In this talk I will discuss some general results that hold for such systems and under what conditions they simplify.
