Quantum complexity and localization in random and time-periodic unitary circuits
Himanshu Sahu, Aranya Bhattacharya, Pingal Pratyush Nath

TL;DR
This paper investigates how Krylov complexity evolves and saturates in random quantum circuits, revealing linear growth, effects of measurements, and phase transitions between thermal and localized states.
Contribution
It provides a detailed analysis of K-complexity dynamics in various random circuits, including effects of measurements and phase transitions, extending understanding of quantum complexity growth.
Findings
K-complexity grows linearly and saturates at D/2 in Haar-random circuits
Measurements slow down K-complexity growth
Localized phases reduce late-time saturation values and indicate phase transitions
Abstract
We study the growth and saturation of Krylov spread (K-) complexity under random quantum circuits. In Haar-random unitary evolution, we show that, for large system sizes, K-complexity grows linearly before saturating at a late-time value of , where is the Hilbert space dimension, at timescales . Our numerical analysis encompasses two classes of random circuits: brick-wall random unitary circuits and Floquet random circuits. In brick-wall case, K-complexity exhibits dynamics consistent with Haar-random unitary evolution, while the inclusion of measurements significantly slows its growth down. For Floquet random circuits, we show that localized phases lead to reduced late-time saturation values of K-complexity, forbye we utilize these saturation values to probe the transition between thermal and many-body localized phases.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
