REVIEW 1 cited by
Krylov complexity and Trotter transitions in unitary circuit dynamics
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We investigate many-body dynamics where the evolution is governed by unitary circuits through the lens of `Krylov complexity', a recently proposed measure of complexity and quantum chaos. We extend the formalism of Krylov complexity to unitary circuit dynamics and focus on Floquet circuits arising as the Trotter decomposition of Hamiltonian dynamics. For short Trotter steps the results from Hamiltonian dynamics are recovered, whereas a large Trotter step results in different universal behavior characterized by the existence of local maximally ergodic operators: operators with vanishing autocorrelation functions, as exemplified in dual-unitary circuits. These operators exhibit maximal complexity growth, act as a memoryless bath for the dynamics, and can be directly probed in current quantum computing setups. These two regimes are separated by a crossover in chaotic systems. Conversely, we find that free integrable systems exhibit a nonanalytic transition between these different regimes, where maximally ergodic operators appear at a critical Trotter step.
Forward citations
Cited by 1 Pith paper
-
Streamlined Krylov construction and classification of ergodic Floquet systems
A Szegő/CMV Krylov construction maps Floquet unitary dynamics to a five-diagonal chain, with a conjectured classification of chaos and integrability by Verblunsky coefficient asymptotics.
Discussion (0). Continue with ORCID to comment.