Pith. sign in

REVIEW 2 cited by

Quantum complexity and localization in random and time-periodic unitary circuits

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

arxiv 2409.03656 v3 pith:RBRZLDN5 submitted 2024-09-05 quant-ph cond-mat.dis-nncond-mat.stat-mechcond-mat.str-elhep-th

Quantum complexity and localization in random and time-periodic unitary circuits

classification quant-ph cond-mat.dis-nncond-mat.stat-mechcond-mat.str-elhep-th
keywords circuitsrandomcomplexityunitarybasisbrick-wallevolutionfloquet
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study the growth and saturation of complexity in Krylov basis in random quantum circuits. In Haar-random unitary evolution, we show that, for large system sizes, this notion of complexity grows linearly before saturating at a late-time value of $d/2$, where $d$ is the Hilbert space dimension, at timescales $\sim d$. Our numerical analysis encompasses two classes of random circuits: brick-wall random unitary circuits and Floquet random circuits. In brick-wall case, complexity in Krylov basis 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 the complexity enabling us to probe the transition between thermal and many-body localized phases.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Resource generation and dynamical complexities in open random quantum circuits

    quant-ph 2026-05 unverdicted novelty 6.0

    Memoryful open random quantum circuits sustain entanglement and magic growth like unitary circuits while memoryless ones show decaying entanglement but persistent magic, with memoryful dynamics approaching k-designs m...

  2. Krylov Complexity

    hep-th 2025-07 unverdicted novelty 2.0

    Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.